Fedor V. Fomin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
204
Venues
29
Active years
1998–2026
Best venue rank
A*
Where they publish
- AESA30 papers
- A*SODA30 papers
- A*ICALP29 papers
- ASTACS20 papers
- BWG19 papers
- BMFCS13 papers
- A*AAAI8 papers
- BISAAC6 papers
- BWADS6 papers
- A*STOC5 papers
- A*FOCS4 papers
- BLATIN4 papers
- NationalCOCOON4 papers
- BFCT4 papers
- NationalCSR3 papers
- A*PODC2 papers
- A*ICML2 papers
- NationalFUN2 papers
- CIWOCA2 papers
- BWAOA2 papers
- AAISTATS1 paper
- AECAI1 paper
- AGD1 paper
- BIJCNN1 paper
- A*LICS1 paper
- BCPM1 paper
- NationalFAW1 paper
- A*IJCAI1 paper
- CCOCOA1 paper
Papers
204 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Discounted Cuts: A Stackelberg Approach to Network Disruption. | Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov |
| 2026 | ESA | An FPT Algorithm for Diverse Minimum s-t Cuts. | Krishnan Dehaleesan, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2026 | ICALP | Clustering Permutations Under the Ulam Metric: A Parameterized Complexity Study. | Tian Bai, Fedor V. Fomin, Petr A. Golovach, Yash Hiren More, Simon Wietheger |
| 2026 | SODA | Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen |
| 2026 | SODA | Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2026 | SODA | ℋ-Planarity and Parametric Extensions: when Modulators Act Globally. | Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos |
| 2026 | STOC | What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing. | Llia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2026 | STOC | Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective. | Fedor V. Fomin, Petr A. Golovach, Nikola Jedlickov, Jan Kratochvl, Danil Sagunov, Kirill Simonov |
| 2026 | STACS | Line Cover and Related Problems. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana |
| 2025 | ESA | Fault-Tolerant Matroid Bases. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2025 | ESA | Edge Clique Partition and Cover Beyond Independence. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2025 | PODC | Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | SODA | Fixed-Parameter Tractability of Hedge Cut. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh |
| 2025 | STACS | Multivariate Exploration of Metric Dilation. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2025 | STACS | Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach |
| 2025 | WG | When Does FTP Become FPT? | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2024 | AISTATS | Structural perspective on constraint-based learning of Markov networks. | Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen |
| 2024 | ECAI | How to Guide a Present-Biased Agent Through Prescribed Tasks? | Tatiana Belova, Yuriy Dementiev, Fedor V. Fomin, Petr A. Golovach, Artur Ignatiev |
| 2024 | ESA | Cuts in Graphs with Matroid Constraints. | Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh |
| 2024 | ICALP | Two-Sets Cut-Uncut on Planar Graphs. | Matthias Bentert, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen |
| 2024 | ICALP | Computing Tree Decompositions with Small Independence Number. | Clment Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic |
| 2024 | PODC | Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. | Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2024 | SODA | Tree Containment Above Minimum Degree is FPT. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | ESA | Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. | Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo |
| 2023 | ESA | Kernelization for Spreading Points. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2023 | ESA | Lossy Kernelization for (Implicit) Hitting Set Problems. | Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stphan Thomass, Meirav Zehavi |
| 2023 | GD | Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. | Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper |
| 2023 | ICALP | Approximating Long Cycle Above Dirac's Guarantee. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2023 | ICALP | Compound Logics for Modification Problems. | Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2023 | ISAAC | Computing Paths of Large Rank in Planar Frameworks Deterministically. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
| 2023 | MFCS | FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana |
| 2023 | SODA | Shortest Cycles With Monotone Submodular Costs. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
| 2023 | SODA | Fixed-Parameter Tractability of Maximum Colored Path and Beyond. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis |
| 2023 | WADS | Socially Fair Matching: Exact and Approximation Algorithms. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov |
| 2023 | WG | Proportionally Fair Matching with Multiple Groups. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov |
| 2023 | WG | Parameterized Complexity of Broadcasting in Graphs. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2023 | WG | Turn's Theorem Through Algorithmic Lens. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | AAAI | How to Find a Good Explanation for Clustering? | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov |
| 2022 | AAAI | Inconsistent Planning: When in Doubt, Toss a Coin! | Yuriy Dementiev, Fedor V. Fomin, Artur Ignatiev |
| 2022 | CSR | Lossy Kernelization of Same-Size Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov |
| 2022 | ESA | Longest Cycle Above Erdős-Gallai Bound. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | ICALP | (Re)packing Equal Disks into Rectangle. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Meirav Zehavi |
| 2022 | IJCNN | Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. | Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer |
| 2022 | MFCS | Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | SODA | Algorithmic Extensions of Dirac's Theorem. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2022 | STOC | Fast FPT-approximation of branchwidth. | Fedor V. Fomin, Tuukka Korhonen |
| 2022 | STACS | Detours in Directed Graphs. | Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh |
| 2021 | AAAI | Present-Biased Optimization. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach |
| 2021 | ICALP | On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. | Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov |
| 2021 | ICML | Fixed-Parameter and Approximation Algorithms for PCA with Outliers. | Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2021 | LICS | Parameterized Complexity of Elimination Distance to First-Order Logic Properties. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2021 | MFCS | Parameterized Complexity of Feature Selection for Categorical Data Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
| 2021 | SODA | EPTAS for | Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2021 | STACS | Diverse Collections in Matroids and Graphs. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | WADS | Parameterized Complexity of Categorical Clustering with Size Constraints. | Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit |
| 2021 | WG | Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2020 | AAAI | Manipulating Districts to Win Elections: Fine-Grained Complexity. | Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2020 | AAAI | Time-Inconsistent Planning: Simple Motivation Is Hard to Find. | Fedor V. Fomin, Torstein J. F. Strmme |
| 2020 | CSR | On the Parameterized Complexity of the Expected Coverage Problem. | Fedor V. Fomin, Vijayaragunathan Ramamoorthi |
| 2020 | ESA | Kernelization of Whitney Switches. | Fedor V. Fomin, Petr A. Golovach |
| 2020 | ESA | Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. | Fedor V. Fomin, Petr A. Golovach |
| 2020 | ESA | On the Complexity of Recovering Incidence Matrices. | Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan |
| 2020 | ESA | An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. | Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2020 | ICALP | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. | Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi |
| 2020 | ISAAC | Diverse Pairs of Matchings. | Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov |
| 2020 | MFCS | Building Large k-Cores from Sparse Graphs. | Fedor V. Fomin, Danil Sagunov, Kirill Simonov |
| 2020 | SODA | Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2020 | STOC | Hitting topological minors is FPT. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2020 | WG | Knot Diagrams of Treewidth Two. | Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev |
| 2019 | ESA | Going Far From Degeneracy. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Path Contraction Faster Than 2 | Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale |
| 2019 | ICALP | Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Decomposition of Map Graphs with Applications. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICML | Refined Complexity of PCA with Outliers. | Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2019 | STACS | Modification to Planarity is Fixed Parameter Tractable. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2019 | WADS | Kernelization of Graph Hamiltonicity: Proper H-Graphs. | Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman |
| 2018 | ESA | On the Tractability of Optimization Problems on H-Graphs. | Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond |
| 2018 | ESA | On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2018 | ICALP | Parameterized Low-Rank Binary Matrix Approximation. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2017 | ICALP | Finding Detours is Fixed-Parameter Tractable. | Ivona Bezkov, Radu Curticapean, Holger Dell, Fedor V. Fomin |
| 2017 | ICALP | Covering Vectors by Spaces: Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | ICALP | Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2017 | MFCS | Structured Connectivity Augmentation. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2017 | SODA | Spanning Circuits in Regular Matroids. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | SODA | Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. | Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna |
| 2017 | STACS | Matrix Rigidity from the Viewpoint of Parameterized Complexity. | Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi |
| 2016 | FOCS | Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. | Fedor V. Fomin, Daniel Lokshtanov, Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
| 2016 | SODA | Subexponential parameterized algorithm for Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 2016 | SODA | Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. | Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala |
| 2016 | STOC | Exact algorithms via monotone local search. | Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh |
| 2016 | STACS | Kernelization and Sparseness: the Case of Dominating Set. | Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2016 | STACS | Editing to Connected f-Degree Graph. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh |
| 2016 | WG | Vertex Cover Structural Parameterization Revisited. | Fedor V. Fomin, Torstein J. F. Strmme |
| 2015 | CPM | Parameterized Complexity of Superstring Problems. | Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh |
| 2015 | FAW | Graph Modification Problems: A Modern Perspective. | Fedor V. Fomin, Saket Saurabh, Neeldhara Misra |
| 2015 | ICALP | Lower Bounds for the Graph Homomorphism Problem. | Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin |
| 2015 | ICALP | Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. | Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2015 | MFCS | Metric Dimension of Bounded Width Graphs. | Rmy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan |
| 2015 | SODA | Solving | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | ESA | A Subexponential Parameterized Algorithm for Proper Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 2014 | ESA | Representative Sets of Product Families. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2014 | ICALP | Parameterized Algorithms to Preserve Connectivity. | Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2014 | SODA | Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2014 | SODA | Large induced subgraphs via triangulations and CMSO. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2014 | STACS | Exploring Subexponential Parameterized Complexity of Completion Problems. | Pl Grns Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |
| 2013 | AAAI | Preventing Unraveling in Social Networks Gets Harder. | Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach |
| 2013 | ESA | Largest Chordal and Interval Subgraphs Faster Than 2 n. | Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |
| 2013 | ESA | Long Circuits and Large Euler Subgraphs. | Fedor V. Fomin, Petr A. Golovach |
| 2013 | ESA | Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. | Fedor V. Fomin, Michal Pilipczuk |
| 2013 | FOCS | An O(c^k n) 5-Approximation Algorithm for Treewidth. | Hans L. Bodlaender, Pl Grns Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
| 2013 | MFCS | On the Parameterized Complexity of Cutting a Few Vertices from a Graph. | Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen |
| 2013 | SODA | Jungles, bundles, and fixed parameter tractability. | Fedor V. Fomin, Michal Pilipczuk |
| 2013 | STACS | Tight bounds for Parameterized Complexity of Cluster Editing. | Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger |
| 2013 | STACS | Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2013 | STACS | Searching for better fill-in. | Fedor V. Fomin, Yngve Villanger |
| 2012 | ESA | A Polynomial Kernel for Proper Interval Vertex Deletion. | Fedor V. Fomin, Saket Saurabh, Yngve Villanger |
| 2012 | FOCS | Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2012 | FUN | To Satisfy Impatient Web Surfers Is Hard. | Fedor V. Fomin, Frdric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse |
| 2012 | FUN | Making Life Easier for Firefighters. | Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen |
| 2012 | ICALP | Minimizing Rosenthal Potential in Multicast Games. | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk |
| 2012 | LATIN | k-Gap Interval Graphs. | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
| 2012 | SODA | Bidimensionality and geometric graphs. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2012 | SODA | Linear kernels for (connected) dominating set on | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2012 | SODA | Subexponential parameterized algorithm for minimum fill-in. | Fedor V. Fomin, Yngve Villanger |
| 2012 | STACS | Parameterized Complexity of Connected Even/Odd Subgraph Problems. | Fedor V. Fomin, Petr A. Golovach |
| 2011 | ESA | Exact Algorithm for the Maximum Induced Planar Subgraph Problem. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2011 | SODA | Bidimensionality and EPTAS. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2011 | STACS | Hitting forbidden minors: Approximation and Kernelization. | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
| 2011 | WADS | Enumerating Minimal Subset Feedback Vertex Sets. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2010 | AAAI | Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | COCOON | The Curse of Connectivity: | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
| 2010 | CSR | Kernelization. | Fedor V. Fomin |
| 2010 | ESA | Fast Minor Testing in Planar Graphs. | Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos |
| 2010 | IWOCA | Ranking and Drawing in Subexponential Time. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
| 2010 | LATIN | Sharp Separation and Applications to Exact and Parameterized Algorithms. | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh |
| 2010 | SODA | Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2010 | SODA | Bidimensionality and Kernels. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
| 2010 | STACS | Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
| 2010 | STACS | Finding Induced Subgraphs via Minimal Triangulations. | Fedor V. Fomin, Yngve Villanger |
| 2010 | WAOA | Approximation Algorithms for Domination Search. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | COCOON | Algorithm for Finding | Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo |
| 2009 | ESA | Contraction Bidimensionality: The Accurate Picture. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | FOCS | (Meta) Kernelization. | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
| 2009 | ICALP | Counting Subgraphs via Homomorphisms. | Omid Amini, Fedor V. Fomin, Saket Saurabh |
| 2009 | ICALP | Distortion Is Fixed Parameter Tractable. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
| 2009 | IJCAI | Local Search: Is Brute-Force Avoidable? | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
| 2009 | ISAAC | A Linear Vertex Kernel for Maximum Internal Spanning Tree. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stphan Thomass |
| 2009 | IWOCA | Three Complexity Results on Coloring | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Danil Paulusma |
| 2009 | SODA | Clique-width: on the price of generality. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2009 | STACS | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
| 2009 | STACS | Approximating Acyclicity Parameters of Sparse Hypergraphs. | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2009 | WAOA | Guard Games on Graphs: Keep the Intruder Out! | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov |
| 2009 | WG | Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Danil Paulusma |
| 2009 | WG | An Exact Algorithm for Minimum Distortion Embedding. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2008 | ESA | Faster Steiner Tree Computation in Polynomial-Space. | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2008 | ICALP | Spanners in Sparse Graphs. | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
| 2008 | ICALP | Treewidth Computation and Extremal Combinatorics. | Fedor V. Fomin, Yngve Villanger |
| 2008 | ISAAC | How to Guard a Graph?. | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Mats Mihalk, Elias Vicari, Peter Widmayer |
| 2008 | LATIN | On the Complexity of Reconstructing H -free Graphs from Their Star Systems. | Fedor V. Fomin, Jan Kratochvl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle |
| 2008 | MFCS | A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
| 2008 | MFCS | Iterative Compression and Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
| 2008 | SODA | Catalan structures and dynamic programming in | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2007 | COCOA | On the Complexity of Some Colorful Problems Parameterized by Treewidth. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
| 2007 | COCOON | Improved Exact Algorithms for Counting 3- and 4-Colorings. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
| 2007 | COCOON | Counting Minimum Weighted Dominating Sets. | Fedor V. Fomin, Alexey A. Stepanov |
| 2007 | ICALP | Parameterized Algorithms for Directed Maximum Leaf Problems. | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh |
| 2007 | ICALP | Subexponential Parameterized Algorithms. | Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos |
| 2007 | WADS | Improved Algorithms for the Feedback Vertex Set Problems. | Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger |
| 2007 | WADS | Branch and Recharge: Exact Algorithms for Generalized Domination. | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvl, Dieter Kratsch, Mathieu Liedloff |
| 2007 | WG | Mixed Search Number and Linear-Width of Interval and Split Graphs. | Fedor V. Fomin, Pinar Heggernes, Rodica Mihai |
| 2006 | ESA | On Exact Algorithms for Treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
| 2006 | ISAAC | Branching and Treewidth Based Exact Algorithms. | Fedor V. Fomin, Serge Gaspers, Saket Saurabh |
| 2006 | MFCS | Optimal Linear Arrangement of Interval Graphs. | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov |
| 2006 | SODA | Measure and conquer: a simple O(2 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2005 | ESA | Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
| 2005 | FCT | Exact Algorithms for Graph Homomorphisms. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch |
| 2005 | ICALP | Measure and Conquer: Domination - A Case Study. | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch |
| 2005 | ISAAC | Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. | Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov |
| 2005 | MFCS | Nondeterministic Graph Searching: From Pathwidth to Treewidth. | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
| 2005 | WG | Computing Branchwidth Via Efficient Triangulations and Blocks. | Fedor V. Fomin, Frdric Mazoit, Ioan Todinca |
| 2004 | ICALP | Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. | Fedor V. Fomin, Dieter Kratsch, Ioan Todinca |
| 2004 | ICALP | Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2004 | LATIN | Bidimensional Parameters and Local Treewidth. | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2004 | MFCS | Equitable Colorings of Bounded Treewidth Graphs. | Hans L. Bodlaender, Fedor V. Fomin |
| 2004 | MFCS | Parallel Knock-Out Schemes in Networks. | Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger |
| 2004 | SODA | Subexponential parameterized algorithms on graphs of bounded-genus and | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2004 | STACS | A Simple and Fast Approach for Solving Problems on Planar Graphs. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2004 | WG | Exact (Exponential) Algorithms for the Dominating Set Problem. | Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger |
| 2003 | ESA | Dominating Sets and Local Treewidth. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2003 | FCT | Graph Searching, Elimination Trees, and a Generalization of Bandwidth. | Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle |
| 2003 | ICALP | Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
| 2003 | SODA | Dominating sets in planar graphs: branch-width and exponential speed-up. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2003 | WG | Backbone Colorings for Networks. | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
| 2002 | ESA | Radio Labeling with Pre-assigned Frequencies. | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
| 2002 | WG | More about Subcolorings. | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
| 2002 | WG | The Complexity of Approximating the Oriented Diameter of Chordal Graphs. | Fedor V. Fomin, Martn Matamala, Ivan Rapaport |
| 2001 | ESA | Online and Offline Distance Constrained Labeling of Disk Graphs. | Jir Fiala, Aleksei V. Fishkin, Fedor V. Fomin |
| 2001 | FCT | Approximating Minimum Cocolourings. | Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli |
| 2001 | FCT | Approximation Algorithms for Time-Dependent Orienteering. | Fedor V. Fomin, Andrzej Lingas |
| 2001 | WG | Approximation of Pathwidth of Outerplanar Graphs. | Fedor V. Fomin, Hans L. Bodlaender |
| 2001 | WG | On the Monotonicity of Games Generated by Symmetric Submodular Functions. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2000 | WG | On the Domination Search Number. | Fedor V. Fomin, Dieter Kratsch, Haiko Mller |
| 1998 | WG | Interval Completion with the Smallest Max-degree. | Fedor V. Fomin, Petr A. Golovach |