( en | de | ru )

 

Disambiguation of "Thilikos, Dimitrios M."

Author of the publication

copydeleteadd this publication to your clipboard
Parameterizing Cut Sets in a Graph by the Number of Their Components.

, , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 605-615. Springer, (2009)

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 Papanastasiou

Dimitrios Tourpalis

Dimitrios Moulalis

Dimitrios Tassiopoulos

Dimitrios Dadaliaris

 

Other publications of authors with the same name

Acyclic edge coloring through the Lovász Local Lemma., , , and . Theor. Comput. Sci., (2017)A Fixed Parameter Algorithm for Plane Subgraph Completion., , , , and . CTW, page 97-100. (2015)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)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 304-315. Springer, (2001)Square Roots of Minor Closed Graph Classes., and . Electron. Notes Discret. Math., (2011)Contractions of Planar Graphs in Polynomial Time., , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 122-133. Springer, (2010)Graphs with Branchwidth at Most Three., and . J. Algorithms, 32 (2): 167-194 (1999)