( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dynamic Programming for Graphs on Surfaces

, , и . CoRR, (2011)

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.

Dimitrios Karantonis

Dimitrios Koulousakis

Dimitrios Repantis

Dimitrios Papakostas

Dimitrios Parashu

 

Другие публикации лиц с тем же именем

Graphs with Branchwidth at Most Three., и . J. Algorithms, 32 (2): 167-194 (1999)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , и . MFCS, том 2136 из Lecture Notes in Computer Science, стр. 304-315. Springer, (2001)Connected Graph Searching in Outerplanar Graphs., , и . Electron. Notes Discret. Math., (2005)Square Roots of Minor Closed Graph Classes., и . Electron. Notes Discret. Math., (2011)Quickly Excluding K2, r from Planar Graphs.. Electron. Notes Discret. Math., (1999)Modification to Planarity is Fixed Parameter Tractable., , и . STACS, том 126 из LIPIcs, стр. 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Partial Complementation of Graphs., , , и . SWAT, том 101 из LIPIcs, стр. 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)FPT Algorithms for Plane Completion Problems., , , , , и . MFCS, том 58 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , и . Theory Comput. Syst., 64 (2): 251-271 (2020)Parameterized algorithms for min-max multiway cut and list digraph homomorphism., , , и . J. Comput. Syst. Sci., (2017)