( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
FPT Algorithms for Plane Completion Problems.

, , , , , и . MFCS, том 58 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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 Parashu

Dimitrios Koulousakis

Dimitrios Papasotiriou

Dimitrios Repantis

 

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

(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , и . MFCS, том 2136 из Lecture Notes in Computer Science, стр. 304-315. Springer, (2001)Square Roots of Minor Closed Graph Classes., и . Electron. Notes Discret. Math., (2011)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , и . Theory Comput. Syst., 64 (2): 251-271 (2020)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)Contractions of Planar Graphs in Polynomial Time., , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2010)Bidimensionality and Kernels., , , и . SODA, стр. 503-510. SIAM, (2010)Killing a vortex., и . FOCS, стр. 1069-1080. IEEE, (2022)Fast FPT-Algorithms for Cleaning Grids., и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 361-371. Springer, (2006)Editing to a planar graph of given degrees., , , , и . J. Comput. Syst. Sci., (2017)