( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.

, , и . WG, том 8747 из Lecture Notes in Computer Science, стр. 225-237. Springer, (2014)

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 Hyspecký

Petr Obrdlik

Petr Bohata

 

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

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)An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs., , , и . IPEC, том 7535 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2012)Parameterized Complexity of Superstring Problems., , , , , и . Algorithmica, 79 (3): 798-813 (2017)Metric Dimension of Bounded Tree-length Graphs., , , и . SIAM J. Discret. Math., 31 (2): 1217-1243 (2017)Metric Dimension of Bounded Width Graphs., , , и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 115-126. Springer, (2015)Induced Disjoint Paths in AT-Free Graphs., , и . SWAT, том 7357 из Lecture Notes in Computer Science, стр. 153-164. Springer, (2012)A linear kernel for finding square roots of almost planar graphs., , , и . Theor. Comput. Sci., (2017)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)