×

Found 21 Documents (Results 1–21)

A linear fixed parameter tractable algorithm for connected pathwidth. (English) Zbl 07651203

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 64, 16 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Connected search for a lazy robber. (English) Zbl 07650304

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 7, 14 p. (2019).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of finding a spanning tree with minimum reload cost diameter. (English) Zbl 1443.68119

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 3, 12 p. (2018).
MSC:  68R10 68Q17 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. (English) Zbl 1378.68084

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, 78-89 (2015).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

An FPT 2-approximation for tree-cut decomposition. (English) Zbl 1386.68222

Sanità, Laura (ed.) et al., Approximation and online algorithms. 13th international workshop, WAOA 2015, Patras, Greece, September 17–18, 2015. Revised selected papers. Cham: Springer (ISBN 978-3-319-28683-9/pbk; 978-3-319-28684-6/ebook). Lecture Notes in Computer Science 9499, 35-46 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A polynomial-time algorithm for outerplanar diameter improvement. (English) Zbl 1464.68280

Beklemishev, Lev D. (ed.) et al., Computer science – theory and applications. 10th international computer science symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9139, 123-142 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Explicit linear kernels via dynamic programming. (English) Zbl 1359.68132

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 312-324 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field