Petr A. Golovach

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 224

Top Venues

CoRR

Algorithmica

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Math. Program. 204 (1) (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. SODA (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20 (1) (2024)
Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. SWAT (2024)
Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS (2024)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. 997 (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. CoRR (2024)
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
Cuts in Graphs with Matroid Constraints. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Hybrid k-Clustering: Blending k-Median and k-Center. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. 185 (2024)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. ICALP (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86 (8) (2024)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. Algorithmica 86 (6) (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-Sets Cut-Uncut on Planar Graphs. ICALP (2024)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. 293 (2023)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. 136 (2023)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-sets cut-uncut on planar graphs. CoRR (2023)
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48 (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. ICALP (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. WG (2023)
Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. CIAC (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms 19 (3) (2023)
Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA (2023)
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. CoRR (2023)
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT (2023)
Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
Kernelizing Temporal Exploration Problems. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing paths of large rank in planar frameworks deterministically. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR (2023)
Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
Kernelizing Temporal Exploration Problems. IPEC (2023)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized Complexity of Broadcasting in Graphs. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to find a good explanation for clustering? Artif. Intell. 322 (2023)
Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
Detours in directed graphs. J. Comput. Syst. Sci. 137 (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC (2023)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Compound Logics for Modification Problems. ICALP (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. CoRR (2023)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Parameterized Complexity of Broadcasting in Graphs. WG (2023)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Combing a Linkage in an Annulus. SIAM J. Discret. Math. 37 (4) (2023)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
Kernelization for Spreading Points. ESA (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67 (4) (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR (2022)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66 (4) (2022)
Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR (2022)
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR (2022)
Christophe Crespelle, Petr A. Golovach
Cyclability in graph classes. Discret. Appl. Math. 313 (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle Above Erdős-Gallai Bound. ESA (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. IPEC (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. CoRR (2022)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. 124 (2022)
Petr A. Golovach, Meirav Zehavi
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica 84 (11) (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2022)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory 14 (3-4) (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29 (2) (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? AAAI (2022)
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
Present-biased optimization. Math. Soc. Sci. 119 (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
Exact Exponential Algorithms for Clustering Problems. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle above Erdős-Gallai Bound. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
Exact Exponential Algorithms for Clustering Problems. IPEC (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Algorithmic Extensions of Dirac's Theorem. SODA (2022)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123 (2022)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. 23 (3) (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
Lossy Kernelization of Same-Size Clustering. CSR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi
(Re)packing Equal Disks into Rectangle. ICALP (2022)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. CoRR (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
-free graphs of bounded diameter. Theor. Comput. Sci. 930 (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. STACS (2022)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. STACS (2021)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR (2021)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG (2021)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS (2021)
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
A Compound Logic for Modification Problems: Big Kingdoms Fall from Within. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach
Kernelization of Whitney Switches. SIAM J. Discret. Math. 35 (2) (2021)
Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
-Clustering: Tractability island. J. Comput. Syst. Sci. 117 (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. ISAAC (2021)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13 (3) (2021)

Petr A. Golovach.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Petr A. Golovach