Author of the publication

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Parameterized algorithms for min-max multiway cut and list digraph homomorphism., , , and . J. Comput. Syst. Sci., (2017)A Fixed Parameter Algorithm for Plane Subgraph Completion., , , , and . CTW, page 97-100. (2015)Acyclic edge coloring through the Lovász Local Lemma., , , and . Theor. Comput. Sci., (2017)Preface to special issue on Theory and Applications of Graph Searching., , and . Theor. Comput. Sci., (2019)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 304-315. Springer, (2001)FPT Algorithms for Plane Completion Problems., , , , , and . MFCS, volume 58 of LIPIcs, page 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Modification to Planarity is Fixed Parameter Tractable., , and . STACS, volume 126 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Partial Complementation of Graphs., , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)Square Roots of Minor Closed Graph Classes., and . Electron. Notes Discret. Math., (2011)