Petr A. Golovach
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
150
Venues
25
Active years
1998–2026
Best venue rank
A*
Where they publish
- BWG26 papers
- AESA16 papers
- A*SODA16 papers
- A*ICALP15 papers
- BMFCS13 papers
- BISAAC12 papers
- ASTACS10 papers
- NationalCSR6 papers
- A*AAAI4 papers
- CCIAC4 papers
- CIWOCA4 papers
- CTAMC4 papers
- BWADS3 papers
- BLATIN3 papers
- A*STOC2 papers
- BFCT2 papers
- BWAOA2 papers
- A*PODC1 paper
- AECAI1 paper
- AGD1 paper
- A*LICS1 paper
- A*ICML1 paper
- CCiE1 paper
- BCPM1 paper
- BSOFSEM1 paper
Papers
150 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Discounted Cuts: A Stackelberg Approach to Network Disruption. | Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov |
| 2026 | ESA | An FPT Algorithm for Diverse Minimum s-t Cuts. | Krishnan Dehaleesan, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2026 | ICALP | Clustering Permutations Under the Ulam Metric: A Parameterized Complexity Study. | Tian Bai, Fedor V. Fomin, Petr A. Golovach, Yash Hiren More, Simon Wietheger |
| 2026 | SODA | Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2026 | SODA | ℋ-Planarity and Parametric Extensions: when Modulators Act Globally. | Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos |
| 2026 | STOC | What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing. | Llia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2026 | STOC | Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective. | Fedor V. Fomin, Petr A. Golovach, Nikola Jedlickov, Jan Kratochvl, Danil Sagunov, Kirill Simonov |
| 2026 | STACS | Line Cover and Related Problems. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana |
| 2026 | WG | Polynomial Kernels for Spanning Tree with Diversity Requirements. | Petr A. Golovach, Diptapriyo Majumdar, Saket Saurabh |
| 2025 | ESA | Fault-Tolerant Matroid Bases. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2025 | ESA | Edge Clique Partition and Cover Beyond Independence. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2025 | PODC | Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | SODA | Fixed-Parameter Tractability of Hedge Cut. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh |
| 2025 | SODA | Finding irrelevant vertices in linear time on bounded-genus graphs. | Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2025 | STACS | Multivariate Exploration of Metric Dilation. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2025 | STACS | Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach |
| 2025 | WG | When Does FTP Become FPT? | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2024 | ECAI | How to Guide a Present-Biased Agent Through Prescribed Tasks? | Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev |
| 2024 | ESA | Cuts in Graphs with Matroid Constraints. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2024 | ICALP | Two-Sets Cut-Uncut on Planar Graphs. | Matthias Bentert, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen |
| 2024 | ICALP | Computing Tree Decompositions with Small Independence Number. | Clment Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic |
| 2024 | MFCS | Breaking a Graph into Connected Components with Small Dominating Sets. | Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh |
| 2024 | SODA | Tree Containment Above Minimum Degree is FPT. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | CIAC | On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. | Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach |
| 2023 | ESA | Kernelization for Spreading Points. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2023 | FCT | Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. | Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser |
| 2023 | GD | Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. | Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper |
| 2023 | ICALP | Approximating Long Cycle Above Dirac's Guarantee. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | ICALP | Compound Logics for Modification Problems. | Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | ISAAC | Computing Paths of Large Rank in Planar Frameworks Deterministically. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
| 2023 | MFCS | FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana |
| 2023 | SODA | Shortest Cycles With Monotone Submodular Costs. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
| 2023 | SODA | Fixed-Parameter Tractability of Maximum Colored Path and Beyond. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis |
| 2023 | SODA | Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | WG | Parameterized Complexity of Broadcasting in Graphs. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2023 | WG | Turn's Theorem Through Algorithmic Lens. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | AAAI | How to Find a Good Explanation for Clustering? | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov |
| 2022 | CSR | Lossy Kernelization of Same-Size Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov |
| 2022 | CSR | Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. | Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh |
| 2022 | ESA | Longest Cycle Above Erdős-Gallai Bound. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | ICALP | (Re)packing Equal Disks into Rectangle. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi |
| 2022 | MFCS | Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | SODA | Algorithmic Extensions of Dirac's Theorem. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | STACS | Detours in Directed Graphs. | Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh |
| 2021 | AAAI | Present-Biased Optimization. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2021 | ISAAC | Partitioning H-Free Graphs of Bounded Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | LICS | Parameterized Complexity of Elimination Distance to First-Order Logic Properties. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2021 | MFCS | Parameterized Complexity of Feature Selection for Categorical Data Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
| 2021 | SODA | EPTAS for | Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2021 | STACS | Diverse Collections in Matroids and Graphs. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | STACS | Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
| 2021 | WADS | Parameterized Complexity of Categorical Clustering with Size Constraints. | Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit |
| 2021 | WG | Acyclic, Star, and Injective Colouring: Bounding the Diameter. | Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith |
| 2021 | WG | Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2020 | ESA | Kernelization of Whitney Switches. | Fedor V. Fomin, Petr A. Golovach |
| 2020 | ESA | Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. | Fedor V. Fomin, Petr A. Golovach |
| 2020 | ESA | On the Complexity of Recovering Incidence Matrices. | Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan |
| 2020 | ESA | An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. | Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | ISAAC | Diverse Pairs of Matchings. | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
| 2020 | LATIN | Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. | Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2020 | LATIN | Graph Square Roots of Small Distance from Degree One Graphs. | Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos |
| 2020 | SODA | Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2019 | ESA | Going Far From Degeneracy. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICML | Refined Complexity of PCA with Outliers. | Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2019 | ISAAC | Cyclability in Graph Classes. | Christophe Crespelle, Carl Feghali, Petr A. Golovach |
| 2019 | STACS | Modification to Planarity is Fixed Parameter Tractable. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2019 | WADS | Kernelization of Graph Hamiltonicity: Proper H-Graphs. | Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman |
| 2018 | ESA | On the Tractability of Optimization Problems on H-Graphs. | Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond |
| 2018 | ICALP | Parameterized Low-Rank Binary Matrix Approximation. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2018 | SODA | Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. | Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2017 | CIAC | Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. | Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi |
| 2017 | CiE | Surjective H-Colouring: New Hardness Results. | Petr A. Golovach, Matthew Johnson, Barnaby Martin, Danil Paulusma, Anthony Stewart |
| 2017 | ICALP | Covering Vectors by Spaces: Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | MFCS | Structured Connectivity Augmentation. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2017 | SODA | Spanning Circuits in Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | WG | Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Danil Paulusma |
| 2017 | WG | Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. | Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi |
| 2016 | CSR | Graph Editing to a Given Degree Sequence. | Petr A. Golovach, George B. Mertzios |
| 2016 | IWOCA | Finding Cactus Roots in Polynomial Time. | Petr A. Golovach, Dieter Kratsch, Danil Paulusma, Anthony Stewart |
| 2016 | STACS | Editing to Connected f-Degree Graph. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh |
| 2015 | CPM | Parameterized Complexity of Superstring Problems. | Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh |
| 2015 | CSR | Editing to a Planar Graph of Given Degrees. | Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Danil Paulusma, Dimitrios M. Thilikos |
| 2015 | ISAAC | Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. | Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kant, Dieter Kratsch, Sigve Hortemo Sther, Yngve Villanger |
| 2015 | IWOCA | Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch |
| 2015 | MFCS | Metric Dimension of Bounded Width Graphs. | Rmy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan |
| 2014 | ESA | The Parameterized Complexity of Graph Cyclability. | Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos |
| 2014 | ICALP | Parameterized Algorithms to Preserve Connectivity. | Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | MFCS | Editing to a Connected Graph of Given Degrees. | Petr A. Golovach |
| 2014 | WG | Hadwiger Number of Graphs with Small Chordality. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul |
| 2014 | WG | Recognizing Threshold Tolerance Graphs in O(n | Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vincius Fernandes dos Santos, Jeremy P. Spinrad |
| 2014 | WG | Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2013 | AAAI | Preventing Unraveling in Social Networks Gets Harder. | Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach |
| 2013 | CIAC | Cliques and Clubs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey |
| 2013 | CIAC | List Coloring in the Absence of Two Subgraphs. | Petr A. Golovach, Danil Paulusma |
| 2013 | ESA | Long Circuits and Large Euler Subgraphs. | Fedor V. Fomin, Petr A. Golovach |
| 2013 | ICALP | An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger |
| 2013 | IWOCA | Graph Editing to a Fixed Target. | Petr A. Golovach, Danil Paulusma, Iain A. Stewart |
| 2013 | MFCS | On the Parameterized Complexity of Cutting a Few Vertices from a Graph. | Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen |
| 2013 | WG | Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. | Hajo Broersma, Jir Fiala, Petr A. Golovach, Toms Kaiser, Danil Paulusma, Andrzej Proskurowski |
| 2013 | WG | Sparse Square Roots. | Manfred Cochefert, Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2013 | WG | Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. | Konrad K. Dabrowski, Petr A. Golovach, Danil Paulusma |
| 2012 | CSR | Finding Vertex-Surjective Graph Homomorphisms. | Petr A. Golovach, Bernard Lidick, Barnaby Martin, Danil Paulusma |
| 2012 | ESA | Induced Disjoint Paths in Claw-Free Graphs. | Petr A. Golovach, Danil Paulusma, Erik Jan van Leeuwen |
| 2012 | ICALP | Minimizing Rosenthal Potential in Multicast Games. | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk |
| 2012 | ISAAC | Detecting Induced Minors in AT-Free Graphs. | Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2012 | ISAAC | Closing Complexity Gaps for Coloring Problems on H-Free Graphs. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2012 | LATIN | k-Gap Interval Graphs. | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
| 2012 | MFCS | Obtaining Planarity by Contracting Few Edges. | Petr A. Golovach, Pim van 't Hof, Danil Paulusma |
| 2012 | MFCS | Coloring Graphs Characterized by a Forbidden Subgraph. | Petr A. Golovach, Danil Paulusma, Bernard Ries |
| 2012 | STACS | Parameterized Complexity of Connected Even/Odd Subgraph Problems. | Fedor V. Fomin, Petr A. Golovach |
| 2012 | SOFSEM | 4-Coloring H-Free Graphs When H Is Small. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2012 | WG | Solutions for the Stable Roommates Problem with Payments. | Pter Bir, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Danil Paulusma |
| 2012 | WG | How to Eliminate a Graph. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Danil Paulusma, Michal Pilipczuk |
| 2011 | CSR | Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2011 | FCT | Coloring Graphs without Short Cycles and Long Induced Paths. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2011 | ISAAC | Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. | Rmy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2011 | MFCS | Contracting a Chordal Graph to a Split Graph or a Tree. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma |
| 2011 | WG | List Coloring in the Absence of a Linear Forest. | Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2010 | ISAAC | On Coloring Graphs without Induced Forests. | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2010 | SODA | Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2010 | TAMC | Untitled record | Petr A. Golovach, Bernard Lidick, Danil Paulusma |
| 2010 | WAOA | Approximation Algorithms for Domination Search. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2010 | WG | Narrowing Down the Gap on the Complexity of Coloring | Hajo Broersma, Petr A. Golovach, Danil Paulusma, Jian Song |
| 2010 | WG | Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. | Petr A. Golovach, Dieter Kratsch, Jean-Franois Couturier |
| 2009 | ESA | Contraction Bidimensionality: The Accurate Picture. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | ISAAC | Bandwidth on AT-Free Graphs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
| 2009 | ISAAC | Induced Packing of Odd Cycles in a Planar Graph. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | IWOCA | Three Complexity Results on Coloring | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Danil Paulusma |
| 2009 | MFCS | Choosability of P5-Free Graphs. | Petr A. Golovach, Pinar Heggernes |
| 2009 | SODA | Clique-width: on the price of generality. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2009 | STACS | Approximating Acyclicity Parameters of Sparse Hypergraphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | TAMC | Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2009 | WAOA | Guard Games on Graphs: Keep the Intruder Out! | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
| 2009 | WG | Parameterized Complexity of Generalized Domination Problems. | Petr A. Golovach, Jan Kratochvl, Ondrej Such |
| 2008 | ICALP | Spanners in Sparse Graphs. | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
| 2008 | ICALP | Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | ISAAC | How to Guard a Graph?. | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Mats Mihalk, Elias Vicari, Peter Widmayer |
| 2008 | MFCS | A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
| 2008 | TAMC | Distance Constrained Labelings of Trees. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2008 | TAMC | Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. | Petr A. Golovach, Jan Kratochvl |
| 2008 | WG | Complexity of the Packing Coloring Problem for Trees. | Jir Fiala, Petr A. Golovach |
| 2008 | WG | Parameterized Complexity for Domination Problems on Degenerate Graphs. | Petr A. Golovach, Yngve Villanger |
| 2007 | WADS | Branch and Recharge: Exact Algorithms for Generalized Domination. | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvl, Dieter Kratsch, Mathieu Liedloff |
| 2007 | WG | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. | Petr A. Golovach, Jan Kratochvl |
| 2005 | ICALP | Distance Constrained Labelings of Graphs of Bounded Treewidth. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2004 | WG | Elegant Distance Constrained Labelings of Trees. | Jir Fiala, Petr A. Golovach, Jan Kratochvl |
| 2003 | WG | Backbone Colorings for Networks. | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
| 1998 | WG | Interval Completion with the Smallest Max-degree. | Fedor V. Fomin, Petr A. Golovach |