( en | de | ru )

 

Disambiguation of "Thilikos, Dimitrios M."

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized algorithms for min-max multiway cut and list digraph homomorphism.

, , , and . J. Comput. Syst. Sci., (2017)

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.

Dimitrios Karantonis

Dimitrios Koulousakis

Dimitrios Repantis

Dimitrios Papakostas

Dimitrios Parashu

 

Other publications of authors with the same name

Graphs with Branchwidth at Most Three., and . J. Algorithms, 32 (2): 167-194 (1999)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 304-315. Springer, (2001)Connected Graph Searching in Outerplanar Graphs., , and . Electron. Notes Discret. Math., (2005)Square Roots of Minor Closed Graph Classes., and . Electron. Notes Discret. Math., (2011)Quickly Excluding K2, r from Planar Graphs.. Electron. Notes Discret. Math., (1999)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)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)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)Parameterized algorithms for min-max multiway cut and list digraph homomorphism., , , and . J. Comput. Syst. Sci., (2017)