Fedor V. Fomin

647 papers A* 77A 55B 68C 6Misc 11Journal 371Unranked 41

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	—	`ed.`	Computing and Combinatorics - 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part I COCOON (1) Fedor V. Fomin, Mingyu Xiao
2026	—	`ed.`	Computing and Combinatorics - 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part II COCOON (2) Fedor V. Fomin, Mingyu Xiao
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	J	`jnl`	Distributed Model Checking on Graphs of Bounded Treedepth. Algorithmica Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2026	A*	`conf`	Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. SODA Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen
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`	The parameterized complexity landscape of two-sets cut-uncut. Theor. Comput. Sci. Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
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`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. ITCS Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
2025	J	`jnl`	Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. CoRR Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, Saket Saurabh
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	J	`jnl`	Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. CoRR Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen
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	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	J	`jnl`	Path Contraction Faster than 2 CoRR Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2025	B	`conf`	Planar Network Diversion. SEA Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes
2025	J	`jnl`	Planar Network Diversion. CoRR Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Steinar Simonnes
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	A*	`conf`	Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
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	A	`conf`	Distributed Model Checking on Graphs of Bounded Treedepth. DISC Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024	J	`jnl`	Distributed Model Checking on Graphs of Bounded Treedepth. CoRR Fedor V. Fomin, Pierre Fraigniaud, 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`	Fast FPT-Approximation of Branchwidth. SIAM J. Comput. Fedor V. Fomin, Tuukka Korhonen
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`	New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Roohani Sharma, Madhumita Kundu
2024	J	`jnl`	On coresets for fair clustering in metric and Euclidean spaces and their applications. J. Comput. Syst. Sci. Sayan Bandyapadhyay, Fedor V. Fomin, 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	A	`conf`	Structural perspective on constraint-based learning of Markov networks. AISTATS Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
2024	J	`jnl`	Structural perspective on constraint-based learning of Markov networks. CoRR Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
2024	B	`conf`	The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. IPEC Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh
2024	J	`jnl`	The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. CoRR Matthias Bentert, Fedor V. Fomin, Fanny Hauser, 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`	Building large J. Comput. Syst. Sci. Fedor V. Fomin, 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	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	A*	`conf`	Coresets for Clustering in Geometric Intersection Graphs. SoCG Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
2023	J	`jnl`	Coresets for Clustering in Geometric Intersection Graphs. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
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`	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	J	`jnl`	IPEC Nerode Prize 2023 - Call for Nominations. Bull. EATCS Fedor V. Fomin
2023	J	`jnl`	IPEC Nerode Prize 2023. Bull. EATCS Fedor V. Fomin
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	A	`conf`	Lossy Kernelization for (Implicit) Hitting Set Problems. ESA Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2023	J	`jnl`	Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
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	J	`jnl`	On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
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`	Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023	J	`jnl`	Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023	B	`conf`	Proportionally Fair Matching with Multiple Groups. WG Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023	J	`jnl`	Proportionally Fair Matching with Multiple Groups. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023	A*	`conf`	Shortest Cycles With Monotone Submodular Costs. SODA Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
2023	B	`conf`	Socially Fair Matching: Exact and Approximation Algorithms. WADS Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
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	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	B	`conf`	Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
2022	J	`jnl`	Boolean and F CoRR Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
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	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	A*	`conf`	Fast FPT-approximation of branchwidth. STOC Fedor V. Fomin, Tuukka Korhonen
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	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	A*	`conf`	Inconsistent Planning: When in Doubt, Toss a Coin! AAAI Yuriy Dementiev, Fedor V. Fomin, Artur Ignatiev
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`	On the Parameterized Complexity of the Expected Coverage Problem. Theory Comput. Syst. Fedor V. Fomin, Vijayaragunathan Ramamoorthi
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	J	`jnl`	Present-biased optimization. Math. Soc. Sci. Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
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`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
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	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Trans. Comput. Theory Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
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`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, 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`	Fast FPT-Approximation of Branchwidth. CoRR Fedor V. Fomin, Tuukka Korhonen
2021	A*	`conf`	Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, 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`	Inconsistent Planning: When in doubt, toss a coin! CoRR Yuriy Dementiev, Fedor V. Fomin, Artur Ignatiev
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	A*	`conf`	On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
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	J	`jnl`	Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich
2021	A*	`conf`	Present-Biased Optimization. AAAI Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
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	A*	`conf`	Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Bidimensionality and Kernels. SIAM J. Comput. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2020	B	`conf`	Building Large k-Cores from Sparse Graphs. MFCS Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2020	J	`jnl`	Building large k-cores from sparse graphs. CoRR Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2020	J	`jnl`	CSR 2018 Special Issue on TOCS. Theory Comput. Syst. Fedor V. Fomin, Vladimir V. Podolskii
2020	A*	`conf`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ICALP Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. CoRR Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi
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	A*	`conf`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
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	A*	`conf`	Hitting topological minors is FPT. STOC Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
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	B	`conf`	Knot Diagrams of Treewidth Two. WG Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
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`	Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020	J	`jnl`	Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020	J	`jnl`	On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, 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	Misc	`conf`	On the Parameterized Complexity of the Expected Coverage Problem. CSR Fedor V. Fomin, Vijayaragunathan Ramamoorthi
2020	J	`jnl`	On the Tractability of Optimization Problems on H-Graphs. Algorithmica Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
2020	J	`jnl`	On the parameterized complexity of [1, Theor. Comput. Sci. Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan
2020	A	`conf`	Parameterization Above a Multiplicative Guarantee. ITCS Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`ch.`	Parameterized Algorithms. Beyond the Worst-Case Analysis of Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
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`	Path Contraction Faster than 2 SIAM J. Discret. Math. Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020	J	`jnl`	Present-Biased Optimization. CoRR Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach
2020	J	`jnl`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
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
2020	A*	`conf`	Time-Inconsistent Planning: Simple Motivation Is Hard to Find. AAAI Fedor V. Fomin, Torstein J. F. Strømme
2020	—	`ed.`	Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday Treewidth, Kernels, and Algorithms Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen
2019	J	`jnl`	A Fixed-Parameter Perspective on #BIS. Algorithmica Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
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	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	A*	`conf`	Decomposition of Map Graphs with Applications. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Decomposition of Map Graphs with Applications. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
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`	Exact Algorithms via Monotone Local Search. J. ACM Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2019	J	`jnl`	Finding Detours is Fixed-Parameter Tractable. SIAM J. Discret. Math. Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
2019	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
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	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`	Knot Diagrams of Treewidth Two. CoRR Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
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`	New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Dagstuhl Reports Fedor V. Fomin, Dániel Marx, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	On width measures and topological problems on semi-complete digraphs. J. Comb. Theory B Fedor V. Fomin, Michal Pilipczuk
2019	J	`jnl`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
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`	Path Contraction Faster Than 2 ICALP Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019	J	`jnl`	Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
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`	Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
2019	J	`jnl`	Time-inconsistent Planning: Simple Motivation Is Hard to Find. CoRR Fedor V. Fomin, Torstein J. F. Strømme
2018	J	`jnl`	Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Algorithmica Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
2018	A*	`conf`	Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. SoCG Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos
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	Misc	`ed.`	Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings CSR Fedor V. Fomin, Vladimir V. Podolskii
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`	Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2018	J	`jnl`	Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna
2018	J	`jnl`	Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2018	J	`jnl`	Long directed ( Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
2018	A	`conf`	On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
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	—	`conf`	On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan
2018	A	`conf`	On the Tractability of Optimization Problems on H-Graphs. ESA Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
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`	Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica Fedor V. Fomin, Saket Saurabh
2018	J	`jnl`	Structured Connectivity Augmentation. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2018	J	`jnl`	Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2017	B	`conf`	A Fixed-Parameter Perspective on #BIS. IPEC Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2017	J	`jnl`	A Fixed-Parameter Perspective on #BIS. CoRR Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas
2017	J	`jnl`	Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. CoRR Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Anastasios Sidiropoulos
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	A*	`conf`	Exact Algorithms for Terrain Guarding. SoCG Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2017	A*	`conf`	Finding Detours is Fixed-Parameter Tractable. ICALP Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
2017	A*	`conf`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	A*	`conf`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2017	A	`conf`	Matrix Rigidity from the Viewpoint of Parameterized Complexity. STACS Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi
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`	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	J	`jnl`	Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström
2017	J	`jnl`	Representative Families of Product Families. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, 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	J	`jnl`	The EATCS Award 2017 - Laudatio for Eva Tardos. Bull. EATCS Fedor V. Fomin, Christos H. Papadimitriou, Jean-Eric Pin
2017	J	`jnl`	Tight Lower Bounds on Graph Embedding Problems. J. ACM Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2016	J	`jnl`	(Meta) Kernelization. J. ACM Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2016	J	`jnl`	A c SIAM J. Comput. Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2016	J	`jnl`	Bidimensionality and Kernels. CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2016	—	`ch.`	Bidimensionality. Encyclopedia of Algorithms Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2016	—	`ch.`	Branchwidth of Graphs. Encyclopedia of Algorithms Fedor V. Fomin, Dimitrios M. Thilikos
2016	A	`conf`	Editing to Connected f-Degree Graph. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2016	J	`jnl`	Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A*	`conf`	Exact algorithms via monotone local search. STOC Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2016	J	`jnl`	Finding Detours is Fixed-parameter Tractable. CoRR Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
2016	J	`jnl`	Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	J	`jnl`	Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos
2016	—	`conf`	Graph Decompositions and Algorithms (Invited Talk). FSTTCS Fedor V. Fomin
2016	J	`jnl`	Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
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	A	`conf`	Kernelization and Sparseness: the Case of Dominating Set. STACS Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar
2016	J	`jnl`	Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
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 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	A*	`conf`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A*	`conf`	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	—	`ch.`	Subexponential Parameterized Algorithms. Encyclopedia of Algorithms Fedor V. Fomin
2016	A*	`conf`	Subexponential parameterized algorithm for Interval Completion. SODA Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2016	J	`jnl`	Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. CoRR Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
2016	J	`jnl`	The EATCS Award 2017 - Call for Nominations. Bull. EATCS Fedor V. Fomin
2016	J	`jnl`	The Firefighter problem on graph classes. Theor. Comput. Sci. Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
2016	A*	`conf`	Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. SODA Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2016	J	`jnl`	Tight Lower Bounds on Graph Embedding Problems. CoRR Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala
2016	B	`conf`	Vertex Cover Structural Parameterization Revisited. WG Fedor V. Fomin, Torstein J. F. Strømme
2016	J	`jnl`	Vertex Cover Structural Parameterization Revisited. CoRR Fedor V. Fomin, Torstein J. F. Strømme
2015	J	`jnl`	40th international colloquium on automata, languages and programming. Inf. Comput. Fedor V. Fomin, Marta Z. Kwiatkowska, David Peleg
2015	J	`jnl`	A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2015	J	`jnl`	Computing Tree-Depth Faster Than 2 Algorithmica Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2015	J	`jnl`	EATCS Award 2015. Bull. EATCS Fedor V. Fomin, Kim Larsen, Vladimiro Sassone
2015	J	`jnl`	Exact Algorithms via Monotone Local Search. CoRR Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2015	J	`jnl`	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
2015	Misc	`conf`	Graph Modification Problems: A Modern Perspective. FAW Fedor V. Fomin, Saket Saurabh, Neeldhara Misra
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`	Large Induced Subgraphs via Triangulations and CMSO. SIAM J. Comput. Fedor V. Fomin, Ioan Todinca, Yngve Villanger
2015	—	`conf`	Lower Bounds for the Graph Homomorphism Problem. ICALP (1) Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
2015	J	`jnl`	Lower Bounds for the Graph Homomorphism Problem. CoRR Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
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`	Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Algorithmica Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
2015	J	`jnl`	On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theor. Comput. Sci. Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
2015	—	`book`	Parameterized Algorithms Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
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	—	`conf`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	A*	`conf`	Solving SODA Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Tight Bounds for Subgraph Isomorphism and Graph Homomorphism. CoRR Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
2014	A	`conf`	A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	A subexponential parameterized algorithm for Interval Completion. CoRR Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	J	`jnl`	A subexponential parameterized algorithm for Proper Interval Completion. CoRR Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
2014	—	`conf`	Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. SWAT Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca
2014	J	`jnl`	Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. CoRR Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca
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	—	`conf`	Connecting Vertices by Independent Trees. FSTTCS Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh
2014	A*	`conf`	Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2014	A	`conf`	Exploring Subexponential Parameterized Complexity of Completion Problems. STACS Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2014	—	`ch.`	Kernelization Methods for Fixed-Parameter Tractability. Tractability Fedor V. Fomin, Saket Saurabh
2014	J	`jnl`	Kernelization and Sparseness: the case of Dominating Set. CoRR Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar
2014	A*	`conf`	Large induced subgraphs via triangulations and CMSO. SODA Fedor V. Fomin, Ioan Todinca, Yngve Villanger
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 firefighting. J. Comput. Syst. Sci. Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen
2014	J	`jnl`	Preprocessing subgraph and minor problems: When does a small vertex cover help? J. Comput. Syst. Sci. Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2014	A	`conf`	Representative Sets of Product Families. ESA Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Representative Sets of Product Families. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Searching for better fill-in. J. Comput. Syst. Sci. Fedor V. Fomin, Yngve Villanger
2014	J	`jnl`	Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. J. Comput. Syst. Sci. Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
2014	J	`jnl`	To satisfy impatient Web surfers is hard. Theor. Comput. Sci. Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse
2013	J	`jnl`	A O(c^k n) 5-Approximation Algorithm for Treewidth CoRR Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	J	`jnl`	A Polynomial Kernel for Proper Interval Vertex Deletion. SIAM J. Discret. Math. Fedor V. Fomin, Saket Saurabh, Yngve Villanger
2013	J	`jnl`	A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2013	A*	`conf`	An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	—	`ed.`	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I ICALP (1) Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
2013	—	`ed.`	Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II ICALP (2) Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg
2013	J	`jnl`	Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Inf. Comput. Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2013	J	`jnl`	Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos
2013	J	`jnl`	Computing Optimal Steiner Trees in Polynomial Space. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch, Daniel Lokshtanov, Saket Saurabh
2013	B	`conf`	Computing Tree-Depth Faster Than 2 n. IPEC Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2013	J	`jnl`	Computing Tree-depth Faster Than 2 CoRR Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2013	J	`jnl`	Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2013	J	`jnl`	Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2013	J	`jnl`	Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2013	J	`jnl`	Exact exponential algorithms. Commun. ACM Fedor V. Fomin, Petteri Kaski
2013	J	`jnl`	Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	B	`conf`	Faster Exact Algorithms for Some Terminal Set Problems. IPEC Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
2013	A*	`conf`	Jungles, bundles, and fixed parameter tractability. SODA Fedor V. Fomin, Michal Pilipczuk
2013	J	`jnl`	Large induced subgraphs via triangulations and CMSO. CoRR Fedor V. Fomin, Ioan Todinca, Yngve Villanger
2013	A	`conf`	Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	J	`jnl`	Largest chordal and interval subgraphs faster than 2^n. CoRR Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
2013	A	`conf`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. STACS Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
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	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 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	J	`jnl`	Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles. J. Graph Theory Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2013	A	`conf`	Searching for better fill-in. STACS Fedor V. Fomin, Yngve Villanger
2013	A	`conf`	Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. ESA Fedor V. Fomin, Michal Pilipczuk
2013	J	`jnl`	Subexponential Parameterized Algorithm for Minimum Fill-In. SIAM J. Comput. Fedor V. Fomin, Yngve Villanger
2013	J	`jnl`	Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph CoRR Fedor V. Fomin, Michal Pilipczuk
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	A	`conf`	Tight bounds for Parameterized Complexity of Cluster Editing. STACS Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
2012	J	`jnl`	A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	A	`conf`	A Polynomial Kernel for Proper Interval Vertex Deletion. ESA Fedor V. Fomin, Saket Saurabh, Yngve Villanger
2012	J	`jnl`	A Polynomial kernel for Proper Interval Vertex Deletion CoRR Fedor V. Fomin, Saket Saurabh, Yngve Villanger
2012	—	`ed.`	Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings SWAT Fedor V. Fomin, Petteri Kaski
2012	A*	`conf`	Bidimensionality and geometric graphs. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2012	J	`jnl`	Catalan structures and dynamic programming in H-minor-free graphs. J. Comput. Syst. Sci. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2012	J	`jnl`	Connected graph searching. Inf. Comput. Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, 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	J	`jnl`	Counting Subgraphs via Homomorphisms. SIAM J. Discret. Math. Omid Amini, Fedor V. Fomin, Saket Saurabh
2012	—	`conf`	FPT Suspects and Tough Customers: Open Problems of Downey and Fellows. The Multivariate Algorithmic Revolution and Beyond Fedor V. Fomin, Dániel Marx
2012	J	`jnl`	Fast Minor Testing in Planar Graphs. Algorithmica Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2012	J	`jnl`	Faster algorithms for finding and counting subgraphs. J. Comput. Syst. Sci. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao
2012	J	`jnl`	Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2012	J	`jnl`	Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Trans. Algorithms Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2012	A*	`conf`	Linear kernels for (connected) dominating set on SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2012	J	`jnl`	Local search: Is brute-force avoidable? J. Comput. Syst. Sci. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
2012	Misc	`conf`	Making Life Easier for Firefighters. FUN Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
2012	—	`conf`	Minimizing Rosenthal Potential in Multicast Games. ICALP (2) Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk
2012	J	`jnl`	On exact algorithms for treewidth. ACM Trans. Algorithms Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
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`	Planar F-Deletion: Approximation and Optimal FPT Algorithms CoRR Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	A*	`conf`	Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012	B	`conf`	Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2012	J	`jnl`	Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk
2012	J	`jnl`	Sharp Separation and Applications to Exact and Parameterized Algorithms. Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh
2012	A*	`conf`	Subexponential parameterized algorithm for minimum fill-in. SODA Fedor V. Fomin, Yngve Villanger
2012	—	`ed.`	The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday The Multivariate Algorithmic Revolution and Beyond Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx
2012	Misc	`conf`	To Satisfy Impatient Web Surfers Is Hard. FUN Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse
2012	J	`jnl`	Treewidth computation and extremal combinatorics. Comb. Fedor V. Fomin, Yngve Villanger
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`	An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
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	A*	`conf`	Bidimensionality and EPTAS. SODA Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Bidimensionality and Geometric Graphs CoRR Fedor V. Fomin, Daniel Lokshtanov, 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	J	`jnl`	Contraction obstructions for treewidth. J. Comb. Theory B Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2011	B	`conf`	Enumerating Minimal Subset Feedback Vertex Sets. WADS Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2011	A	`conf`	Exact Algorithm for the Maximum Induced Planar Subgraph Problem. ESA Fedor V. Fomin, Ioan Todinca, Yngve Villanger
2011	J	`jnl`	Faster parameterized algorithms for minor containment. Theor. Comput. Sci. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2011	J	`jnl`	Guard games on graphs: Keep the intruder out! Theor. Comput. Sci. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2011	A	`conf`	Hitting forbidden minors: Approximation and Kernelization. STACS Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
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	J	`jnl`	Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. Omid Amini, Fedor V. Fomin, Saket Saurabh
2011	J	`jnl`	Jungles, bundles, and fixed parameter tractability CoRR Fedor V. Fomin, Michal Pilipczuk
2011	J	`jnl`	Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2011	—	`conf`	Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. FSTTCS Fedor V. Fomin, Geevarghese Philip, Yngve Villanger
2011	J	`jnl`	On the complexity of reconstructing J. Graph Theory Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2011	J	`jnl`	On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011	J	`jnl`	Parameterized Complexity of Firefighting Revisited CoRR Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
2011	B	`conf`	Parameterized Complexity of Firefighting Revisited. IPEC Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen
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	J	`jnl`	Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
2011	J	`jnl`	Special Issue on Parameterized Complexity of Discrete Optimization. Discret. Optim. Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin
2011	J	`jnl`	Strengthening Erdös-Pósa property for minor-closed graph classes. J. Graph Theory Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos
2011	J	`jnl`	Subexponential Parameterized Algorithm for Minimum Fill-in CoRR Fedor V. Fomin, Yngve Villanger
2011	J	`jnl`	Subexponential algorithms for partial cover problems. Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2011	J	`jnl`	Subexponential fixed-parameter tractability of cluster editing CoRR Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger
2011	J	`jnl`	Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos
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	J	`jnl`	Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
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	J	`jnl`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs CoRR Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A	`conf`	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. STACS Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	J	`jnl`	Bidimensionality and EPTAS CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	A*	`conf`	Bidimensionality and Kernels. SODA Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010	—	`conf`	Cops and Robber Game without Recharging. SWAT Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2010	J	`jnl`	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
2010	—	`book`	Exact Exponential Algorithms Fedor V. Fomin, Dieter Kratsch
2010	A*	`conf`	Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. AAAI Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2010	—	`conf`	Fast Minor Testing in Planar Graphs. ESA (1) Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	—	`conf`	Faster Parameterized Algorithms for Minor Containment. SWAT Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos
2010	A	`conf`	Finding Induced Subgraphs via Minimal Triangulations. STACS Fedor V. Fomin, Yngve Villanger
2010	J	`jnl`	Hitting forbidden minors: Approximation and Kernelization CoRR Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
2010	J	`jnl`	Intractability of Clique-Width Parameterizations. SIAM J. Comput. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010	J	`jnl`	Iterative compression and exact algorithms. Theor. Comput. Sci. Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2010	Misc	`conf`	Kernelization. CSR Fedor V. Fomin
2010	J	`jnl`	Mixed search number and linear-width of interval and split graphs. Networks Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
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	B	`conf`	Protrusions in Graphs and Their Applications. IPEC Fedor V. Fomin
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
2010	J	`jnl`	Rank-width and tree-width of H-minor-free graphs. Eur. J. Comb. Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos
2010	C	`conf`	Ranking and Drawing in Subexponential Time. IWOCA Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
2010	B	`conf`	Sharp Separation and Applications to Exact and Parameterized Algorithms. LATIN Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh
2010	Misc	`conf`	The Curse of Connectivity: COCOON Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
2009	J	`jnl`	(Meta) Kernelization CoRR Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	A*	`conf`	(Meta) Kernelization. FOCS Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	J	`jnl`	A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	B	`conf`	A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé
2009	J	`jnl`	A measure & conquer approach for the analysis of exact algorithms. J. ACM Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2009	Misc	`conf`	Algorithm for Finding COCOON Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	B	`conf`	An Exact Algorithm for Minimum Distortion Embedding. WG Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2009	A	`conf`	Approximating Acyclicity Parameters of Sparse Hypergraphs. STACS Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2009	A*	`conf`	Clique-width: on the price of generality. SODA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2009	J	`jnl`	Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
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	—	`conf`	Counting Subgraphs via Homomorphisms. ICALP (1) Omid Amini, Fedor V. Fomin, Saket Saurabh
2009	—	`conf`	Distortion Is Fixed Parameter Tractable. ICALP (1) Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2009	B	`conf`	Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2009	J	`jnl`	Faster Algorithms for Finding and Counting Subgraphs CoRR Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh
2009	J	`jnl`	Finding Induced Subgraphs via Minimal Triangulations CoRR Fedor V. Fomin, Yngve Villanger
2009	B	`conf`	Guard Games on Graphs: Keep the Intruder Out! WAOA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
2009	A	`conf`	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2009	J	`jnl`	Kernels for Feedback Arc Set In Tournaments CoRR Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	—	`conf`	Kernels for Feedback Arc Set In Tournaments. FSTTCS Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé
2009	A*	`conf`	Local Search: Is Brute-Force Avoidable? IJCAI Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2009	J	`jnl`	Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
2009	J	`jnl`	On Two Techniques of Combining Branching and Treewidth. Algorithmica Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
2009	—	`ed.`	Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers IWPEC Jianer Chen, Fedor V. Fomin
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`	Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2009	—	`conf`	Subexponential Algorithms for Partial Cover Problems. FSTTCS Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
2009	C	`conf`	Three Complexity Results on Coloring IWOCA Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2008	—	`conf`	08431 Abstracts Collection - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008	—	`conf`	08431 Executive Summary - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008	—	`conf`	08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams
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`	An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. Fedor V. Fomin, Dimitrios M. Thilikos
2008	J	`jnl`	Approximating acyclicity parameters of sparse hypergraphs CoRR Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
2008	—	`ch.`	Branchwidth of Graphs. Encyclopedia of Algorithms Fedor V. Fomin, Dimitrios M. Thilikos
2008	A*	`conf`	Catalan structures and dynamic programming in SODA Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2008	J	`jnl`	Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. ACM Trans. Algorithms Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
2008	—	`ch.`	Exact Algorithms for Dominating Set. Encyclopedia of Algorithms Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni
2008	J	`jnl`	Exact Algorithms for Treewidth and Minimum Fill-In. SIAM J. Comput. Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger
2008	A	`conf`	Faster Steiner Tree Computation in Polynomial-Space. ESA Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2008	J	`jnl`	Forewords: Special issue on graph searching. Theor. Comput. Sci. Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos
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`	Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS Omid Amini, Fedor V. Fomin, Saket Saurabh
2008	J	`jnl`	Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
2008	C	`conf`	Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos
2008	B	`conf`	Iterative Compression and Exact Algorithms. MFCS Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh
2008	J	`jnl`	Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2008	—	`ed.`	Moderately Exponential Time Algorithms, 19.10. - 24.10.2008 Moderately Exponential Time Algorithms Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch
2008	B	`conf`	On the Complexity of Reconstructing H -free Graphs from Their Star Systems. LATIN Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle
2008	J	`jnl`	On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon
2008	—	`conf`	On tractability of Cops and Robbers game. IFIP TCS Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl
2008	J	`jnl`	Parameterized Algorithms for Partial Cover Problems CoRR Omid Amini, Fedor V. Fomin, Saket Saurabh
2008	J	`jnl`	Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2008	J	`jnl`	Solving Connected Dominating Set Faster than 2 Algorithmica Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2008	—	`conf`	Spanners in Sparse Graphs. ICALP (1) Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
2008	J	`jnl`	Spanning directed trees with many leaves CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2008	J	`jnl`	Subexponential parameterized algorithms. Comput. Sci. Rev. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2008	—	`conf`	Treewidth Computation and Extremal Combinatorics. ICALP (1) Fedor V. Fomin, Yngve Villanger
2008	J	`jnl`	Treewidth computation and extremal combinatorics CoRR Fedor V. Fomin, Yngve Villanger
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	J	`jnl`	Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	—	`conf`	Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
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	Misc	`conf`	Counting Minimum Weighted Dominating Sets. COCOON Fedor V. Fomin, Alexey A. Stepanov
2007	J	`jnl`	Eliminating graphs by means of parallel knock-out schemes. Discret. Appl. Math. Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
2007	J	`jnl`	Exact Algorithms for Graph Homomorphisms. Theory Comput. Syst. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2007	B	`conf`	Improved Algorithms for the Feedback Vertex Set Problems. WADS Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
2007	Misc	`conf`	Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2007	B	`conf`	Mixed Search Number and Linear-Width of Interval and Split Graphs. WG Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
2007	J	`jnl`	On self duality of pathwidth in polyhedral graph embeddings. J. Graph Theory Fedor V. Fomin, Dimitrios M. Thilikos
2007	C	`conf`	On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2007	J	`jnl`	Parameterized Algorithms for Directed Maximum Leaf Problems CoRR Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	A*	`conf`	Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007	A*	`conf`	Subexponential Parameterized Algorithms. ICALP Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2006	J	`jnl`	A 3-approximation for the pathwidth of Halin graphs. J. Discrete Algorithms Fedor V. Fomin, Dimitrios M. Thilikos
2006	B	`conf`	Branching and Treewidth Based Exact Algorithms. ISAAC Fedor V. Fomin, Serge Gaspers, Saket Saurabh
2006	J	`jnl`	Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Comput. Fedor V. Fomin, Dimitrios M. Thilikos
2006	—	`conf`	Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. SWAT Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
2006	—	`conf`	Finding a Minimum Feedback Vertex Set in Time IWPEC Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin
2006	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers WG Fedor V. Fomin
2006	A*	`conf`	Measure and conquer: a simple O(2 SODA Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2006	J	`jnl`	New upper bounds on the decomposability of planar graphs. J. Graph Theory Fedor V. Fomin, Dimitrios M. Thilikos
2006	A	`conf`	On Exact Algorithms for Treewidth. ESA Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2006	B	`conf`	Optimal Linear Arrangement of Interval Graphs. MFCS Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov
2006	J	`jnl`	Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. Fedor V. Fomin, Kjartan Høie
2006	J	`jnl`	Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2006	—	`conf`	Solving Connected Dominating Set Faster Than 2 FSTTCS Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	B	`conf`	Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. ISAAC Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
2005	B	`conf`	Computing Branchwidth Via Efficient Triangulations and Blocks. WG Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
2005	J	`jnl`	Connected Graph Searching in Outerplanar Graphs. Electron. Notes Discret. Math. Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca
2005	A	`conf`	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
2005	J	`jnl`	Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. Hans L. Bodlaender, Fedor V. Fomin
2005	B	`conf`	Exact Algorithms for Graph Homomorphisms. FCT Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch
2005	J	`jnl`	Fixed-parameter algorithms for ( ACM Trans. Algorithms Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Graph Searching, Elimination Trees, and a Generalization of Bandwidth. Algorithmica Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
2005	A*	`conf`	Measure and Conquer: Domination - A Case Study. ICALP Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	B	`conf`	Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
2005	J	`jnl`	On maximum number of minimal dominating sets in graphs. Electron. Notes Discret. Math. Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov
2005	J	`jnl`	Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bull. EATCS Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
2005	J	`jnl`	Subexponential parameterized algorithms on bounded-genus graphs and J. ACM Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2005	J	`jnl`	Tree decompositions with small cost. Discret. Appl. Math. Hans L. Bodlaender, Fedor V. Fomin
2004	C	`conf`	A 3-Approximation for the Pathwidth of Halin Graphs. CTW Fedor V. Fomin, Dimitrios M. Thilikos
2004	J	`jnl`	A 3-approximation for the pathwidth of Halin graphs. Electron. Notes Discret. Math. Fedor V. Fomin, Dimitrios M. Thilikos
2004	A	`conf`	A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS Fedor V. Fomin, Dimitrios M. Thilikos
2004	J	`jnl`	AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
2004	J	`jnl`	Algorithms for graphs with small octopus. Discret. Appl. Math. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2004	B	`conf`	Bidimensional Parameters and Local Treewidth. LATIN Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	J	`jnl`	Bidimensional Parameters and Local Treewidth. SIAM J. Discret. Math. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2004	J	`jnl`	Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory Fedor V. Fomin, Martín Matamala, Ivan Rapaport
2004	B	`conf`	Equitable Colorings of Bounded Treewidth Graphs. MFCS Hans L. Bodlaender, Fedor V. Fomin
2004	A*	`conf`	Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. ICALP Fedor V. Fomin, Dieter Kratsch, Ioan Todinca
2004	B	`conf`	Exact (Exponential) Algorithms for the Dominating Set Problem. WG Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
2004	A*	`conf`	Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. ICALP Fedor V. Fomin, Dimitrios M. Thilikos
2004	J	`jnl`	On distance constrained labeling of disk graphs. Theor. Comput. Sci. Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
2004	B	`conf`	Parallel Knock-Out Schemes in Networks. MFCS Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
2004	J	`jnl`	Radio Labeling with Preassigned Frequencies. SIAM J. Optim. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2004	J	`jnl`	Searching expenditure and interval graphs. Discret. Appl. Math. Fedor V. Fomin
2004	A*	`conf`	Subexponential parameterized algorithms on graphs of bounded-genus and SODA Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2003	B	`conf`	Backbone Colorings for Networks. WG Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2003	A	`conf`	Dominating Sets and Local Treewidth. ESA Fedor V. Fomin, Dimitrios M. Thilikos
2003	A*	`conf`	Dominating sets in planar graphs: branch-width and exponential speed-up. SODA Fedor V. Fomin, Dimitrios M. Thilikos
2003	A*	`conf`	Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
2003	B	`conf`	Graph Searching, Elimination Trees, and a Generalization of Bandwidth. FCT Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
2003	J	`jnl`	Interval degree and bandwidth of a graph. Discret. Appl. Math. Fedor V. Fomin, Petr A. Golovach
2003	J	`jnl`	On the Domination Search Number. Discret. Appl. Math. Fedor V. Fomin, Dieter Kratsch, Haiko Müller
2003	J	`jnl`	On the monotonicity of games generated by symmetric submodular functions. Discret. Appl. Math. Fedor V. Fomin, Dimitrios M. Thilikos
2003	J	`jnl`	Pathwidth of Planar and Line Graphs. Graphs Comb. Fedor V. Fomin
2002	J	`jnl`	Approximating minimum cocolorings. Inf. Process. Lett. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
2002	J	`jnl`	Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. Fedor V. Fomin, Andrzej Lingas
2002	J	`jnl`	Approximation of pathwidth of outerplanar graphs. J. Algorithms Hans L. Bodlaender, Fedor V. Fomin
2002	J	`jnl`	More About Subcolorings. Computing Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
2002	B	`conf`	More about Subcolorings. WG Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
2002	—	`conf`	Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2002	A	`conf`	Radio Labeling with Pre-assigned Frequencies. ESA Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2002	B	`conf`	The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG Fedor V. Fomin, Martín Matamala, Ivan Rapaport
2002	—	`conf`	Tree Decompositions with Small Cost. SWAT Hans L. Bodlaender, Fedor V. Fomin
2001	B	`conf`	Approximating Minimum Cocolourings. FCT Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
2001	B	`conf`	Approximation Algorithms for Time-Dependent Orienteering. FCT Fedor V. Fomin, Andrzej Lingas
2001	B	`conf`	Approximation of Pathwidth of Outerplanar Graphs. WG Fedor V. Fomin, Hans L. Bodlaender
2001	J	`jnl`	Bilateral Orientations and Domination. Electron. Notes Discret. Math. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
2001	B	`conf`	On the Monotonicity of Games Generated by Symmetric Submodular Functions. WG Fedor V. Fomin, Dimitrios M. Thilikos
2001	A	`conf`	Online and Offline Distance Constrained Labeling of Disk Graphs. ESA Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
2000	J	`jnl`	Graph Searching and Interval Completion. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach
2000	B	`conf`	On the Domination Search Number. WG Fedor V. Fomin, Dieter Kratsch, Haiko Müller
1999	J	`jnl`	Note on a Helicopter Search Problem on Graphs. Discret. Appl. Math. Fedor V. Fomin
1998	J	`jnl`	Helicopter Search Problems, Bandwidth and Pathwidth. Discret. Appl. Math. Fedor V. Fomin
1998	B	`conf`	Interval Completion with the Smallest Max-degree. WG Fedor V. Fomin, Petr A. Golovach