×

Found 26 Documents (Results 1–26)

Efficient graph minors theory and parameterized algorithms for (planar) disjoint paths. (English) Zbl 07604208

Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 112-128 (2020).
MSC:  68-XX
PDFBibTeX XMLCite
Full Text: DOI arXiv

Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs. (English) Zbl 07603935

Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 367-378 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Decomposition of map graphs with applications. (English) Zbl 07561553

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 60, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reducing CMSO model checking to highly connected graphs. (English) Zbl 1499.68203

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 135, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Erdős-Pósa property of obstructions to interval graphs. (English) Zbl 1490.05205

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 7, 15 p. (2018).
MSC:  05C70 05C62
PDFBibTeX XMLCite
Full Text: DOI

Bidimensionality and geometric graphs. (English) Zbl 1421.68126

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1563-1575 (2012).
PDFBibTeX XMLCite
Full Text: Link

Linear kernels for (connected) dominating set on \(H\)-minor-free graphs. (English) Zbl 1421.68078

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 82-93 (2012).
MSC:  68Q25 05C69 05C83
PDFBibTeX XMLCite
Full Text: Link

Better algorithms and bounds for directed maximum leaf problems. (English) Zbl 1135.90416

Arvind, V. (ed.) et al., FSTTCS 2007: Foundations of software technology and theoretical computer science. 27th international conference, New Delhi, India, December 12–14, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77049-7/pbk). Lecture Notes in Computer Science 4855, 316-327 (2007).
MSC:  90C35 68Q25 05C85
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field