×

Found 38 Documents (Results 1–38)

Upward book embeddings of st-graphs. (English) Zbl 1512.68194

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 13, 22 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Cut and count and representative sets on branch decompositions. (English) Zbl 1398.05205

Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 27, 12 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Variants of plane diameter completion. (English) Zbl 1378.68078

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 30-42 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Dynamic programming for \(H\)-minor-free graphs. (English) Zbl 1364.68231

Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 86-97 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Fast sub-exponential algorithms and compactness in planar graphs. (English) Zbl 1346.68117

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 358-369 (2011).
MSC:  68Q25 05C10 05C85
PDFBibTeX XMLCite
Full Text: DOI

Dynamic programming for graphs on surfaces. (English) Zbl 1288.05286

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 372-383 (2010).
MSC:  05C85 68Q25 90C39
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Fast minor testing in planar graphs. (English) Zbl 1287.05141

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 97-109 (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Faster parameterized algorithms for minor containment. (English) Zbl 1285.68206

Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 322-333 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Branchwidth of graphic matroids. (English) Zbl 1130.05017

Hilton, Anthony (ed.) et al., Surveys in combinatorics 2007. Papers from the 21st British combinatorial conference, Reading, UK, July 8–13, 2007. Cambridge: Cambridge University Press (ISBN 978-0-521-69823-8/pbk). London Mathematical Society Lecture Note Series 346, 275-286 (2007).
MSC:  05B35
PDFBibTeX XMLCite

Treewidth: computational experiments. (English) Zbl 1409.05176

Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 54-57 (2001).
MSC:  05C78 05-04
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field