Petr A. Golovach

445 papers A* 33A 29B 74C 14Misc 6Journal 263Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality. CoRR Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2026	J	`jnl`	Computing Tree Decompositions with Small Independence Number. ACM Trans. Algorithms Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
2026	A*	`conf`	Discounted Cuts: A Stackelberg Approach to Network Disruption. AAAI Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2026	A	`conf`	Line Cover and Related Problems. STACS Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana
2026	J	`jnl`	Packing Short Cycles. ACM Trans. Algorithms Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2026	J	`jnl`	Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. Theory Comput. Syst. Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
2026	A*	`conf`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. SODA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	Tree Containment above Minimum Degree Is FPT. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2026	A*	`conf`	ℋ-Planarity and Parametric Extensions: when Modulators Act Globally. SODA Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos
2025	A*	`conf`	Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. PODC Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2025	J	`jnl`	Compound Logics for Modification Problems. ACM Trans. Comput. Log. Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2025	J	`jnl`	Computing Paths of Large Rank in Planar Frameworks Deterministically. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
2025	J	`jnl`	Discounted Cuts: A Stackelberg Approach to Network Disruption. CoRR Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2025	A	`conf`	Edge Clique Partition and Cover Beyond Independence. ESA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025	J	`jnl`	Edge Clique Partition and Cover Beyond Independence. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025	A	`conf`	Fault-Tolerant Matroid Bases. ESA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2025	J	`jnl`	Fault-Tolerant Matroid Bases. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2025	A*	`conf`	Finding irrelevant vertices in linear time on bounded-genus graphs. SODA Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos
2025	A*	`conf`	Fixed-Parameter Tractability of Hedge Cut. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
2025	J	`jnl`	H-Planarity and Parametric Extensions: when Modulators Act Globally. CoRR Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos
2025	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	J	`jnl`	Line Cover and Related Problems. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana
2025	A	`conf`	Multivariate Exploration of Metric Dilation. STACS Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	Multivariate Exploration of Metric Dilation. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. J. Comput. Syst. Sci. Benjamin Bergougnoux, Nello Blaser, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Emmanuel Sam
2025	A*	`conf`	Packing Short Cycles. SODA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	A	`conf`	Parameterized Geometric Graph Modification with Disk Scaling. ITCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	A	`conf`	Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. STACS Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
2025	J	`jnl`	Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2025	A*	`conf`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. SoCG Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2025	J	`jnl`	When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan, Saket Saurabh
2025	B	`conf`	When Does FTP Become FPT? WG Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2025	J	`jnl`	When does FTP become FPT? CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle
2024	J	`jnl`	(Re)packing Equal Disks into Rectangle. Discret. Comput. Geom. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Approximating Long Cycle Above Dirac's Guarantee. Algorithmica Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	B	`conf`	Breaking a Graph into Connected Components with Small Dominating Sets. MFCS Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
2024	A*	`conf`	Computing Tree Decompositions with Small Independence Number. ICALP Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
2024	A	`conf`	Cuts in Graphs with Matroid Constraints. ESA Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	J	`jnl`	Cuts in Graphs with Matroid Constraints. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	J	`jnl`	Distributed Model Checking in Graphs Classes of Bounded Expansion. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	J	`jnl`	Diverse Pairs of Matchings. Algorithmica Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
2024	J	`jnl`	Diverse collections in matroids and graphs. Math. Program. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2024	J	`jnl`	FPT approximation and subexponential algorithms for covering few or many edges. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2024	J	`jnl`	Fixed-Parameter Tractability of Hedge Cut. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
2024	J	`jnl`	Fixed-Parameter Tractability of Maximum Colored Path and Beyond. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2024	J	`jnl`	Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	A	`conf`	How to Guide a Present-Biased Agent Through Prescribed Tasks? ECAI Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev
2024	J	`jnl`	How to guide a present-biased agent through prescribed tasks? CoRR Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev
2024	A	`conf`	Hybrid k-Clustering: Blending k-Median and k-Center. APPROX/RANDOM Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Hybrid k-Clustering: Blending k-Median and k-Center. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Longest Cycle above Erdős-Gallai Bound. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	J	`jnl`	Packing Short Cycles. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024	J	`jnl`	Parameterized Geometric Graph Modification with Disk Scaling. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2024	J	`jnl`	Parameterized complexity of broadcasting in graphs. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2024	J	`jnl`	Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2024	—	`conf`	Stability in Graphs with Matroid Constraints. SWAT Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
2024	J	`jnl`	Stability in Graphs with Matroid Constraints. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
2024	J	`jnl`	Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach
2024	A*	`conf`	Tree Containment Above Minimum Degree is FPT. SODA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	A*	`conf`	Two-Sets Cut-Uncut on Planar Graphs. ICALP Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2023	J	`jnl`	A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
2023	A*	`conf`	Approximating Long Cycle Above Dirac's Guarantee. ICALP Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Approximating Long Cycle Above Dirac's Guarantee. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Inf. Comput. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2023	J	`jnl`	Combing a Linkage in an Annulus. SIAM J. Discret. Math. Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023	A*	`conf`	Compound Logics for Modification Problems. ICALP Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2023	B	`conf`	Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
2023	J	`jnl`	Computing paths of large rank in planar frameworks deterministically. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
2023	J	`jnl`	Detours in directed graphs. J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
2023	B	`conf`	FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2023	J	`jnl`	FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana
2023	A*	`conf`	Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2023	J	`jnl`	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. ACM Trans. Algorithms Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023	J	`jnl`	How to find a good explanation for clustering? Artif. Intell. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2023	B	`conf`	Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
2023	J	`jnl`	Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. CoRR Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser
2023	A	`conf`	Kernelization for Spreading Points. ESA Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Kernelization for Spreading Points. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2023	B	`conf`	Kernelizing Temporal Exploration Problems. IPEC Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
2023	J	`jnl`	Kernelizing Temporal Exploration Problems. CoRR Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf
2023	J	`jnl`	Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2023	A*	`conf`	Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. SODA Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2023	C	`conf`	On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. CIAC Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach
2023	B	`conf`	Parameterized Complexity of Broadcasting in Graphs. WG Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2023	J	`jnl`	Parameterized Complexity of Broadcasting in Graphs. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2023	J	`jnl`	Parameterized Complexity of Feature Selection for Categorical Data Clustering. ACM Trans. Comput. Theory Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2023	—	`conf`	Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
2023	J	`jnl`	Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. CoRR Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper
2023	J	`jnl`	Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
2023	A*	`conf`	Shortest Cycles With Monotone Submodular Costs. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2023	J	`jnl`	Tree Containment Above Minimum Degree is FPT. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	B	`conf`	Turán's Theorem Through Algorithmic Lens. WG Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Turán's Theorem Through Algorithmic Lens. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Two-sets cut-uncut on planar graphs. CoRR Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
2022	A*	`conf`	(Re)packing Equal Disks into Rectangle. ICALP Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi
2022	J	`jnl`	(Re)packing Equal Disks into Rectangle. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2022	A*	`conf`	Algorithmic Extensions of Dirac's Theorem. SODA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	J	`jnl`	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	Computing Tree Decompositions with Small Independence Number. CoRR Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
2022	J	`jnl`	Cyclability in graph classes. Discret. Appl. Math. Christophe Crespelle, Petr A. Golovach
2022	A	`conf`	Detours in Directed Graphs. STACS Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	J	`jnl`	Detours in Directed Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	B	`conf`	Exact Exponential Algorithms for Clustering Problems. IPEC Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022	J	`jnl`	Exact Exponential Algorithms for Clustering Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022	B	`conf`	FPT Approximation for Fair Minimum-Load Clustering. IPEC Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022	J	`jnl`	Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
2022	J	`jnl`	Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2022	A*	`conf`	How to Find a Good Explanation for Clustering? AAAI Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2022	J	`jnl`	Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2022	B	`conf`	Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	A	`conf`	Longest Cycle Above Erdős-Gallai Bound. ESA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	J	`jnl`	Longest Cycle above Erdős-Gallai Bound. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	Misc	`conf`	Lossy Kernelization of Same-Size Clustering. CSR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022	J	`jnl`	Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. CoRR Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2022	J	`jnl`	Parameterized Complexity of Directed Spanner Problems. Algorithmica Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
2022	J	`jnl`	Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Trans. Comput. Log. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2022	Misc	`conf`	Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
2022	J	`jnl`	Partitioning Theor. Comput. Sci. Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Present-biased optimization. Math. Soc. Sci. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2022	J	`jnl`	Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2022	J	`jnl`	Shortest Cycles With Monotone Submodular Costs. CoRR Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2022	J	`jnl`	Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Algorithmica Petr A. Golovach, Meirav Zehavi
2021	B	`ed.`	16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Lisbon, Portugal, September 8-10, 2021 IPEC Petr A. Golovach, Meirav Zehavi
2021	B	`conf`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. CoRR Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	B	`conf`	Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	J	`jnl`	Compound Logics for Modification Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
2021	A	`conf`	Diverse Collections in Matroids and Graphs. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	J	`jnl`	Diverse Collections in Matroids and Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	A*	`conf`	EPTAS for SODA Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2021	—	`conf`	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
2021	J	`jnl`	ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. CoRR Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh
2021	J	`jnl`	FPT Approximation for Fair Minimum-Load Clustering. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021	J	`jnl`	How to Find a Good Explanation for Clustering? CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2021	J	`jnl`	Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
2021	J	`jnl`	Kernelization of Whitney Switches. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach
2021	J	`jnl`	Lossy Kernelization of Same-Size Clustering. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021	J	`jnl`	Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Parameterized J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021	B	`conf`	Parameterized Complexity of Categorical Clustering with Size Constraints. WADS Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
2021	J	`jnl`	Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
2021	A*	`conf`	Parameterized Complexity of Elimination Distance to First-Order Logic Properties. LICS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	J	`jnl`	Parameterized Complexity of Elimination Distance to First-Order Logic Properties. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2021	B	`conf`	Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021	J	`jnl`	Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021	B	`conf`	Partitioning H-Free Graphs of Bounded Diameter. ISAAC Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	J	`jnl`	Partitioning H-Free Graphs of Bounded Diameter. CoRR Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021	A*	`conf`	Present-Biased Optimization. AAAI Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2021	A	`conf`	Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021	J	`jnl`	Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le
2021	J	`jnl`	Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. Algorithmica Fedor V. Fomin, Petr A. Golovach
2020	J	`jnl`	A survey of parameterized algorithms and the complexity of edge modification. CoRR Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach
2020	J	`jnl`	Algorithmic Extensions of Dirac's Theorem. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2020	A	`conf`	An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. ESA Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020	J	`jnl`	Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	B	`conf`	Diverse Pairs of Matchings. ISAAC Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
2020	J	`jnl`	Diverse Pairs of Matchings. CoRR Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
2020	J	`jnl`	EPTAS for k-means Clustering of Affine Subspaces. CoRR Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2020	J	`jnl`	Enumeration of minimal connected dominating sets for chordal graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2020	J	`jnl`	Finding connected secluded subgraphs. J. Comput. Syst. Sci. Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
2020	J	`jnl`	Going Far from Degeneracy. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. LATIN Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Graph Square Roots of Small Distance from Degree One Graphs. LATIN Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2020	J	`jnl`	Graph Square Roots of Small Distance from Degree One Graphs. CoRR Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2020	A*	`conf`	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. SODA Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2020	J	`jnl`	Induced Disjoint Paths in AT-free Graphs. CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2020	A	`conf`	Kernelization of Whitney Switches. ESA Fedor V. Fomin, Petr A. Golovach
2020	J	`jnl`	Kernelization of Whitney Switches. CoRR Fedor V. Fomin, Petr A. Golovach
2020	—	`conf`	Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2020	A	`conf`	On the Complexity of Recovering Incidence Matrices. ESA Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan
2020	J	`jnl`	On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2020	J	`jnl`	On the Tractability of Optimization Problems on H-Graphs. Algorithmica Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2020	A	`conf`	Parameterization Above a Multiplicative Guarantee. ITCS Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Parameterized Aspects of Strong Subgraph Closure. Algorithmica Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2020	B	`conf`	Parameterized Complexity of Directed Spanner Problems. IPEC Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
2020	—	`conf`	Parameterized Complexity of PCA (Invited Talk). SWAT Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2020	J	`jnl`	Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2020	J	`jnl`	Present-Biased Optimization. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2020	B	`conf`	Recognizing Proper Tree-Graphs. IPEC Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
2020	J	`jnl`	Recognizing Proper Tree-Graphs. CoRR Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop
2020	A	`conf`	Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. ESA Fedor V. Fomin, Petr A. Golovach
2020	J	`jnl`	Subexponential parameterized algorithms and kernelization on almost chordal graphs. CoRR Fedor V. Fomin, Petr A. Golovach
2020	J	`jnl`	Subgraph Complementation. Algorithmica Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
2019	J	`jnl`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2019	J	`jnl`	Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Clustering to Given Connectivities. IPEC Petr A. Golovach, Dimitrios M. Thilikos
2019	A*	`conf`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Cyclability in Graph Classes. ISAAC Christophe Crespelle, Carl Feghali, Petr A. Golovach
2019	J	`jnl`	Editing to Connected F-Degree Graph. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Enumeration and maximum number of maximal irredundant sets for chordal graphs. Discret. Appl. Math. Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2019	J	`jnl`	Enumeration and maximum number of minimal dominating sets for chordal graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2019	J	`jnl`	Enumeration of maximal irredundant sets for claw-free graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi
2019	A	`conf`	Going Far From Degeneracy. ESA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Going Far From Degeneracy. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
2019	B	`conf`	Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman
2019	J	`jnl`	Low-rank binary matrix approximation in column-sum norm. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2019	A	`conf`	Modification to Planarity is Fixed Parameter Tractable. STACS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2019	J	`jnl`	Parameterized k-Clustering: The distance matters! CoRR Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2019	—	`conf`	Parameterized k-Clustering: Tractability Island. FSTTCS Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2019	A*	`conf`	Refined Complexity of PCA with Outliers. ICML Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2019	J	`jnl`	Refined Complexity of PCA with Outliers. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2019	J	`jnl`	Spanning Circuits in Regular Matroids. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2019	J	`jnl`	Surjective H-colouring: New hardness results. Comput. Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2018	J	`jnl`	Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421). Dagstuhl Reports Henning Fernau, Petr A. Golovach, Marie-France Sagot
2018	J	`jnl`	Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2018	A*	`conf`	Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Clustering to Given Connectivities. CoRR Petr A. Golovach, Dimitrios M. Thilikos
2018	J	`jnl`	Computing square roots of graphs with low maximum degree. Discret. Appl. Math. Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018	J	`jnl`	Covering Vectors by Spaces: Regular Matroids. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2018	J	`jnl`	Enumeration and maximum number of minimal connected vertex covers in graphs. Eur. J. Comb. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2018	J	`jnl`	Finding Cactus Roots in Polynomial Time. Theory Comput. Syst. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018	J	`jnl`	On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2018	A	`conf`	On the Tractability of Optimization Problems on H-Graphs. ESA Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2018	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2018	—	`conf`	Parameterized Aspects of Strong Subgraph Closure. SWAT Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2018	J	`jnl`	Parameterized Aspects of Strong Subgraph Closure. CoRR Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2018	A*	`conf`	Parameterized Low-Rank Binary Matrix Approximation. ICALP Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2018	J	`jnl`	Parameterized Low-Rank Binary Matrix Approximation. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2018	—	`conf`	Partial Complementation of Graphs. SWAT Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
2018	J	`jnl`	Partial complementation of graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos
2018	J	`jnl`	Structured Connectivity Augmentation. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2017	J	`jnl`	A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2017	J	`jnl`	A linear kernel for finding square roots of almost planar graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2017	B	`conf`	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	J	`jnl`	Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
2017	A*	`conf`	Covering Vectors by Spaces: Regular Matroids. ICALP Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	J	`jnl`	Covering vectors by spaces: Regular matroids. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	J	`jnl`	Editing to a connected graph of given degrees. Inf. Comput. Petr A. Golovach
2017	J	`jnl`	Editing to a planar graph of given degrees. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2017	B	`conf`	Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. WG Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2017	C	`conf`	Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. CIAC Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi
2017	B	`conf`	Finding Connected Secluded Subgraphs. IPEC Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
2017	J	`jnl`	Finding Connected Secluded Subgraphs. CoRR Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
2017	J	`jnl`	Graph editing to a fixed target. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Iain A. Stewart
2017	J	`jnl`	Graph editing to a given degree sequence. Theor. Comput. Sci. Petr A. Golovach, George B. Mertzios
2017	J	`jnl`	Metric Dimension of Bounded Tree-length Graphs. SIAM J. Discret. Math. Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
2017	J	`jnl`	Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2017	J	`jnl`	On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2017	J	`jnl`	On the tractability of optimization problems on H-graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2017	J	`jnl`	Parameterized Complexity of Secluded Connectivity Problems. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov
2017	J	`jnl`	Parameterized Complexity of Superstring Problems. Algorithmica Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2017	A*	`conf`	Spanning Circuits in Regular Matroids. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2017	B	`conf`	Structured Connectivity Augmentation. MFCS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2017	J	`jnl`	Structured Connectivity Augmentation. CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2017	C	`conf`	Surjective H-Colouring: New Hardness Results. CiE Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2017	J	`jnl`	Surjective H-Colouring: New Hardness Results. CoRR Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2017	J	`jnl`	The Parameterized Complexity of Graph Cyclability. SIAM J. Discret. Math. Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2016	—	`conf`	A Linear Kernel for Finding Square Roots of Almost Planar Graphs. SWAT Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	A Linear Kernel for Finding Square Roots of Almost Planar Graphs. CoRR Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	A	`conf`	Editing to Connected f-Degree Graph. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2016	J	`jnl`	Editing to Eulerian graphs. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2016	J	`jnl`	Enumerating minimal connected dominating sets in graphs of bounded chordality. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2016	J	`jnl`	Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
2016	J	`jnl`	Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2016	C	`conf`	Finding Cactus Roots in Polynomial Time. IWOCA Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	Misc	`conf`	Graph Editing to a Given Degree Sequence. CSR Petr A. Golovach, George B. Mertzios
2016	J	`jnl`	Graph Editing to a Given Degree Sequence. CoRR Petr A. Golovach, George B. Mertzios
2016	J	`jnl`	How to hunt an invisible rabbit on a graph. Eur. J. Comb. Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk
2016	J	`jnl`	Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2016	J	`jnl`	Metric Dimension of Bounded Tree-length Graphs. CoRR Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
2016	J	`jnl`	Parameterized Algorithms for Finding Square Roots. Algorithmica Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2016	J	`jnl`	Parameterized complexity of the anchored k-core problem for directed graphs. Inf. Comput. Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach
2016	J	`jnl`	Spanning Circuits in Regular Matroids. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	Squares of Low Clique Number. Electron. Notes Discret. Math. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	Squares of Low Maximum Degree. CoRR Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2015	J	`jnl`	An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. Algorithmica Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2015	J	`jnl`	Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Bernard Ries
2015	J	`jnl`	Editing to a Graph of Given Degrees. Theor. Comput. Sci. Petr A. Golovach
2015	Misc	`conf`	Editing to a Planar Graph of Given Degrees. CSR Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	J	`jnl`	Editing to a Planar Graph of Given Degrees. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	B	`conf`	Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. IPEC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2015	C	`conf`	Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs. IWOCA Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
2015	J	`jnl`	Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2015	C	`conf`	How to Hunt an Invisible Rabbit on a Graph. CTW Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk
2015	J	`jnl`	How to Hunt an Invisible Rabbit on a Graph. CoRR Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk
2015	J	`jnl`	Induced Disjoint Paths in Claw-Free Graphs. SIAM J. Discret. Math. Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2015	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2015	J	`jnl`	List Coloring in the Absence of a Linear Forest. Algorithmica Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2015	—	`conf`	Metric Dimension of Bounded Width Graphs. MFCS (2) Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
2015	J	`jnl`	Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2015	J	`jnl`	Modifying a Graph Using Vertex Elimination. Algorithmica Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2015	B	`conf`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	J	`jnl`	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
2015	—	`conf`	Parameterized Complexity of Secluded Connectivity Problems. FSTTCS Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov
2015	J	`jnl`	Parameterized Complexity of Secluded Connectivity Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov
2015	B	`conf`	Parameterized Complexity of Superstring Problems. CPM Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2015	J	`jnl`	Parameterized Complexity of Superstring Problems. CoRR Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
2015	B	`conf`	Variants of Plane Diameter Completion. IPEC Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos
2015	J	`jnl`	Variants of Plane Diameter Completion. CoRR Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos
2014	J	`jnl`	A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2014	J	`jnl`	Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. Petr A. Golovach, Daniël Paulusma, Jian Song
2014	J	`jnl`	Coloring graphs without short cycles and long induced paths. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Jian Song
2014	J	`jnl`	Colouring of graphs with Ramsey-type forbidden subgraphs. Theor. Comput. Sci. Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
2014	—	`conf`	Connecting Vertices by Independent Trees. FSTTCS Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh
2014	J	`jnl`	Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2014	—	`conf`	Editing to Eulerian Graphs. FSTTCS Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	J	`jnl`	Editing to Eulerian Graphs. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	—	`conf`	Editing to a Connected Graph of Given Degrees. MFCS (2) Petr A. Golovach
2014	B	`conf`	Editing to a Graph of Given Degrees. IPEC Petr A. Golovach
2014	J	`jnl`	Finding clubs in graph classes. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2014	B	`conf`	Hadwiger Number of Graphs with Small Chordality. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	J	`jnl`	Hadwiger number of graphs with small chordality. CoRR Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	B	`conf`	Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. WG Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2014	J	`jnl`	Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2014	J	`jnl`	Lift-contractions. Eur. J. Comb. Petr A. Golovach, Daniël Paulusma, Marcin Kaminski, Dimitrios M. Thilikos
2014	J	`jnl`	List coloring in the absence of two subgraphs. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma
2014	J	`jnl`	Long Circuits and Large Euler Subgraphs. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach
2014	—	`conf`	Parameterized Algorithms to Preserve Connectivity. ICALP (1) Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2014	J	`jnl`	Parameterized complexity of connected even/odd subgraph problems. J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach
2014	J	`jnl`	Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	B	`conf`	Recognizing Threshold Tolerance Graphs in O(n WG Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
2014	J	`jnl`	Solutions for the stable roommates problem with payments. Theor. Comput. Sci. Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
2014	J	`jnl`	Subset feedback vertex sets in chordal graphs. J. Discrete Algorithms Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2014	A	`conf`	The Parameterized Complexity of Graph Cyclability. ESA Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2014	J	`jnl`	The Parameterized Complexity of Graph Cyclability. CoRR Petr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos
2013	J	`jnl`	4-coloring H-free graphs when H is small. Discret. Appl. Math. Petr A. Golovach, Daniël Paulusma, Jian Song
2013	—	`conf`	An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets. ICALP (1) Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2013	J	`jnl`	Choosability on H-free graphs. Inf. Process. Lett. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2013	C	`conf`	Cliques and Clubs. CIAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2013	J	`jnl`	Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin
2013	B	`conf`	Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. WG Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
2013	J	`jnl`	Detecting induced minors in AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	J	`jnl`	Editing to a Connected Graph of Given Degrees. CoRR Petr A. Golovach
2013	J	`jnl`	Editing to a Graph of Given Degrees. CoRR Petr A. Golovach
2013	C	`conf`	Graph Editing to a Fixed Target. IWOCA Petr A. Golovach, Daniël Paulusma, Iain A. Stewart
2013	J	`jnl`	Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs CoRR Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	B	`conf`	Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013	C	`conf`	List Coloring in the Absence of Two Subgraphs. CIAC Petr A. Golovach, Daniël Paulusma
2013	J	`jnl`	Long Circuits and Large Euler Subgraphs CoRR Fedor V. Fomin, Petr A. Golovach
2013	A	`conf`	Long Circuits and Large Euler Subgraphs. ESA Fedor V. Fomin, Petr A. Golovach
2013	J	`jnl`	Minimizing Rosenthal Potential in Multicast Games. CoRR Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2013	J	`jnl`	Obtaining planarity by contracting few edges. Theor. Comput. Sci. Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2013	B	`conf`	On the Parameterized Complexity of Cutting a Few Vertices from a Graph. MFCS Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
2013	J	`jnl`	On the parameterized complexity of cutting a few vertices from a graph CoRR Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen
2013	J	`jnl`	Parameterized Algorithms for Finding Square Roots. CoRR Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	B	`conf`	Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2013	J	`jnl`	Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs CoRR Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach
2013	—	`conf`	Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. FSTTCS Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach
2013	J	`jnl`	Preventing Unraveling in Social Networks Gets Harder CoRR Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach
2013	A*	`conf`	Preventing Unraveling in Social Networks Gets Harder. AAAI Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach
2013	B	`conf`	Sparse Square Roots. WG Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013	J	`jnl`	Three complexity results on coloring Pk-free graphs. Eur. J. Comb. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2013	J	`jnl`	Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. Hajo Broersma, Petr A. Golovach, Viresh Patel
2012	B	`conf`	4-Coloring H-Free Graphs When H Is Small. SOFSEM Petr A. Golovach, Daniël Paulusma, Jian Song
2012	B	`conf`	An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs. IPEC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
2012	B	`conf`	Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC Petr A. Golovach, Daniël Paulusma, Jian Song
2012	B	`conf`	Coloring Graphs Characterized by a Forbidden Subgraph. MFCS Petr A. Golovach, Daniël Paulusma, Bernard Ries
2012	J	`jnl`	Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. Petr A. Golovach, Daniël Paulusma, Jian Song
2012	J	`jnl`	Containment relations in split graphs. Discret. Appl. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	J	`jnl`	Cops and Robber Game Without Recharging. Theory Comput. Syst. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2012	J	`jnl`	Cops and Robber with Constraints. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Pawel Pralat
2012	B	`conf`	Detecting Induced Minors in AT-Free Graphs. ISAAC Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2012	J	`jnl`	Determining the chromatic number of triangle-free 2P Theor. Comput. Sci. Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2012	J	`jnl`	Distance three labelings of trees. Discret. Appl. Math. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma
2012	J	`jnl`	Edge search number of cographs. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Rodica Mihai
2012	Misc	`conf`	Finding Vertex-Surjective Graph Homomorphisms. CSR Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
2012	J	`jnl`	Finding vertex-surjective graph homomorphisms CoRR Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
2012	J	`jnl`	Finding vertex-surjective graph homomorphisms. Acta Informatica Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma
2012	J	`jnl`	Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay CoRR Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger
2012	B	`conf`	How to Eliminate a Graph. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2012	—	`conf`	Induced Disjoint Paths in AT-Free Graphs. SWAT Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	J	`jnl`	Induced Disjoint Paths in Claw-Free Graphs CoRR Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	A	`conf`	Induced Disjoint Paths in Claw-Free Graphs. ESA Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
2012	J	`jnl`	Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	—	`conf`	Minimizing Rosenthal Potential in Multicast Games. ICALP (2) Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2012	J	`jnl`	Obtaining Planarity by Contracting Few Edges CoRR Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2012	B	`conf`	Obtaining Planarity by Contracting Few Edges. MFCS Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2012	J	`jnl`	On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2012	A	`conf`	Parameterized Complexity of Connected Even/Odd Subgraph Problems. STACS Fedor V. Fomin, Petr A. Golovach
2012	J	`jnl`	Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen
2012	J	`jnl`	Parameterized complexity of generalized domination problems. Discret. Appl. Math. Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý
2012	B	`conf`	Solutions for the Stable Roommates Problem with Payments. WG Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
2012	J	`jnl`	Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2012	B	`conf`	k-Gap Interval Graphs. LATIN Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2011	J	`jnl`	Approximating Width Parameters of Hypergraphs with Excluded Minors. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2011	J	`jnl`	Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2011	J	`jnl`	Bandwidth on AT-free graphs. Theor. Comput. Sci. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2011	J	`jnl`	Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2011	B	`conf`	Coloring Graphs without Short Cycles and Long Induced Paths. FCT Petr A. Golovach, Daniël Paulusma, Jian Song
2011	Misc	`conf`	Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR Petr A. Golovach, Daniël Paulusma, Jian Song
2011	B	`conf`	Contracting a Chordal Graph to a Split Graph or a Tree. MFCS Petr A. Golovach, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Contraction obstructions for treewidth. J. Comb. Theory B Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2011	B	`conf`	Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2011	J	`jnl`	How to Guard a Graph? Algorithmica Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
2011	B	`conf`	Increasing the Minimum Degree of a Graph by Contractions. IPEC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	J	`jnl`	Lift Contractions. Electron. Notes Discret. Math. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011	B	`conf`	List Coloring in the Absence of a Linear Forest. WG Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2011	C	`conf`	Odd cyclic surface separators in planar graphs. CTW Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos
2011	J	`jnl`	Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theor. Comput. Sci. Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2011	J	`jnl`	Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discret. Optim. Petr A. Golovach, Dimitrios M. Thilikos
2011	J	`jnl`	Spanners in sparse graphs. J. Comput. Syst. Sci. Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2011	J	`jnl`	Spanners of bounded degree graphs. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen
2011	B	`conf`	Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC Hajo Broersma, Petr A. Golovach, Viresh Patel
2011	J	`jnl`	k-Gap Interval Graphs CoRR Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2010	A*	`conf`	Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	B	`conf`	Approximation Algorithms for Domination Search. WAOA Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2010	B	`conf`	Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG Petr A. Golovach, Dieter Kratsch, Jean-François Couturier
2010	J	`jnl`	Complexity of the packing coloring problem for trees. Discret. Appl. Math. Jirí Fiala, Petr A. Golovach
2010	—	`conf`	Cops and Robber Game without Recharging. SWAT Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2010	J	`jnl`	Intractability of Clique-Width Parameterizations. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	B	`conf`	Narrowing Down the Gap on the Complexity of Coloring WG Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010	—	`conf`	On Coloring Graphs without Induced Forests. ISAAC (2) Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010	J	`jnl`	Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh
2010	J	`jnl`	Pursuing a fast robber on a graph. Theor. Comput. Sci. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan
2009	A	`conf`	Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	B	`conf`	Bandwidth on AT-Free Graphs. ISAAC Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh
2009	B	`conf`	Choosability of P5-Free Graphs. MFCS Petr A. Golovach, Pinar Heggernes
2009	A*	`conf`	Clique-width: on the price of generality. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2009	A	`conf`	Contraction Bidimensionality: The Accurate Picture. ESA Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	—	`conf`	Contraction Bidimensionality: the Accurate Picture. Parameterized complexity and approximation algorithms Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	B	`conf`	Guard Games on Graphs: Keep the Intruder Out! WAOA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2009	B	`conf`	Induced Packing of Odd Cycles in a Planar Graph. ISAAC Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009	C	`conf`	Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2009	B	`conf`	Parameterized Complexity of Generalized Domination Problems. WG Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý
2009	—	`conf`	Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. IWPEC Petr A. Golovach, Dimitrios M. Thilikos
2009	J	`jnl`	Sort and Search: Exact algorithms for generalized domination. Inf. Process. Lett. Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2009	J	`jnl`	The capture time of a graph. Discret. Math. Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl
2009	C	`conf`	Three Complexity Results on Coloring IWOCA Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2008	B	`conf`	A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2008	J	`jnl`	Approximating acyclicity parameters of sparse hypergraphs CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2008	B	`conf`	Complexity of the Packing Coloring Problem for Trees. WG Jirí Fiala, Petr A. Golovach
2008	—	`conf`	Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract). ICALP (1) Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2008	C	`conf`	Distance Constrained Labelings of Trees. TAMC Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2008	C	`conf`	Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity. TAMC Petr A. Golovach, Jan Kratochvíl
2008	B	`conf`	How to Guard a Graph?. ISAAC Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer
2008	—	`conf`	On tractability of Cops and Robbers game. IFIP TCS Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl
2008	B	`conf`	Parameterized Complexity for Domination Problems on Degenerate Graphs. WG Petr A. Golovach, Yngve Villanger
2008	—	`conf`	Spanners in Sparse Graphs. ICALP (1) Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2007	J	`jnl`	Backbone colorings for graphs: Tree and path backbones. J. Graph Theory Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2007	B	`conf`	Branch and Recharge: Exact Algorithms for Generalized Domination. WADS Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff
2007	B	`conf`	Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG Petr A. Golovach, Jan Kratochvíl
2005	A*	`conf`	Distance Constrained Labelings of Graphs of Bounded Treewidth. ICALP Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2004	B	`conf`	Elegant Distance Constrained Labelings of Trees. WG Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2003	B	`conf`	Backbone Colorings for Networks. WG Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2003	J	`jnl`	Interval degree and bandwidth of a graph. Discret. Appl. Math. Fedor V. Fomin, Petr A. Golovach
2000	J	`jnl`	Graph Searching and Interval Completion. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach
1998	B	`conf`	Interval Completion with the Smallest Max-degree. WG Fedor V. Fomin, Petr A. Golovach