( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Modifying a Graph Using Vertex Elimination.

, , , , , и . Algorithmica, 72 (1): 99-125 (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.

Petr Rudenko

Petr Hyspecký

Petr Obrdlik

Andreas Petr

Petr Bohata

 

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

Going Far from Degeneracy., , , , , и . SIAM J. Discret. Math., 34 (3): 1587-1601 (2020)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)Modifying a Graph Using Vertex Elimination., , , , , и . Algorithmica, 72 (1): 99-125 (2015)Recognizing Threshold Tolerance Graphs in O(n2) Time., , , , , и . WG, том 8747 из Lecture Notes in Computer Science, стр. 214-224. Springer, (2014)Induced Disjoint Paths in Circular-Arc Graphs in Linear Time., , и . WG, том 8747 из Lecture Notes in Computer Science, стр. 225-237. Springer, (2014)Enumeration and maximum number of minimal dominating sets for chordal graphs., , , и . Theor. Comput. Sci., (2019)Spanners in Sparse Graphs., , и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 597-608. Springer, (2008)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)