2024

• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2024). Approximating Long Cycle Above Dirac’s Guarantee. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Jaffke, Lars et al. (2024). Diverse Pairs of Matchings. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay et al. (2024). FPT approximation and subexponential algorithms for covering few or many edges. (ekstern lenke)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2024). Parameterized complexity of broadcasting in graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay et al. (2024). (Re)packing Equal Disks into Rectangle. (ekstern lenke)
• Bentert, Matthias; Drange, Pål Grønås; Fomin, Fedor et al. (2024). Two-Sets Cut-Uncut on Planar Graphs. (ekstern lenke)

2023

• Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre et al. (2023). Detours in directed graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2023). Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos et al. (2023). An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (2023). Parameterized complexity of categorical clustering with size constraints. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2023). Diverse collections in matroids and graphs. (ekstern lenke)
• Bentert, Matthias; Drange, Pål Grønås; Fomin, Fedor et al. (2023). Two-sets cut-uncut on planar graphs. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2023). Lossy Kernelization of Same-Size Clustering. (ekstern lenke)
• Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (2023). Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2023). Kernelization for Spreading Points. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka Matias Aleksanteri et al. (2023). Computing Paths of Large Rank in Planar Frameworks Deterministically. (ekstern lenke)
• Arrighi, Emmanuel Jean Paul Pierre; Fomin, Fedor; Golovach, Petr et al. (2023). Kernelizing Temporal Exploration Problems. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2023). FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. (ekstern lenke)
• Sam, Emmanuel; Bergougnoux, Benjamin; Golovach, Petr et al. (2023). Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2023). Parameterized Complexity of Feature Selection for Categorical Data Clustering. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka et al. (2023). Fixed-Parameter Tractability of Maximum Colored Path and Beyond. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka Matias Aleksanteri et al. (2023). Shortest Cycles With Monotone Submodular Costs. (ekstern lenke)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2023). Parameterized Complexity of Broadcasting in Graphs. (ekstern lenke)
• Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (2023). Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2023). Turán's Theorem Through Algorithmic Lens. (ekstern lenke)
• Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (2023). Combing a Linkage in an Annulus. (ekstern lenke)
• Sam, Emmanuel; Fellows, Michael Ralph; Rosamond, Frances et al. (2023). On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2023). Approximating Long Cycle Above Dirac's Guarantee. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Sau, Ignasi et al. (2023). Compound Logics for Modification Problems. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2023). How to find a good explanation for clustering?. (ekstern lenke)

2022

• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2022). (Re)packing Equal Disks into Rectangle. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre et al. (2022). Detours in Directed Graphs. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). How to Find a Good Explanation for Clustering?. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2022). Algorithmic Extensions of Dirac's Theorem. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2022). Exact Exponential Algorithms for Clustering Problems. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). FPT Approximation for Fair Minimum-Load Clustering. (ekstern lenke)
• Golovach, Petr; Lima, Paloma T.; Papadopoulos, Charis (2022). Graph Square Roots of Small Distance from Degree One Graphs. (ekstern lenke)
• Brause, Christoph; Golovach, Petr; Martin, Barnaby et al. (2022). Partitioning H-free graphs of bounded diameter. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). Lossy Kernelization of Same-Size Clustering. (ekstern lenke)
• Brause, Christoph; Golovach, Petr; Martin, Barnaby et al. (2022). Acyclic, star, and injective colouring: bounding the diameter^∗. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2022). Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2022). Parameterized Complexity of Elimination Distance to First-Order Logic Properties. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2022). Longest Cycle Above Erdös-Gallai Bound. (ekstern lenke)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2022). Present-biased optimization. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; van Leeuwen, Erik Jan (2022). Induced Disjoint Paths in AT-free graphs. (ekstern lenke)
• Crespelle, Christophe Dominique; Golovach, Petr (2022). Cyclability in graph classes. (ekstern lenke)

2021

• Golovach, Petr; Komusiewicz, Christian; Kratsch, Dieter et al. (2021). Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr (2021). Kernelization of Whitney Switches. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (2021). Parameterized Complexity of Categorical Clustering with Size Constraints. (ekstern lenke)
• Chaplick, Steven; Fomin, Fedor; Golovach, Petr et al. (2021). Kernelization of Graph Hamiltonicity: Proper H-Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2021). Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. (ekstern lenke)
• Brause, Christoph; Golovach, Petr; Martin, Barnaby et al. (2021). Acyclic, Star, and Injective Colouring: Bounding the Diameter. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2021). Diverse Collections in Matroids and Graphs. (ekstern lenke)
• Eiben, Eduard; Fomin, Fedor; Golovach, Petr et al. (2021). EPTAS for k-means Clustering of Affine Subspaces. (ekstern lenke)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2021). Parameterized Complexity of Feature Selection for Categorical Data Clustering. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr (2021). Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Simonov, Kirill (2021). Parameterized k-Clustering: Tractability island. (ekstern lenke)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2021). Present-Biased Optimization. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2021). Parameterized Complexity of Elimination Distance to First-Order Logic Properties. (ekstern lenke)
• Brause, Christoph; Golovach, Petr; Martin, Barnaby et al. (2021). Partitioning H-Free Graphs of Bounded Diameter. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2021). ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre et al. (2021). Parameterized Complexity of Directed Spanner Problems. (ekstern lenke)

2020

• Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (2020). On the Tractability of Optimization Problems on H-Graphs. (ekstern lenke)
• Chaplick, Steven; Golovach, Petr; Hartmann, Tim et al. (2020). Recognizing Proper Tree-Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lochet, William et al. (2020). Parameterized Complexity of Directed Spanner Problems. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Jaffke, Lars et al. (2020). Diverse Pairs of Matchings. (ekstern lenke)
• Golovach, Petr; Lima, Paloma T.; Papadopoulos, Charis (2020). Graph Square Roots of Small Distance from Degree One Graphs. (ekstern lenke)
• Golovach, Petr; Krithika, R.; Sahu, Abhishek et al. (2020). Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr (2020). Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2020). Going Far from Degeneracy. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2020). Low-Rank Binary Matrix Approximation in Column-Sum Norm. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr (2020). Kernelization of Whitney Switches. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos et al. (2020). An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Misra, Pranabendu et al. (2020). On the Complexity of Recovering Incidence Matrices. (ekstern lenke)
• Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios (2020). Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Lima, Paloma T. et al. (2020). Finding connected secluded subgraphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad (2020). Parameterized low-rank binary matrix approximation. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios L. et al. (2020). Parameterized Aspects of Strong Subgraph Closure. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Simonov, Kirill (2020). Parameterized complexity of PCA. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2020). Parameterization Above a Multiplicative Guarantee . (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Strømme, Torstein J. F. et al. (2020). Subgraph Complementation. (ekstern lenke)

2019

• Golovach, Petr; Kratsch, Dieter; Liedloff, Mathieu et al. (2019). Enumeration and maximum number of minimal dominating sets for chordal graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Spanning circuits in regular matroids. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2019). On the parameterized complexity of graph modification to first-order logic properties. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Going Far From Degeneracy. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Simonov, Kirill (2019). Parameterized k-Clustering: Tractability Island. (ekstern lenke)
• Crespelle, Christophe Dominique; Feghali, Carl; Golovach, Petr (2019). Cyclability in Graph Classes. (ekstern lenke)
• Golovach, Petr; Johnson, Matthew; Martin, Barnaby et al. (2019). Surjective H-colouring: New hardness results. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2019). Refined Complexity of PCA with Outliers. (ekstern lenke)
• Golovach, Petr; Thilikos, Dimitrios M. (2019). Clustering to Given Connectivities. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Approximation Schemes for Low-rank Binary Matrix Approximation Problems. (ekstern lenke)
• Chaplick, Steven; Fomin, Fedor; Golovach, Petr et al. (2019). Kernelization of graph hamiltonicity: Proper H-graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2019). Enumeration of Minimal Connected Dominating Sets for Chordal Graphs. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Liedloff, Mathieu et al. (2019). Enumeration and maximum number of maximal irredundant sets for chordal graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2019). Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2019). Editing to connected F-degree graph. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M (2019). Modification to planarity is fixed parameter tractable. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. (ekstern lenke)

2018

• Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (2018). On the tractability of optimization problems on H-graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Thomé de Lima, Paloma et al. (2018). Finding connected secluded subgraphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2018). Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha et al. (2018). Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. (ekstern lenke)
• Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket et al. (2018). Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Strømme, Torstein J. et al. (2018). Partial Complementation of Graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Konstantinidis, Athanasios et al. (2018). Parameterized Aspects of Strong Subgraph Closure. (ekstern lenke)
• Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr et al. (2018). Computing square roots of graphs with low maximum degree. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad (2018). Parameterized low-rank binary matrix approximation. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2018). Covering Vectors by Spaces: Regular Matroids. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2018). Structured connectivity augmentation. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (2018). Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. (ekstern lenke)

2017

• Golovach, Petr; Johnson, Matthew; Paulusma, Daniël et al. (2017). A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. (ekstern lenke)
• Golovach, Petr (2017). Editing to a connected graph of given degrees. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniel et al. (2017). A linear kernel for finding square roots of almost planar graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2017). Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha et al. (2017). Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Lindzey, Nathan et al. (2017). On recognition of threshold tolerance graphs and their complements. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; Stewart, Iain (2017). Graph editing to a fixed target. (ekstern lenke)
• Dabrowski, Konrad K.; Golovach, Petr; van 't Hof, Pim et al. (2017). Editing to a planar graph of given degrees. (ekstern lenke)
• Golovach, Petr; Mertzios, George B. (2017). Graph editing to a given degree sequence. (ekstern lenke)
• Belmonte, Remy; Fomin, Fedor; Golovach, Petr et al. (2017). Metric Dimension of Bounded Tree-length Graphs. (ekstern lenke)
• Golovach, Petr; Johnson, Matthew; Martin, Barnaby et al. (2017). Surjective H-colouring: New hardness results. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2017). Structured Connectivity Augmentation. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2017). Spanning Circuits in Regular Matroids. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou Moustapha et al. (2017). Minimal dominating sets in interval graphs and trees. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël et al. (2017). Finding Cactus Roots in Polynomial Time. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2017). Covering vectors by spaces: Regular matroids. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Liedloff, Mathieu et al. (2017). Enumeration and maximum number of maximal irredundant sets for chordal graphs. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Sayadi, Mohamed Yosri (2017). Enumeration of maximal irredundant sets for claw-free graphs. (ekstern lenke)
• Golovach, Petr; Kamiński,, Marcin; Maniatis, Spyridon et al. (2017). The parameterized complexity of graph cyclability. (ekstern lenke)

2016

• Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr et al. (2016). Parameterized algorithms for finding square roots. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël et al. (2016). Squares of low clique number. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; van Leeuwen, Erik Jan (2016). Induced disjoint paths in circular-arc graphs in linear time. (ekstern lenke)
• Bliznets, Ivan; Fomin, Fedor; Golovach, Petr et al. (2016). Parameterized Complexity of Superstring Problems. (ekstern lenke)
• Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr (2016). Parameterized complexity of the anchored k-core problem for directed graphs. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël et al. (2016). Finding cactus roots in polynomial time. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Karpov, Nikolay et al. (2016). Parameterized complexity of secluded connectivity problems. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël et al. (2016). A linear kernel for finding square roots of almost planar graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (2016). Enumerating minimal connected dominating sets in graphs of bounded chordality. (ekstern lenke)
• Dabrowski, Konrad K.; Golovach, Petr; van 't Hof, Pim et al. (2016). Editing to Eulerian graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2016). Editing to connected f-degree graph. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kanté, Mamadou M. et al. (2016). Enumerating minimal dominating sets in chordal bipartite graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (2016). Enumeration and maximum number of minimal connected vertex covers in graphs. (ekstern lenke)
• Golovach, Petr; Mertzios, George B. (2016). Graph editing to a given degree sequence. (ekstern lenke)
• Abramovskaya, Tatjana V.; Fomin, Fedor; Golovach, Petr et al. (2016). How to hunt an invisible rabbit on a graph. (ekstern lenke)

2015

• Golovach, Petr; Heggernes, Pinar; van' t Hof, Pim et al. (2015). Hadwiger number of graphs with small chordality. (ekstern lenke)
• Golovach, Petr; Golovach, Petr A; van'T Hof, Pim et al. (2015). Editing to a Connected Graph of Given Degrees. (ekstern lenke)
• Broersma, Hajo; Fiala, Jiří; Golovach, Petr et al. (2015). Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs665. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; van Leeuwen, Erik Jan (2015). Induced disjoint paths in claw-free graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Nederlof, Jesper et al. (2015). Minimizing Rosenthal potential in multicast games. (ekstern lenke)
• Dabrowski, Konrad K; Golovach, Petr; van'T Hof, Pim et al. (2015). Editing to a planar graph of given degrees. (ekstern lenke)
• Couturier, Jean-François; Golovach, Petr; Kratsch, Dieter et al. (2015). List coloring in the absence of a linear forest. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Karpov, Nikolay et al. (2015). Parameterized complexity of secluded connectivity problems. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (2015). Enumerating minimal connected dominating sets in graphs of bounded chordality. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim et al. (2015). Modifying a graph using vertex elimination. (ekstern lenke)
• Belmonte, Remy; Fomin, Fedor; Golovach, Petr et al. (2015). Metric dimension of bounded width graphs. (ekstern lenke)
• Bliznets, Ivan; Fomin, Fedor; Golovach, Petr et al. (2015). Parameterized complexity of superstring problems. (ekstern lenke)
• Golovach, Petr (2015). Editing to a Graph of Given Degrees. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim et al. (2015). Hadwiger number of graphs with small chordality. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; Ries, Bernard (2015). Coloring graphs characterized by a forbidden subgraph. (ekstern lenke)
• Golovach, Petr; Requile, Clement; Thilikos, Dimitrios M. (2015). Variants of plane diameter completion. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kante, Mamadou et al. (2015). Output-polynomial enumeration on graphs of bounded (local) linear mim-width. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2015). An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. (ekstern lenke)

2014

• Fomin, Fedor; Golovach, Petr (2014). Parameterized complexity of connected even/odd subgraph problems. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2014). Subset feedback vertex sets in chordal graphs. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniel (2014). List coloring in the absence of two subgraphs. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; Song, Jian (2014). Coloring graphs without short cycles and long induced paths. (ekstern lenke)
• Dabrowski, Konrad K.; Golovach, Petr; Paulusma, Daniël (2014). Colouring of graphs with Ramsey-type forbidden subgraphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2014). An incremental polynomial time Algorithm to enumerate all minimal edge dominating sets. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr (2014). Long circuits and large euler subgraphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2014). Finding clubs in graph classes. (ekstern lenke)
• Belmonte, Rémy; Golovach, Petr; Heggernes, Pinar et al. (2014). Detecting fixed patterns in chordal graphs in polynomial time. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2014). Almost optimal lower bounds for problems parameterized by clique-width. (ekstern lenke)
• Biro, Peter; Bomhoff, Matthijs; Golovach, Petr et al. (2014). Solutions for the stable roommates problem with payments. (ekstern lenke)
• Basavaraju, Manu; Fomin, Fedor; Golovach, Petr et al. (2014). Connecting vertices by independent trees. (ekstern lenke)
• Basavaraju, Manu; Fomin, Fedor; Golovach, Petr et al. (2014). Parameterized algorithms to preserve connectivity. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; van Leeuwen, Erik Jan (2014). Induced disjoint paths in circular-arc graphs in linear time. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Lindzey, Nathan et al. (2014). Recognizing Threshold Tolerance Graphs in O(n^2) Time. (ekstern lenke)
• Dabrowski, Konrad K.; Golovach, Petr; van 't Hof, Pim et al. (2014). Editing to Eulerian graphs. (ekstern lenke)
• Golovach, Petr (2014). Editing to a Graph of Given Degrees. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; Kaminski, Marcin et al. (2014). Lift-contractions. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniël; Song, Jian (2014). Closing complexity gaps for coloring problems on H-free graphs. (ekstern lenke)
• Golovach, Petr; Kaminski, Marcin; Maniatis, Spyridon et al. (2014). The parameterized complexity of graph cyclability. (ekstern lenke)
• Belmonte, Rémy; Golovach, Petr; van 't Hof, Pim et al. (2014). Parameterized complexity of three edge contraction problems with degree constraints. (ekstern lenke)
• dos Santos, Vinicius; Golovach, Petr; Heggernes, Pinar et al. (2014). On Recognition of Threshold Tolerance Graphs and their Complements. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2014). An exact algorithm for Subset Feedback Vertex Set on chordal graphs. (ekstern lenke)

2013

• Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr (2013). Preventing unraveling in social networks gets harder. (ekstern lenke)
• Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr (2013). Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim et al. (2013). Modifying a Graph Using Vertex Elimination. (ekstern lenke)
• Broersma, Hajo; Fomin, Fedor; Golovach, Petr et al. (2013). Three complexity results on coloring Pk-free graphs. (ekstern lenke)
• Golovach, Petr; van 't Hof, Pim; Paulusma, Daniël (2013). Obtaining planarity by contracting few edges. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim et al. (2013). Choosability on H-free graphs. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël (2013). Detecting induced minors in AT-free graphs. (ekstern lenke)
• Broersma, Hajo; Golovach, Petr; Patel, Viresh (2013). Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. (ekstern lenke)

2012

• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2012). An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Pralat, Pawel (2012). Cops and robber with constraints. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; van 't Hof, Pim et al. (2012). How to Eliminate a Graph. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Mihai, Rodica (2012). Edge search number of cographs. (ekstern lenke)
• Bodlaender, Hans L.; Fomin, Fedor; Golovach, Petr et al. (2012). Parameterized complexity of the spanning tree congestion problem. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel (2012). Cops and robber game without recharging. (ekstern lenke)
• Golovach, Petr; van 't Hof, Pim; Paulusma, Daniel (2012). Obtaining planarity by contracting few edges. (ekstern lenke)
• Fomin, Fedor; Gaspers, Serge; Golovach, Petr et al. (2012). k-Gap Interval Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Nederlof, Jesper et al. (2012). Minimizing Rosenthal potential in multicast games. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniel; Jian, Song (2012). Closing Complexity Gaps for Coloring Problems on H-Free Graphs. (ekstern lenke)
• Golovach, Petr; Paulusma, Daniel; Ries, Bernard (2012). Coloring Graphs Characterized by a Forbidden Subgraph. (ekstern lenke)
• Golovach, Petr; Kratsch, Dieter; Paulusma, Daniel (2012). Detecting Induced Minors in AT-Free Graphs. (ekstern lenke)

2011

• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2011). Bandwidth on AT-free graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan et al. (2011). Branch and Recharge: Exact Algorithms for Generalized Domination. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2011). Contraction obstructions for treewidth. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; van Leeuwen, Erik Jan (2011). Spanners of bounded degree graphs. (ekstern lenke)
• Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr (2011). Approximation of minimum weight spanners for sparse graphs. (ekstern lenke)
• Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr (2011). Spanners in sparse graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel (2011). Guard games on graphs: Keep the intruder out!. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Hall, Alex et al. (2011). How to Guard a Graph?. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2011). Approximating width parameters of hypergraphs with excluded minors. (ekstern lenke)

2010

• Fiala, Jiří; Golovach, Petr (2010). Complexity of the packing coloring problem for trees. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2010). Intractability of clique-width parameterizations. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan et al. (2010). Pursuing a fast robber on a graph. (ekstern lenke)

2009

• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan et al. (2009). Sort and Search: Exact algorithms for generalized domination. (ekstern lenke)
• Bonato, Anthony; Golovach, Petr; Hahn, Gena et al. (2009). The capture time of a graph. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios (2009). Approximating Acyclicity Parameters of Sparse Hypergraphs. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter et al. (2009). Bandwidth on AT-Free Graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios (2009). Contraction Bidimensionality: The Accurate Picture. (ekstern lenke)
• Golovach, Petr; Thilikos, Dimitrios M. (2009). Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. (ekstern lenke)
• Fiala, Jiří; Golovach, Petr; Kratochvil, Jan (2009). Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. (ekstern lenke)
• Golovach, Petr; Kratochvil, Jan; Suchy, Ondra (2009). Parameterized Complexity of Generalized Domination Problems. (ekstern lenke)
• Golovach, Petr; Kaminski, M.; Paulusma, Daniel et al. (2009). Induced Packing of Odd Cycles in a Planar Graph. (ekstern lenke)
• Golovach, Petr; Heggernes, Pinar (2009). Choosability of P5-free graphs. (ekstern lenke)
• Broersma, Hajo; Fomin, Fedor; Golovach, Petr et al. (2009). Three Complexity Results on Coloring Pk-Free Graphs. (ekstern lenke)

2008

• Dragan, Feodor; Fomin, Fedor; Golovach, Petr (2008). Spanners in sparse graphs. (ekstern lenke)
• Fiala, Jiri; Golovach, Petr (2008). Complexity of the packing coloring problem for trees. (ekstern lenke)
• Golovach, Petr; Villanger, Yngve (2008). Parameterized complexity for domination problems on degenerate graphs. (ekstern lenke)
• Fiala, Jiri; Golovach, Petr; Kratochvil, Jan (2008). Distance constrained labeling of trees. (ekstern lenke)
• Fiala, Jiri; Golovach, Petr; Kratochvil, Jan (2008). Computational complexity of the distance constrained labeling problem for trees. (ekstern lenke)
• Golovach, Petr; Kratochvil, Jan (2008). Generalized domination in degenerate graphs: a complete dichotomy of computational complexity. (ekstern lenke)
• Dragan, Feodor; Fomin, Fedor; Golovach, Petr (2008). A PTAS for the sparsest spanners problem on apex-minor-free graphs. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Hall, Alex et al. (2008). How to guard a graph?. (ekstern lenke)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan (2008). On tractability cops and robbers game. (ekstern lenke)

2007

• Broersma, Hajo; Fomin, Fedor; Golovach, Petr et al. (2007). Backbone colorings for graphs: Tree and path backbones. (ekstern lenke)
• Golovach, Petr; Fomin, Fedor; Kratochvil, Jan et al. (2007). Branch and Recharge: Exact Algorithms for Generalized Domination. (ekstern lenke)
• Golovach, Petr; Kratochvil, Jan (2007). Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. (ekstern lenke)

Se en full oversikt over publikasjoner i Cristin