Magne, Loïc; Paul, Christophe; Sharma, Abhijat; Thilikos, Dimitrios M. Edge-treewidth: algorithmic and combinatorial properties. (English) Zbl 1526.05131 Discrete Appl. Math. 341, 40-54 (2023). MSC: 05C83 68Q17 05C05 PDFBibTeX XMLCite \textit{L. Magne} et al., Discrete Appl. Math. 341, 40--54 (2023; Zbl 1526.05131) Full Text: DOI arXiv
Mescoff, Guillaume; Paul, Christophe; Thilikos, Dimitrios M. The mixed search game against an agile and visible fugitive is monotone. (English) Zbl 1508.05115 Discrete Math. 346, No. 4, Article ID 113345, 13 p. (2023). MSC: 05C57 91A43 91A05 91A24 05C76 68Q25 68R10 68P10 PDFBibTeX XMLCite \textit{G. Mescoff} et al., Discrete Math. 346, No. 4, Article ID 113345, 13 p. (2023; Zbl 1508.05115) Full Text: DOI arXiv
Paul, Christophe; Protopapas, Evangelos; Thilikos, Dimitrios M. Universal Obstructions of Graph Parameters. arXiv:2304.14121 Preprint, arXiv:2304.14121 [cs.DM] (2023). MSC: 05C85 05C83 05C75 BibTeX Cite \textit{C. Paul} et al., ``Universal Obstructions of Graph Parameters'', Preprint, arXiv:2304.14121 [cs.DM] (2023) Full Text: arXiv OA License
Paul, Christophe; Protopapas, Evangelos; Thilikos, Dimitrios M. Graph Parameters, Universal Obstructions, and WQO. arXiv:2304.03688 Preprint, arXiv:2304.03688 [math.CO] (2023). MSC: 06A07 05C83 05C85 BibTeX Cite \textit{C. Paul} et al., ``Graph Parameters, Universal Obstructions, and WQO'', Preprint, arXiv:2304.03688 [math.CO] (2023) Full Text: arXiv OA License
Mescoff, Guillaume; Paul, Christophe; Thilikos, Dimitrios M. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. (English) Zbl 07497778 Discrete Appl. Math. 312, 72-85 (2022). MSC: 68R10 68Q25 05C85 91A43 05C05 PDFBibTeX XMLCite \textit{G. Mescoff} et al., Discrete Appl. Math. 312, 72--85 (2022; Zbl 07497778) Full Text: DOI
Kanté, Mamadou M.; Paul, Christophe; Thilikos, Dimitrios M. A linear fixed parameter tractable algorithm for connected pathwidth. (English) Zbl 1485.05172 SIAM J. Discrete Math. 36, No. 1, 411-435 (2022). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{M. M. Kanté} et al., SIAM J. Discrete Math. 36, No. 1, 411--435 (2022; Zbl 1485.05172) Full Text: DOI arXiv
Adler, Isolde; Paul, Christophe; Thilikos, Dimitrios M. Connected search for a lazy robber. (English) Zbl 1522.05300 J. Graph Theory 97, No. 4, 510-552 (2021). MSC: 05C57 91A43 91A24 05C40 PDFBibTeX XMLCite \textit{I. Adler} et al., J. Graph Theory 97, No. 4, 510--552 (2021; Zbl 1522.05300) Full Text: DOI
Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. (English) Zbl 1528.68148 Networks 75, No. 3, 259-277 (2020). MSC: 68Q27 68Q17 68R10 90C35 PDFBibTeX XMLCite \textit{J. Baste} et al., Networks 75, No. 3, 259--277 (2020; Zbl 1528.68148) Full Text: DOI
Kanté, Mamadou Moustapha; Paul, Christophe; Thilikos, Dimitrios M. 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 \textit{M. M. Kanté} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 64, 16 p. (2020; Zbl 07651203) Full Text: DOI
Limnios, Stratis; Paul, Christophe; Perret, Joanny; Thilikos, Dimitrios M. Edge degeneracy: algorithmic and structural results. (English) Zbl 1457.91107 Theor. Comput. Sci. 839, 164-175 (2020). MSC: 91A43 91A24 PDFBibTeX XMLCite \textit{S. Limnios} et al., Theor. Comput. Sci. 839, 164--175 (2020; Zbl 1457.91107) Full Text: DOI arXiv
Adler, Isolde; Paul, Christophe; Thilikos, Dimitrios M. 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 \textit{I. Adler} et al., LIPIcs -- Leibniz Int. Proc. Inform. 150, Article 7, 14 p. (2019; Zbl 07650304) Full Text: DOI
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Explicit linear kernels for packing problems. (English) Zbl 1422.68111 Algorithmica 81, No. 4, 1615-1656 (2019). MSC: 68Q25 05C70 05C83 90C27 PDFBibTeX XMLCite \textit{V. Garnero} et al., Algorithmica 81, No. 4, 1615--1656 (2019; Zbl 1422.68111) Full Text: DOI arXiv
Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M. 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 \textit{J. Baste} et al., LIPIcs -- Leibniz Int. Proc. Inform. 89, Article 3, 12 p. (2018; Zbl 1443.68119) Full Text: DOI arXiv
Kim, Eun Jung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. An FPT 2-approximation for tree-cut decomposition. (English) Zbl 1386.68221 Algorithmica 80, No. 1, 116-135 (2018). MSC: 68W25 05C05 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{E. J. Kim} et al., Algorithmica 80, No. 1, 116--135 (2018; Zbl 1386.68221) Full Text: DOI arXiv
Cohen, Nathann; Gonçalves, Daniel; Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias A polynomial-time algorithm for outerplanar diameter improvement. (English) Zbl 1372.05216 J. Comput. Syst. Sci. 89, 315-327 (2017). MSC: 05C85 05C12 90C39 PDFBibTeX XMLCite \textit{N. Cohen} et al., J. Comput. Syst. Sci. 89, 315--327 (2017; Zbl 1372.05216) Full Text: DOI arXiv
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Parameterized algorithms for min-max multiway cut and list digraph homomorphism. (English) Zbl 1370.68131 J. Comput. Syst. Sci. 86, 191-206 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{E. J. Kim} et al., J. Comput. Syst. Sci. 86, 191--206 (2017; Zbl 1370.68131) Full Text: DOI Link
Kim, Eun Jung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 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 \textit{E. J. Kim} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 78--89 (2015; Zbl 1378.68084) Full Text: DOI arXiv
Kim, Eunjung; Oum, Sang-il; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 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). MSC: 68W25 05C05 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{E. Kim} et al., Lect. Notes Comput. Sci. 9499, 35--46 (2015; Zbl 1386.68222) Full Text: DOI arXiv
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. Explicit linear kernels via dynamic programming. (English) Zbl 1323.05119 SIAM J. Discrete Math. 29, No. 4, 1864-1894 (2015). MSC: 05C85 05C42 05C83 68Q25 90C39 PDFBibTeX XMLCite \textit{V. Garnero} et al., SIAM J. Discrete Math. 29, No. 4, 1864--1894 (2015; Zbl 1323.05119) Full Text: DOI arXiv Link
Cohen, Nathann; Gonçalves, Daniel; Kim, Eunjung; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M.; Weller, Mathias 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). MSC: 68R10 05C85 68W40 90C39 PDFBibTeX XMLCite \textit{N. Cohen} et al., Lect. Notes Comput. Sci. 9139, 123--142 (2015; Zbl 1464.68280) Full Text: DOI
Garnero, Valentin; Paul, Christophe; Sau, Ignasi; Thilikos, Dimitrios M. 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). MSC: 68Q25 05C83 05C85 90C39 PDFBibTeX XMLCite \textit{V. Garnero} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 312--324 (2014; Zbl 1359.68132) Full Text: DOI