2026

• Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2026). Line Cover and Related Problems. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Laure Ariane Morelle et al. (2026). H-Planarity and Parametric Extensions: when Modulators Act Globally. (ekstern lenke)
• Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2026). When Does FTP Become FPT?. (ekstern lenke)

2025

• Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2025). Tree Containment above Minimum Degree Is FPT. (ekstern lenke)
• Clément Dallard; Fedor Fomin; Petr Golovach et al. (2025). Computing Tree Decompositions with Small Independence Number. (ekstern lenke)
• Petr Golovach; Stavros G. Kolliopoulos; Giannos Stamoulis et al. (2025). Finding irrelevant vertices in linear time on bounded-genus graphs. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2025). Fixed-Parameter Tractability of Hedge Cut. (ekstern lenke)
• Aritra Banik; Fedor Fomin; Petr Golovach et al. (2025). Multivariate Exploration of Metric Dilation. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tanmay Nitin Inamdar et al. (2025). Parameterized Geometric Graph Modification with Disk Scaling. (ekstern lenke)
• Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2025). Fault-Tolerant Matroid Bases. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2025). Hybrid k-Clustering: Blending k-Median and k-Center. (ekstern lenke)
• Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2025). When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2025). Edge Clique Partition and Cover Beyond Independence. (ekstern lenke)
• Benjamin Bergougnoux; Nello Blaser; Michael Ralph Fellows et al. (2025). On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. (ekstern lenke)
• Matthias Bentert; Fedor Fomin; Petr Golovach et al. (2025). Packing Short Cycles. (ekstern lenke)
• Matthias Bentert; Petr Golovach; Tanmay Inamdar et al. (2025). Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. (ekstern lenke)
• Matthias Bentert; Fedor Fomin; Petr Golovach (2025). Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. (ekstern lenke)

2022

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

2017

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

2023

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

2020

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

2015

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

2021

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

2014

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

2024

• Fedor Fomin; Petr Golovach; Lars Jaffke et al. (2024). Diverse Pairs of Matchings. (ekstern lenke)
• Matthias Bentert; Pål Grønås Drange; Fedor Fomin et al. (2024). Two-Sets Cut-Uncut on Planar Graphs. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2024). Tree Containment Above Minimum Degree is FPT. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2024). Approximating Long Cycle Above Dirac’s Guarantee. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2024). Shortest Cycles with Monotone Submodular Costs. (ekstern lenke)
• Clement Dallard; Fedor Fomin; Petr Golovach et al. (2024). Computing Tree Decompositions with Small Independence Number. (ekstern lenke)
• Matthias Bentert; Michael Ralph Fellows; Petr Golovach et al. (2024). Breaking a Graph into Connected Components with Small Dominating Sets. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2024). Stability in Graphs with Matroid Constraints. (ekstern lenke)
• Aritra Banik; Fedor Fomin; Petr Golovach et al. (2024). Cuts in Graphs with Matroid Constraints. (ekstern lenke)
• Tatiana Belova; Yuriy Dementiev; Fedor Fomin et al. (2024). How to Guide a Present-Biased Agent Through Prescribed Tasks?. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2024). Hybrid k-Clustering: Blending k-Median and k-Center. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2024). (Re)packing Equal Disks into Rectangle. (ekstern lenke)
• Fedor Fomin; Pierre Fraigniaud; Petr Golovach (2024). Parameterized complexity of broadcasting in graphs. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Danil Sagunov et al. (2024). LONGEST CYCLE ABOVE ERDŐS–GALLAI BOUND. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tanmay Inamdar et al. (2024). FPT approximation and subexponential algorithms for covering few or many edges. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Tuukka Korhonen et al. (2024). Fixed-Parameter Tractability of Maximum Colored Path and beyond. (ekstern lenke)

2019

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

2016

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

2010

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

2011

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

2013

• Rajesh Chitnis; Fedor Fomin; Petr Golovach (2013). Preventing unraveling in social networks gets harder. (ekstern lenke)
• Rajesh Chitnis; Fedor Fomin; Petr Golovach (2013). Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. (ekstern lenke)
• Hajo Broersma; Fedor Fomin; Petr Golovach et al. (2013). Three complexity results on coloring Pk-free graphs. (ekstern lenke)
• Petr Golovach; Pim van 't Hof; Daniël Paulusma (2013). Obtaining planarity by contracting few edges. (ekstern lenke)
• Hajo Broersma; Petr Golovach; Viresh Patel (2013). Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. (ekstern lenke)
• Petr Golovach; Dieter Kratsch; Daniël Paulusma (2013). Detecting induced minors in AT-free graphs. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Pim van 't Hof et al. (2013). Choosability on H-free graphs. (ekstern lenke)
• Petr Golovach; Daniël Paulusma; Iain Stewart (2013). Graph Editing to a Fixed Target. (ekstern lenke)
• Fedor Fomin; Petr Golovach; Janne Korhonen (2013). On the Parameterized Complexity of Cutting a Few Vertices from a Graph. (ekstern lenke)
• Manfred Cochefert; Jean-francois Couturier; Petr Golovach et al. (2013). Sparse Square Roots. (ekstern lenke)
• Rémy Belmonte; Petr Golovach; Pim van 't Hof et al. (2013). Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. (ekstern lenke)
• Hajo Broersma; Jiri Fiala; Petr Golovach et al. (2013). Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. (ekstern lenke)
• Fedor Fomin; Petr Golovach (2013). Long Circuits and Large Euler Subgraphs. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Dieter Kratsch et al. (2013). Cliques and Clubs. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Dieter Kratsch et al. (2013). An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. (ekstern lenke)
• K. Dabrowski; Petr Golovach; Daniël Paulusma (2013). Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. (ekstern lenke)
• Petr Golovach; Daniël Paulusma (2013). List Coloring in the Absence of Two Subgraphs. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Pim van 't Hof et al. (2013). Modifying a Graph Using Vertex Elimination. (ekstern lenke)

2012

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

2007

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

2009

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

2018

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

2008

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

Se en fullstendig oversikt over publikasjoner i NVA.