( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Metric Dimension of Bounded Width Graphs.

, , , и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 115-126. Springer, (2015)

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.

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

Petr Bohata

 

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

Parameterized Complexity of Superstring Problems., , , , , и . Algorithmica, 79 (3): 798-813 (2017)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)Enumeration and maximum number of maximal irredundant sets for chordal graphs., , , и . Discret. Appl. Math., (2019)Editing to a planar graph of given degrees., , , , и . J. Comput. Syst. Sci., (2017)On the parameterized complexity of coloring graphs in the absence of a linear forest., , , и . J. Discrete Algorithms, (2012)Computing Tree Decompositions with Small Independence Number., , , , и . CoRR, (2022)Three complexity results on coloring Pk-free graphs., , , и . Eur. J. Comb., 34 (3): 609-619 (2013)Going Far from Degeneracy., , , , , и . SIAM J. Discret. Math., 34 (3): 1587-1601 (2020)