( en | de | ru )

 

Disambiguation of "Golovach, Petr A."

Author of the publication

copydeleteadd this publication to your clipboard
A Linear Kernel for Finding Square Roots of Almost Planar Graphs.

, , , and . SWAT, volume 53 of LIPIcs, page 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

Andreas Petr

Petr Danecek

 

Other publications of authors with the same name

The capture time of a graph., , , and . Discret. Math., 309 (18): 5588-5595 (2009)Metric Dimension of Bounded Tree-length Graphs., , , and . SIAM J. Discret. Math., 31 (2): 1217-1243 (2017)Metric Dimension of Bounded Width Graphs., , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 115-126. Springer, (2015)Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves., , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 392-405. Springer, (2023)Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs., , , and . CSR, volume 13296 of Lecture Notes in Computer Science, page 152-169. Springer, (2022)Present-Biased Optimization., , and . AAAI, page 5415-5422. AAAI Press, (2021)Parameterized Complexity of Broadcasting in Graphs., , and . WG, volume 14093 of Lecture Notes in Computer Science, page 334-347. Springer, (2023)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)