( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized complexity of finding a spanning tree with minimum reload cost diameter.

, , , , , и . Networks, 75 (3): 259-277 (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.

Dimitrios Moulalis

Dimitrios Tourpalis

Dimitrios Tassiopoulos

Dimitrios Dadaliaris

Dimitrios Samios

 

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

Contractions of Planar Graphs in Polynomial Time., , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2010)Preface to special issue on Theory and Applications of Graph Searching., , и . Theor. Comput. Sci., (2019)A Fixed Parameter Algorithm for Plane Subgraph Completion., , , , и . CTW, стр. 97-100. (2015)Acyclic edge coloring through the Lovász Local Lemma., , , и . Theor. Comput. Sci., (2017)Graphs with Branchwidth at Most Three., и . J. Algorithms, 32 (2): 167-194 (1999)Smaller Kernels for Hitting Set Problems of Constant Arity., , и . IWPEC, том 3162 из Lecture Notes in Computer Science, стр. 121-126. Springer, (2004)Fast Minor Testing in Planar Graphs., , , , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 97-109. Springer, (2010)(Meta) Kernelization., , , , , и . J. ACM, 63 (5): 44:1-44:69 (2016)(H, C, K)-Coloring: Fast, Easy, and Hard Cases., , и . MFCS, том 2136 из Lecture Notes in Computer Science, стр. 304-315. Springer, (2001)FPT Algorithms for Plane Completion Problems., , , , , и . MFCS, том 58 из LIPIcs, стр. 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)