×

Found 22 Documents (Results 1–22)

A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs. (English) Zbl 07559148

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 39, 18 p. (2019).
MSC:  68Qxx
Full Text: DOI

Solving partition problems almost always requires pushing many vertices around. (English) Zbl 1524.05240

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 51, 14 p. (2018).

Parameterized complexity of firefighting revisited. (English) Zbl 1352.68098

Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 13-26 (2012).
MSC:  68Q25 05C85 68Q17

Domination when the stars are out. (English) Zbl 1334.68160

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 462-473 (2011).

Complexity results for the spanning tree congestion problem. (English) Zbl 1308.68067

Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 3-14 (2010).
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software