pith. sign in

Petr A. Golovach

Identifiers

  • name variant Petr A. Golovach 0.60 · backfill

Papers (49)

  1. Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study cs.DS · 2026 · author #3
  2. Polynomial Kernels for Spanning Tree with Diversity Requirements cs.DS · 2026 · author #1
  3. Identification to Subclasses of Chordal Graphs cs.DS · 2026 · author #1
  4. Finding irrelevant vertices in linear time on bounded-genus graphs cs.DS · 2019 · author #1
  5. Refined Complexity of PCA with Outliers cs.DS · 2019 · author #2
  6. Low-rank binary matrix approximation in column-sum norm cs.DS · 2019 · author #2
  7. Parameterized k-Clustering: The distance matters! cs.DS · 2019 · author #2
  8. Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals cs.DS · 2019 · author #2
  9. Going Far From Degeneracy cs.DS · 2019 · author #2
  10. Approximation Schemes for Low-Rank Binary Matrix Approximation Problems cs.DS · 2018 · author #2
  11. On the Parameterized Complexity of Graph Modification to First-Order Logic Properties cs.DS · 2018 · author #2
  12. Clustering to Given Connectivities cs.DS · 2018 · author #1
  13. Parameterized Low-Rank Binary Matrix Approximation cs.DS · 2018 · author #2
  14. Parameterized Aspects of Strong Subgraph Closure cs.DS · 2018 · author #1
  15. Finding Connected Secluded Subgraphs cs.DS · 2017 · author #1
  16. Covering vectors by spaces: Regular matroids cs.DS · 2017 · author #2
  17. Structured Connectivity Augmentation cs.DS · 2017 · author #2
  18. Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 cs.DS · 2017 · author #1
  19. Squares of Low Maximum Degree cs.DS · 2016 · author #3
  20. A Linear Kernel for Finding Square Roots of Almost Planar Graphs cs.DS · 2016 · author #1
  21. Spanning Circuits in Regular Matroids cs.DS · 2016 · author #2
  22. Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs cs.DS · 2016 · author #1
  23. Metric Dimension of Bounded Tree-length Graphs cs.DS · 2016 · author #3
  24. Graph Editing to a Given Degree Sequence cs.DS · 2016 · author #1
  25. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width cs.DS · 2015 · author #1
  26. Variants of Plane Diameter Completion cs.DS · 2015 · author #1
  27. Editing to a Planar Graph of Given Degrees cs.DS · 2015 · author #2
  28. How to Hunt an Invisible Rabbit on a Graph math.CO · 2015 · author #3
  29. Parameterized Complexity of Secluded Connectivity Problems cs.DS · 2015 · author #2
  30. Parameterized Complexity of Superstring Problems cs.DS · 2015 · author #3
  31. The Parameterized Complexity of Graph Cyclability math.CO · 2014 · author #1
  32. Editing to Eulerian Graphs cs.DM · 2014 · author #2
  33. A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs cs.CC · 2014 · author #1
  34. Hadwiger number of graphs with small chordality cs.DS · 2014 · author #1
  35. Induced Disjoint Paths in Circular-Arc Graphs in Linear Time cs.DS · 2014 · author #1
  36. Editing to a Graph of Given Degrees cs.DS · 2013 · author #1
  37. Parameterized Algorithms for Finding Square Roots cs.DS · 2013 · author #3
  38. Minimizing Rosenthal Potential in Multicast Games cs.GT · 2013 · author #2
  39. Editing to a Connected Graph of Given Degrees cs.DS · 2013 · author #1
  40. Preventing Unraveling in Social Networks Gets Harder cs.SI · 2013 · author #3
  41. On the parameterized complexity of cutting a few vertices from a graph cs.DS · 2013 · author #2
  42. Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs cs.DS · 2013 · author #3
  43. Long Circuits and Large Euler Subgraphs cs.DS · 2013 · author #2
  44. Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs cs.DS · 2013 · author #3
  45. Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay cs.DS · 2012 · author #1
  46. Obtaining Planarity by Contracting Few Edges cs.DS · 2012 · author #1
  47. Finding vertex-surjective graph homomorphisms cs.DM · 2012 · author #1
  48. Induced Disjoint Paths in Claw-Free Graphs cs.DM · 2012 · author #1
  49. Approximating acyclicity parameters of sparse hypergraphs cs.DS · 2008 · author #2

Mentions

  • 1208.5345 #1 · backfill · confidence 0.70 Petr A. Golovach
  • 1204.5113 #1 · backfill · confidence 0.70 Petr A. Golovach
  • 1204.2124 #1 · backfill · confidence 0.70 Petr A. Golovach
  • 1202.4419 #1 · backfill · confidence 0.70 Petr A. Golovach
  • 0809.3646 #2 · backfill · confidence 0.70 Petr A. Golovach

Frequent Coauthors