( en | de | ru )

 

Disambiguation of "Golovach, Petr A."

Author of the publication

copydeleteadd this publication to your clipboard
Interval Completion with the Smallest Max-degree.

, and . WG, volume 1517 of Lecture Notes in Computer Science, page 359-371. Springer, (1998)

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. You can also use the button next to the name to display some publications already assigned to the person.

Andreas Petr

Petr Rudenko

Petr Hyspecký

Petr Obrdlik

Petr Bohata

 

Other publications of authors with the same name

Spanning Circuits in Regular Matroids., , , and . CoRR, (2016)Approximation Schemes for Low-Rank Binary Matrix Approximation Problems., , , , and . CoRR, (2018)Editing to a connected graph of given degrees.. Inf. Comput., (2017)Low-rank binary matrix approximation in column-sum norm., , , and . CoRR, (2019)Recognizing Threshold Tolerance Graphs in O(n2) Time., , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)Induced Disjoint Paths in Circular-Arc Graphs in Linear Time., , and . WG, volume 8747 of Lecture Notes in Computer Science, page 225-237. Springer, (2014)An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs., , , and . IPEC, volume 7535 of Lecture Notes in Computer Science, page 85-96. Springer, (2012)Contracting a Chordal Graph to a Split Graph or a Tree., , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 339-350. Springer, (2011)Enumeration and maximum number of minimal dominating sets for chordal graphs., , , and . Theor. Comput. Sci., (2019)Spanners in Sparse Graphs., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 597-608. Springer, (2008)