( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves.

, , , и . FCT, том 14292 из Lecture Notes in Computer Science, стр. 392-405. Springer, (2023)

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.

Petr Obrdlik

Petr Hyspecký

Petr Rudenko

Andreas Petr

Petr Danecek

 

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

Induced Disjoint Paths in AT-Free Graphs., , и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 153-164. Springer, (2012)Metric Dimension of Bounded Width Graphs., , , и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 115-126. Springer, (2015)Metric Dimension of Bounded Tree-length Graphs., , , и . SIAM J. Discret. Math., 31 (2): 1217-1243 (2017)Parameterized Aspects of Strong Subgraph Closure., , , , и . Algorithmica, 82 (7): 2006-2038 (2020)A linear kernel for finding square roots of almost planar graphs., , , и . Theor. Comput. Sci., (2017)Modifying a Graph Using Vertex Elimination., , , , , и . Algorithmica, 72 (1): 99-125 (2015)Three complexity results on coloring Pk-free graphs., , , и . Eur. J. Comb., 34 (3): 609-619 (2013)Editing to a planar graph of given degrees., , , , и . J. Comput. Syst. Sci., (2017)Going Far from Degeneracy., , , , , и . SIAM J. Discret. Math., 34 (3): 1587-1601 (2020)On the parameterized complexity of coloring graphs in the absence of a linear forest., , , и . J. Discrete Algorithms, (2012)