I am a professor in Algorithms at the University of Bergen. My research area is Theoretical Computer Science, and my current research interests are in Graph Algorithms, Parameterized Complexity, Algorithmic Fairness, Algorithmic Foundations of Machine Learning, and Combinatorial Games. I am a member of the Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, the Academia Europaea, and a Fellow of the ACM and the EATCS.  

Open acess publications in arXiv.

Books (with links to free downloads)

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi, Kernelization. Theory of Parameterized Preprocessing, Cambridge University Press, 2019. Amazon link. Free downloadable version and errata are available from  here.

Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh, Parameterized Algorithms, Springer, 2015. Amazon link. Free downloadable version and errata are available from  here.

Fedor V. Fomin and Dieter Kratsch, Exact Exponential Algorithms, Springer, 2010. Amazon link. Free downloadable version and errata are available from  here.

 

 

The following list of publications is automatically generated from the Norwegian national database CRIStin. 

 

Academic article

• Bandyapadhyay, Sayan; Fomin, Fedor; Simonov, Kirill (2024). On coresets for fair clustering in metric and Euclidean spaces and their applications. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay et al. (2024). FPT approximation and subexponential algorithms for covering few or many edges. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2024). Parameterized complexity of broadcasting in graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Jaffke, Lars et al. (2024). Diverse Pairs of Matchings. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay et al. (2024). (Re)packing Equal Disks into Rectangle. (external link)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2024). Approximating Long Cycle Above Dirac’s Guarantee. (external link)
• Bentert, Matthias; Drange, Pål Grønås; Fomin, Fedor et al. (2024). Two-Sets Cut-Uncut on Planar Graphs. (external link)
• Fomin, Fedor; Korhonent, Tuukka (2024). FAST FPT-APPROXIMATION OF BRANCHWIDTH. (external link)
• Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre et al. (2023). Detours in directed graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2023). Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. (external link)
• Fomin, Fedor; Sagunov, Danil; Simonov, Kirill (2023). Building large k-cores from sparse graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos et al. (2023). An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. (external link)
• Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (2023). Parameterized complexity of categorical clustering with size constraints. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2023). Diverse collections in matroids and graphs. (external link)
• Bentert, Matthias; Drange, Pål Grønås; Fomin, Fedor et al. (2023). Two-sets cut-uncut on planar graphs. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2023). Lossy Kernelization of Same-Size Clustering. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2023). Kernelization for Spreading Points. (external link)
• Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka Matias Aleksanteri et al. (2023). Computing Paths of Large Rank in Planar Frameworks Deterministically. (external link)
• Arrighi, Emmanuel Jean Paul Pierre; Fomin, Fedor; Golovach, Petr et al. (2023). Kernelizing Temporal Exploration Problems. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2023). FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2023). Parameterized Complexity of Feature Selection for Categorical Data Clustering. (external link)
• Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka et al. (2023). Fixed-Parameter Tractability of Maximum Colored Path and Beyond. (external link)
• Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka Matias Aleksanteri et al. (2023). Shortest Cycles With Monotone Submodular Costs. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2023). Parameterized Complexity of Broadcasting in Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2023). Turán's Theorem Through Algorithmic Lens. (external link)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2023). Approximating Long Cycle Above Dirac's Guarantee. (external link)
• Fomin, Fedor; Golovach, Petr; Sau, Ignasi et al. (2023). Compound Logics for Modification Problems. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2023). How to find a good explanation for clustering?. (external link)
• Fomin, Fedor; Korhonen, Tuukka (2022). Fast FPT-approximation of branchwidth. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2022). (Re)packing Equal Disks into Rectangle. (external link)
• Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre et al. (2022). Detours in Directed Graphs. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). How to Find a Good Explanation for Clustering?. (external link)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2022). Algorithmic Extensions of Dirac's Theorem. (external link)
• Fomin, Fedor; Panolan, Fahad; Patil, Anurag et al. (2022). Boolean and Fp-Matrix Factorization: From Theory to Practice. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2022). Exact Exponential Algorithms for Clustering Problems. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). FPT Approximation for Fair Minimum-Load Clustering. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Marx, Dániel et al. (2022). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). Lossy Kernelization of Same-Size Clustering. (external link)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2022). Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2022). Parameterized Complexity of Elimination Distance to First-Order Logic Properties. (external link)
• Fomin, Fedor; Golovach, Petr; Sagunov, Danil et al. (2022). Longest Cycle Above Erdös-Gallai Bound. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2022). Present-biased optimization. (external link)
• Fomin, Fedor; Panolan, Fahad; Ramanujan, M.S. et al. (2022). On the optimality of pseudo-polynomial algorithms for integer programming. (external link)
• Fomin, Fedor; Ramamoorthi, Vijayaragunathan (2022). On the Parameterized Complexity of the Expected Coverage Problem. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2021). ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs . (external link)
• Fomin, Fedor; Golovach, Petr (2021). Kernelization of Whitney Switches. (external link)
• Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (2021). Parameterized Complexity of Categorical Clustering with Size Constraints. (external link)
• Chaplick, Steven; Fomin, Fedor; Golovach, Petr et al. (2021). Kernelization of Graph Hamiltonicity: Proper H-Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2021). Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2021). Diverse Collections in Matroids and Graphs. (external link)
• Eiben, Eduard; Fomin, Fedor; Golovach, Petr et al. (2021). EPTAS for k-means Clustering of Affine Subspaces. (external link)
• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2021). Parameterized Complexity of Feature Selection for Categorical Data Clustering. (external link)
• Fomin, Fedor; Golovach, Petr (2021). Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Simonov, Kirill (2021). Parameterized k-Clustering: Tractability island. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Golovach, Petr (2021). Present-Biased Optimization. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2021). Parameterized Complexity of Elimination Distance to First-Order Logic Properties. (external link)
• Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay Nitin et al. (2021). ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. (external link)
• Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre et al. (2021). Parameterized Complexity of Directed Spanner Problems. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Mihajlin, Ivan et al. (2021). Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. (external link)
• Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (2020). On the Tractability of Optimization Problems on H-Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Lochet, William et al. (2020). Parameterized Complexity of Directed Spanner Problems. (external link)
• Fomin, Fedor; Golovach, Petr; Jaffke, Lars et al. (2020). Diverse Pairs of Matchings. (external link)
• Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel et al. (2020). Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. (external link)
• Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel et al. (2020). Path contraction faster than $2^n$. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2020). Bidimensionality and Kernels. (external link)
• Fomin, Fedor; Golovach, Petr (2020). Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2020). Going Far from Degeneracy. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2020). Low-Rank Binary Matrix Approximation in Column-Sum Norm. (external link)
• Fomin, Fedor; Golovach, Petr (2020). Kernelization of Whitney Switches. (external link)
• Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos et al. (2020). An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. (external link)
• Fomin, Fedor; Golovach, Petr; Misra, Pranabendu et al. (2020). On the Complexity of Recovering Incidence Matrices. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad (2020). Parameterized low-rank binary matrix approximation. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2020). Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2020). Hitting Topological Minors Is FPT. (external link)
• Fomin, Fedor; Strømme, Torstein J. F. (2020). Time-Inconsistent Planning: Simple Motivation Is Hard to Find. (external link)
• Fomin, Fedor; Ramamoorthi, Vijayaragunathan (2020). On the parameterized complexity of the expected coverage problem. (external link)
• Bodlaender, Hans L.; Burton, Benjamin; Fomin, Fedor et al. (2020). Knot Diagrams of Treewidth Two. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2020). ETH-tight algorithms for long path and cycle on unit disk graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Simonov, Kirill (2020). Parameterized complexity of PCA. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2020). Parameterization Above a Multiplicative Guarantee . (external link)
• Fomin, Fedor; Golovach, Petr; Strømme, Torstein J. F. et al. (2020). Subgraph Complementation. (external link)
• Alambardar Meybodi, Mohsen; Fomin, Fedor; Mouawad, Amer E. et al. (2020). On the parameterized complexity of [1,j]-domination problems. (external link)
• Fomin, Fedor; Sagunov, Danil; Simonov, Kirill (2020). Building large k-cores from sparse graphs. (external link)
• Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel et al. (2019). Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. (external link)
• Fomin, Fedor; Pilipczuk, Michal (2019). On width measures and topological problems on semi-complete digraphs. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2019). Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Spanning circuits in regular matroids. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2019). On the parameterized complexity of graph modification to first-order logic properties. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Going Far From Degeneracy. (external link)
• Fomin, Fedor; Golovach, Petr; Simonov, Kirill (2019). Parameterized k-Clustering: Tractability Island. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2019). Refined Complexity of PCA with Outliers. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Approximation Schemes for Low-rank Binary Matrix Approximation Problems. (external link)
• Chaplick, Steven; Fomin, Fedor; Golovach, Petr et al. (2019). Kernelization of graph hamiltonicity: Proper H-graphs. (external link)
• Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel et al. (2019). Path Contraction Faster Than 2n. (external link)
• Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel et al. (2019). Exact algorithms via monotone local search. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2019). Decomposition of map graphs with applications. (external link)
• Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel et al. (2019). Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. (external link)
• Curticapean, Radu; Dell, Holger; Fomin, Fedor et al. (2019). A Fixed-Parameter Perspective on #BIS. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2019). Editing to connected F-degree graph. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M (2019). Modification to planarity is fixed parameter tractable. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2019). Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. (external link)
• Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (2018). On the tractability of optimization problems on H-graphs. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket (2018). Excluded grid minors and efficient polynomial-time approximation schemes. (external link)
• Curticapean, Radu; Dell, Holger; Fomin, Fedor et al. (2018). A Fixed-Parameter Perspective on #BIS. (external link)
• Carpenter, Timothy; Fomin, Fedor; Lokshtanov, Daniel et al. (2018). Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2018). Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2018). Long directed (s,t)-path: FPT algorithm. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2018). Kernels for (Connected) dominating set on graphs with excluded topological minors. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad et al. (2018). Matrix rigidity from the viewpoint of parameterized complexity . (external link)
• Fomin, Fedor; Golovach, Petr; Strømme, Torstein J. et al. (2018). Partial Complementation of Graphs. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2018). Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. (external link)
• Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin et al. (2018). Subexponential parameterized algorithm for interval completion. (external link)
• Ashok, Pradeesha; Fomin, Fedor; Kolay, Sudeshna et al. (2018). Exact algorithms for terrain guarding. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad (2018). Parameterized low-rank binary matrix approximation. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2018). Covering Vectors by Spaces: Regular Matroids. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2018). Structured connectivity augmentation. (external link)
• Fomin, Fedor; Saurabh, Saket (2018). Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. (external link)
• Fomin, Fedor; Panolan, Fahad; Ramanujan, MS et al. (2018). On the optimality of pseudo-polynomial algorithms for integer programming. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad et al. (2017). Matrix rigidity from the viewpoint of parameterized complexity. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2017). Representative families of product families. (external link)
• Fomin, Fedor; Liedloff, Mathieu; Montealegre, Pedro et al. (2017). Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. (external link)
• Bezakova, Ivona; Curticapean, Radu; Dell, Holger et al. (2017). Finding detours is fixed-parameter tractable. (external link)
• Belmonte, Remy; Fomin, Fedor; Golovach, Petr et al. (2017). Metric Dimension of Bounded Tree-length Graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2017). Structured Connectivity Augmentation. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2017). Spanning Circuits in Regular Matroids. (external link)
• Ashok, Pradeesha; Fomin, Fedor; Kolay, Sudeshna et al. (2017). Exact algorithms for terrain guarding. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2017). Covering vectors by spaces: Regular matroids. (external link)
• Chitnis, Rajesh; Fomin, Fedor; Lokshtanov, Daniel et al. (2017). Faster exact algorithms for some terminal set problems. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2017). Finding, hitting and packing cycles in subexponential time on unit disk graphs. (external link)
• Cygan, Marek; Fomin, Fedor; Golovnev, Alexander et al. (2017). Tight lower bounds on graph embedding problems. (external link)
• Bliznets, Ivan; Fomin, Fedor; Golovach, Petr et al. (2016). Parameterized Complexity of Superstring Problems. (external link)
• Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr (2016). Parameterized complexity of the anchored k-core problem for directed graphs. (external link)
• Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel et al. (2016). Subexponential algorithms for rectilinear Steiner tree and arborescence problems. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2016). Efficient computation of representative families with applications in parameterized and exact algorithms. (external link)
• Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel et al. (2016). Exact algorithms via monotone local search. (external link)
• Fomin, Fedor; Golovach, Petr; Karpov, Nikolay et al. (2016). Parameterized complexity of secluded connectivity problems. (external link)
• Fomin, Fedor; Strømme, Torstein J. (2016). Vertex cover structural parameterization revisited. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Marx, Dániel et al. (2016). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. (external link)
• Bodlaender, Hans L.; Fomin, Fedor; Lokshtanov, Daniel et al. (2016). (Meta) Kernelization. (external link)
• Fomin, Fedor; Golovach, Petr; Panolan, Fahad et al. (2016). Editing to connected f-degree graph. (external link)
• Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus Sortland et al. (2016). A $c^k n$ 5-approximation algorithm for treewidth. (external link)
• Abramovskaya, Tatjana V.; Fomin, Fedor; Golovach, Petr et al. (2016). How to hunt an invisible rabbit on a graph. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara et al. (2016). Hitting forbidden minors: Approximation and kernelization. (external link)
• Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan (2016). The Firefighter problem on graph classes. (external link)
• Drange, Pål Grønås; Dregi, Markus Sortland; Fomin, Fedor et al. (2016). Kernelization and sparseness: The case of dominating set. (external link)
• Fomin, Fedor; Todinca, Ioan; Villanger, Yngve (2015). Large induced subgraphs via triangulations and CMSO. (external link)
• Fernau, Henning; Fomin, Fedor; Philip, Geevarghese et al. (2015). On the parameterized complexity of vertex cover and edge cover with connectivity constraints. (external link)
• Fomin, Fedor; Golovach, Petr; Nederlof, Jesper et al. (2015). Minimizing Rosenthal potential in multicast games. (external link)
• Fomin, Fedor; Giannopoulou, Archontia; Pilipczuk, Michal Pawel (2015). Computing tree-depth faster than 2n. (external link)
• Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel et al. (2015). Largest chordal and interval subgraphs faster than 2n. (external link)
• Drange, Pål Grønås; Fomin, Fedor; Pilipczuk, Michal Pawel et al. (2015). Exploring the subexponential complexity of completion problems. (external link)
• Fomin, Fedor; Golovach, Petr; Karpov, Nikolay et al. (2015). Parameterized complexity of secluded connectivity problems. (external link)
• Belmonte, Remy; Fomin, Fedor; Golovach, Petr et al. (2015). Metric dimension of bounded width graphs. (external link)
• Bliznets, Ivan; Fomin, Fedor; Golovach, Petr et al. (2015). Parameterized complexity of superstring problems. (external link)
• Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin et al. (2015). A subexponential parameterized algorithm for proper interval completion. (external link)
• Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel et al. (2015). Parameterized single-exponential time polynomial space algorithm for steiner tree. (external link)
• Fomin, Fedor; Saurabh, Saket; Misra, Neeldhara (2015). Graph modification problems: A modern perspective. (external link)
• Fomin, Fedor; Golovnev, Alexander; Kulikov, Alexander S. et al. (2015). Lower bounds for the graph homomorphism problem. (external link)
• Fomin, Fedor; Golovach, Petr (2014). Parameterized complexity of connected even/odd subgraph problems. (external link)
• Fomin, Fedor; Jansen, Bart Maarten Paul; Pilipczuk, Michal Pawel (2014). Preprocessing subgraph and minor problems: When does a small vertex cover help?. (external link)
• Bazgan, Cristina; Chopin, Morgan; Cygan, Marek et al. (2014). Parameterized complexity of firefighting. (external link)
• Fomin, Fedor; Kratsch, Stefan; Pilipczuk, Marcin et al. (2014). Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. (external link)
• Fomin, Fedor; Giroire, Frédéric; Jean-Marie, Alain et al. (2014). To satisfy impatient Web surfers is hard. (external link)
• Drange, Pål Grønås; Fomin, Fedor; Pilipczuk, Michal Pawel et al. (2014). Exploring subexponential parameterized complexity of completion problems. (external link)
• Fomin, Fedor; Golovach, Petr (2014). Long circuits and large euler subgraphs. (external link)
• Fomin, Fedor; Villanger, Yngve (2014). Searching for better fill-in. (external link)
• Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter et al. (2014). Enumerating minimal subset feedback vertex sets. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2014). Almost optimal lower bounds for problems parameterized by clique-width. (external link)
• Basavaraju, Manu; Fomin, Fedor; Golovach, Petr et al. (2014). Connecting vertices by independent trees. (external link)
• Basavaraju, Manu; Fomin, Fedor; Golovach, Petr et al. (2014). Parameterized algorithms to preserve connectivity. (external link)
• Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel et al. (2014). Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. (external link)
• Fomin, Fedor; Liedloff, Mathieu; Montealegre, Pedro et al. (2014). Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad et al. (2014). Representative sets of product families. (external link)
• Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin et al. (2014). A subexponential parameterized algorithm for proper interval completion. (external link)
• Fomin, Fedor; Villanger, Yngve (2013). Subexponential parameterized algorithm for minimum fill-in. (external link)
• Dorn, Frederic ; Fomin, Fedor; Lokshtanov, Daniel et al. (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. (external link)
• Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus Sortland et al. (2013). An O(c^k n) 5-approximation algorithm for treewidth. (external link)
• Fomin, Fedor; Saurabh, Saket; Villanger, Yngve (2013). A polynomial kernel for proper interval vertex deletion. (external link)
• Fomin, Fedor; Pilipczuk, Michal Pawel (2013). Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. (external link)
• Blizniets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel et al. (2013). Largest chordal and interval subgraphs faster than 2^n. (external link)
• Fomin, Fedor; Giannopoulou, Archontia; Pilipczuk, Michal Pawel (2013). Computing tree-depth faster than 2^n. (external link)
• Fomin, Fedor; Pilipczuk, Michal Pawel (2013). Jungles, bundles, and fixed parameter tractability. (external link)
• Fomin, Fedor; Kratsch, Stefan; Pilipczuk, Marcin et al. (2013). Tight bounds for parameterized complexity of Cluster Editing. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara et al. (2013). Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. (external link)
• Broersma, Hajo; Fomin, Fedor; Golovach, Petr et al. (2013). Three complexity results on coloring Pk-free graphs. (external link)
• Broersma, Hajo; Fomin, Fedor; van 't Hof, Pim et al. (2013). Exact algorithms for finding longest cycles in claw-free graphs. (external link)
• Fomin, Fedor; Gaspers, Serge; Saurabh, Saket et al. (2013). A linear vertex kernel for maximum internal spanning tree. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter et al. (2013). Computing optimal Steiner trees in polynomial space. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Lokshtanov, Daniel et al. (2012). Sharp separation and applications to exact and parameterized algorithms. (external link)
• Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M. C. A. et al. (2012). A note on exact algorithms for vertex ordering problems on graphs. (external link)
• Dorn, Frederic ; Fomin, Fedor; Thilikos, Dimitrios M. (2012). Catalan structures and dynamic programming in H-minor-free graphs. (external link)
• Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan (2012). Making Life Easier for Firefighters. (external link)
• Fomin, Fedor; Golovach, Petr; Pralat, Pawel (2012). Cops and robber with constraints. (external link)
• Amini, Omid; Fomin, Fedor; Saurabh, Saket (2012). Counting subgraphs via homomorphisms. (external link)
• Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor et al. (2012). Fast minor testing in planar graphs. (external link)
• Bodlaender, Hans L.; Fomin, Fedor; Golovach, Petr et al. (2012). Parameterized complexity of the spanning tree congestion problem. (external link)
• Fomin, Fedor; Villanger, Yngve (2012). Treewidth computation and extremal combinatorics. (external link)
• Fellows, Michael R.; Fomin, Fedor; Lokshtanov, Daniel et al. (2012). Local search: Is brute-force avoidable?. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh et al. (2012). Faster algorithms for finding and counting subgraphs. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel (2012). Cops and robber game without recharging. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara et al. (2012). Planar F-deletion: Approximation, kernelization and optimal FPT algorithms (extended abstract). (external link)
• Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor et al. (2012). Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. (external link)
• Fomin, Fedor; Saurabh, Saket; Villanger, Yngve (2012). A Polynomial Kernel for Proper Interval Vertex Deletion. (external link)
• Fomin, Fedor; Villanger, Yngve (2012). Subexponential parameterized algorithm for minimum fill-in. (external link)
• Fomin, Fedor; Gaspers, Serge; Golovach, Petr et al. (2012). k-Gap Interval Graphs. (external link)
• Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M. C. A. et al. (2012). On exact algorithms for treewidth. (external link)
• Fomin, Fedor; Golovach, Petr; Nederlof, Jesper et al. (2012). Minimizing Rosenthal potential in multicast games. (external link)
• Fomin, Fedor; Jansen, Bart M.P.; Pilipczuk, Michal Pawel (2012). Preprocessing subgraph and minor problems: when does a small vertex cover help?. (external link)
• Barrière, Lali; Flocchini, Paola; Fomin, Fedor et al. (2012). Connected graph searching. (external link)
• Fomin, Fedor; Todinca, Ioan; Villanger, Yngve (2011). Exact Algorithm for the Maximum Induced Planar Subgraph Problem. (external link)
• Fomin, Fedor; Geevarghese, Philip; Villanger, Yngve (2011). Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. (external link)
• Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor et al. (2011). Faster parameterized algorithms for minor containment. (external link)
• Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter et al. (2011). Enumerating minimal subset feedback vertex sets. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket (2011). An exact algorithm for minimum distortion embedding. (external link)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan et al. (2011). Branch and Recharge: Exact Algorithms for Generalized Domination. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2011). Contraction obstructions for treewidth. (external link)
• Fomin, Fedor; Golovach, Petr; van Leeuwen, Erik Jan (2011). Spanners of bounded degree graphs. (external link)
• Fomin, Fedor; Saurabh, Saket; Thilikos, Dimitrios M. (2011). Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. (external link)
• Fellows, Michael R.; Fomin, Fedor; Lokshtanov, Daniel et al. (2011). On the complexity of some colorful problems parameterized by treewidth. (external link)
• Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr (2011). Approximation of minimum weight spanners for sparse graphs. (external link)
• Bessy, Stephane; Fomin, Fedor; Gaspers, Serge et al. (2011). Kernels for feedback arc set in tournaments. (external link)
• Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr (2011). Spanners in sparse graphs. (external link)
• Fomin, Fedor; Golovach, Petr A.; Thilikos, Dimitrios M. (2011). Approximation Algorithms for Domination Search. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel (2011). Guard games on graphs: Keep the intruder out!. (external link)
• Fomin, Fedor; Golovach, Petr; Hall, Alex et al. (2011). How to Guard a Graph?. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh et al. (2011). Subexponential algorithms for partial cover problems. (external link)
• Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel et al. (2011). On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. (external link)
• Amini, Omid; Fomin, Fedor; Saurabh, Saket (2011). Implicit branching and parameterized partial cover problems. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (2011). Approximating width parameters of hypergraphs with excluded minors. (external link)
• Fomin, Fedor (2010). Protrusions in Graphs and Their Applications. (external link)
• Fomin, Fedor; Villanger, Yngve (2010). Finding Induced Subgraphs via Minimal Triangulations. (external link)
• Fomin, Fedor (2010). Kernelization. (external link)
• Dorn, Frederic ; Penninkx, Eelko; Bodlaender, Hans L. et al. (2010). Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. (external link)
• Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica (2010). Mixed Search Number and Linear-Width of Interval and Split Graphs. (external link)
• Fomin, Fedor; Gaspers, Serge; Kratsch, Dieter et al. (2010). Iterative compression and exact algorithms. (external link)
• Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor et al. (2010). Faster Parameterized Algorithms for Minor Containment. (external link)
• Dorn, Frederic ; Fomin, Fedor; Lokshtanov, Daniel et al. (2010). Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. (external link)
• Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor et al. (2010). Fast Minor Testing in Planar Graphs. (external link)
• Cohen, Nathann; Fomin, Fedor; Gutin, Gregory et al. (2010). Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. (external link)
• Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel et al. (2010). Intractability of clique-width parameterizations. (external link)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan et al. (2010). Pursuing a fast robber on a graph. (external link)
• Broersma, Hajo; Fomin, Fedor; van 't Hof, Pim et al. (2010). Fast exact algorithms for Hamiltonicity in claw-free graphs. (external link)
• Fomin, Fedor; Oum, SI; Thilikos, DM (2010). Rank-width and tree-width of H-minor-free graphs. (external link)
• Fomin, Fedor; Gaspers, S; Golovach, PA et al. (2010). Parameterized algorithm for eternal vertex cover. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas (2009). Nondeterministic Graph Searching: From Pathwidth to Treewidth. (external link)
• Fomin, Fedor; Gaspers, Serge; Saurabh, Saket et al. (2009). On two techniques of combining branching and treewidth. (external link)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan et al. (2009). Sort and Search: Exact algorithms for generalized domination. (external link)
• Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica (2009). Mixed search number and linear-width of interval and split graphs. (external link)
• Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel et al. (2009). Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket (2009). An Exact Algorithm for Minimum Distortion Embedding. (external link)
• Fellows, Michael; Fomin, Fedor; Lokshtanov, Daniel et al. (2009). Distortion Is Fixed Parameter Tractable. (external link)
• Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh et al. (2009). Subexponential Algorithms for Partial Cover Problems. (external link)
• Bessy, Stephane; Fomin, Fedor; Gaspers, Serge et al. (2009). Kernels for Feedback Arc Set In Tournaments. (external link)
• Cohen, Nathann; Fomin, Fedor; Gutin, Gregory et al. (2009). Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. (external link)
• Fomin, Fedor; Mazoit, Frederic; Todinca, Ioan (2009). Computing branchwidth via efficient triangulations and blocks. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios (2009). Approximating Acyclicity Parameters of Sparse Hypergraphs. (external link)
• Fomin, Fedor; Gaspers, Serge; Saurabh, Saket et al. (2009). A Linear Vertex Kernel for Maximum Internal Spanning Tree. (external link)
• Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios (2009). Contraction Bidimensionality: The Accurate Picture. (external link)
• Amini, Omid; Fomin, Fedor; Saurabh, Saket (2009). Counting Subgraphs via Homomorphisms. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2009). A measure & conquer approach for the analysis of exact algorithms. (external link)
• Broersma, Hajo; Fomin, Fedor; Golovach, Petr et al. (2009). Three Complexity Results on Coloring Pk-Free Graphs. (external link)
• Alon, Noga; Fomin, Fedor; Gutin, Gregory et al. (2008). Spanning directed trees with many leaves. (external link)
• Fomin, Fedor; Thilikos, Dimitrios M. (2008). An annotated bibliography on guaranteed graph searching. (external link)
• Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios (2008). Subexponential parameterized algorithms. (external link)
• Fomin, Fedor; Villanger, Yngve (2008). Treewidth Computation and Extremal Combinatorics. (external link)
• Fomin, Fedor; Gaspers, Serge; Kratsch, Dieter et al. (2008). Iterative Compression and Exact Algorithms. (external link)
• Dragan, Feodor; Fomin, Fedor; Golovach, Petr (2008). Spanners in sparse graphs. (external link)
• Dragan, Feodor; Fomin, Fedor; Golovach, Petr (2008). A PTAS for the sparsest spanners problem on apex-minor-free graphs. (external link)
• Fomin, Fedor; Golovach, Petr; Hall, Alex et al. (2008). How to guard a graph?. (external link)
• Fomin, Fedor; Golovach, Petr; Kratochvil, Jan (2008). On tractability cops and robbers game. (external link)
• Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel et al. (2008). On the complexity of reconstructing H-free graphs from their Star Systems. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V et al. (2008). Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2008). Faster Steiner Tree Computation in Polynomial-Space. (external link)
• Chen, Jianer; Fomin, Fedor; Liu, Yang et al. (2008). Improved algorithms for feedback vertex set problems. (external link)
• Fomin, Fedor; Kratsch, Dieter; Todinca, Ioan et al. (2008). Exact algorithms for treewidth and minimum fill-in. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2008). Solving connected dominating set faster than 2(n). (external link)
• Amini, Omid; Fomin, Fedor; Saurabh, Saket (2008). Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). (external link)
• Fomin, Fedor; Gaspers, Serge; Pyatkin, Artem V et al. (2008). On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. (external link)
• Broersma, Hajo; Fomin, Fedor; Golovach, Petr et al. (2007). Backbone colorings for graphs: Tree and path backbones. (external link)
• Fomin, Fedor; Thilikos, Dimitrios M. (2007). On self duality of pathwidth in polyhedral graph embeddings. (external link)
• Fomin, Fedor; Heggernes, Pinar; Kratschz, Dieter (2007). Exact algorithms for graph homomorphisms. (external link)
• Fomin, Fedor; Gaspers, Serge; Saurabh, Saket (2007). Improved Exact Algorithms for Counting 3- and 4-Colorings. (external link)
• Chen, Jianer; Fomin, Fedor; Liu, Yang et al. (2007). Improved Algorithms for the Feedback Vertex Set Problems. (external link)
• Alon, Noga; Fomin, Fedor; Gutin, Gregory et al. (2007). Better Algorithms and Bounds for Directed Maximum Leaf Problems. (external link)
• Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios (2007). Subexponential Parameterized Algorithms. (external link)
• Alon, Noga; Fomin, Fedor; Gutin, Gregory et al. (2007). Parameterized Algorithms for Directed Maximum Leaf Problems. (external link)
• Golovach, Petr; Fomin, Fedor; Kratochvil, Jan et al. (2007). Branch and Recharge: Exact Algorithms for Generalized Domination. (external link)
• Broersma, Hajo; Fomin, Fedor; Kralovic, Rastislav et al. (2007). Eliminating graphs by means of parallel knock-out schemes. (external link)
• Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica Georgeta (2007). Mixed search number and linear-width of interval and split graphs. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2006). Solving Connected Dominating Set Faster than O(2n). (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2006). Dominating sets in planar graphs: Branch-width and exponential speed-up. (external link)
• Fomin, Fedor; Gaspers, Serge; Pyatkin, Artem V (2006). Finding a Minimum Feedback Vertex Set in time O(1.7548n). (external link)
• Fomin, Fedor; Gaspers, Serge; Saurabh, Saket (2006). Branching and treewidth based exact algorithms. (external link)
• Bodlaender, Hans; Fomin, Fedor; Koster, Arie M. C. A. et al. (2006). On exact algorithms for treewidth. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2006). A 3-approximation for the pathwidth of Halin graphs. (external link)
• Cohen, Johanne; Fomin, Fedor; Heggernes, Pinar et al. (2006). Optimal linear arrangement of interval graphs. (external link)
• Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios M. (2006). Fast subexponential algorithm for non-local problems on graphs of bounded genus. (external link)
• Fomin, Fedor; Høie, Kjartan (2006). Pathwidth of cubic graphs and exact algorithms. (external link)
• Broersma, Hajo; Fomin, Fedor; Kratochvil, Jan et al. (2006). Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. (external link)
• Fomin, Fedor; Thilikos, Dimitrios M. (2006). New upper bounds on the decomposability of planar graphs. (external link)
• Bodlaender, Hans; Fomin, Fedor (2005). Tree decompositions with small cost. (external link)
• Demaine, Erik D.; Fomin, Fedor; Hajiaghayi, Mohammad Taghi et al. (2005). Bidimensional parameters and local treewidth. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V et al. (2005). Bounding the number of minimal dominating sets: A measure and conquer approach. (external link)
• Fomin, Fedor; Mazoit, Frederic; Todinca, Ioan (2005). Computing branchwidth via efficient triangulations and blocks. (external link)
• Demaine, Eric; Fomin, Fedor; Hajiaghayi, MohammadTaghi et al. (2005). Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. (external link)
• Demaine, Erik D.; Fomin, Fedor; Hajiaghayi, MohammadTaghi et al. (2005). Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas (2005). Nondeterministic Graph Searching: From Pathwidth to Treewidth. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2005). Measure and conquer: Domination - A case study. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V et al. (2005). On maximum number of minimal dominating sets in graphs. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2005). Some new techniques in design and analysis of exact (exponential) algorithms. (external link)
• Fomin, Fedor; Thilikos, Dimitrios; Todinca, Ioan (2005). Connected Graph Searching in Outerplanar Graphs. (external link)
• Bodlaender, Hans; Fomin, Fedor (2005). Equitable colorings of bounded treewidth graphs. (external link)
• Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter (2005). Exact algorithms for graph homomorphisms. (external link)
• Dorn, Frederic Bernard; Penninkx, Elko; Bodlaender, Hans et al. (2005). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. (external link)
• Bodlaender, Hans; Fomin, Fedor (2004). Equitable colorings of bounded treewidth graphs. (external link)
• Fomin, Fedor; Kratsch, Dieter; Todinca, Ioan (2004). Exact (exponential) algorithms for treewidth and minimum fill-in. (external link)
• Fiala, Jiri; Fishkin, Alexey; Fomin, Fedor (2004). On distance constrained labeling of disk graphs. (external link)
• Demaine, Eric; Fomin, Fedor; Hajiaghayi, MohammadTaghi et al. (2004). Bidimensional parameters and local treewidth. (external link)
• Fomin, Fedor; Matamala, Martin; Rapaport, Ivan (2004). The complexity of approximating the oriented diameter of chordal graphs. (external link)
• Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor et al. (2004). Radio labeling with preassigned frequencies. (external link)
• Fomin, Fedor; Kratsch, Dieter; Müller, Haiko (2004). Algorithms for graphs with small octopus. (external link)
• Fomin, Fedor (2004). Searching expenditure and interval graphs. (external link)
• Fomin, Fedor; Heggernes, Pinar; Telle, Jan Arne (2004). Graph searching, elimination trees, and a generalization of bandwidth. (external link)
• Broersma, Hajo; Fomin, Fedor; Woeginger, Gerhard J. (2004). Parallel knock-out schemes in networks,. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2004). A simple and fast approach for solving problems on planar graphs. (external link)
• Demaine, Eric; Fomin, Fedor; Hajiaghayi, MohammadTaghi et al. (2004). Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. (external link)
• Fomin, Fedor; Kratsch, Dieter; Woeginger, Gerhard (2004). Exact (exponential) algorithms for the dominating set problem. (external link)
• Fomin, Fedor; Matamala, Martin; Prisner, Erich et al. (2004). AT-free graphs: linear bounds for the oriented diameter. (external link)
• Fomin, Fedor; Fiala, Jiri; Fishkin, Alexei (2004). On distance constrained labeling of disk graphs. (external link)
• Broersma, Hajo; Fomin, Fedor; Golovach, PA et al. (2004). Backbone colorings for networks. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2004). Dominating sets and local treewidth. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2004). Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. (external link)
• Golovach, Petr; Fomin, Fedor (2003). Interval degree and bandwidth of a graph. (external link)
• Thilikos, Dimitrios; Fomin, Fedor (2003). On the Monotonicity of Games Generated by Symmetric Submodular Functions. (external link)
• Kratsch, Dieter; Müller, Haiko, Haiko; Fomin, Fedor (2003). On the domination search numbe. (external link)
• Fomin, Fedor (2003). Pathwidth of planar and line graphs. (external link)
• Fomin, Fedor; Broersma, Hajo; Woeginger, Gerhard et al. (2002). More About Subcolorings. (external link)
• Fomin, Fedor; Bodlaender, Hans (2002). Approximation of pathwidth of outerplanar graphs. (external link)
• Fomin, Fedor (2002). A generalization of the graph bandwidth. (external link)

Academic literature review

• Crespelle, Christophe; Drange, Pål Grønås; Fomin, Fedor et al. (2023). A survey of parameterized algorithms and the complexity of edge modification. (external link)
• Fomin, Fedor; Kaski, Petteri (2013). Exact exponential algorithms. (external link)
• Fomin, Fedor (2012). Kernelization algorithms (keynote speech). (external link)

Academic lecture

• Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr et al. (2022). Lossy Kernelization of Same-Size Clustering. (external link)
• Dorn, Frederic ; Fomin, Fedor; Thilikos, Dimitrios M. (2008). Catalan structures and dynamic programming in H-minor-free graphs. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2004). A Simple and Fast Approach for Solving Problems on Planar Graphs. (external link)
• Demaine, Erik D.; Fomin, Fedor; Hajiaghayi, Mohammad Taghi et al. (2004). Bidimensional Parameters and Local Treewidth. (external link)
• Bodlaender, Hans; Fomin, Fedor (2004). Equitable colorings of bounded treewidth graphs. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2004). Dominating sets in planar graphs: branch-width and exponential speed-up. (external link)
• Fomin, Fedor; Kratsch, Dieter; Todinca, Ioan (2004). Exact (exponential) algorithms for treewidth and minimum fill-in. (external link)
• Broersma, Hajo; Fomin, Fedor; Woeginger, Gerhard (2004). Parallel knock-out schemes in networks. (external link)
• Fomin, Fedor; Heggernes, Pinar; Telle, Jan Arne (2003). Graph searching, elimination trees, and a generalization of bandwidth. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2003). Dominating sets and local treewidth. (external link)
• Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios et al. (2003). Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. (external link)
• Broersma, Hajo; Fomin, Fedor; Woeginger, Gerhard (2003). Backbone colorings for networks. (external link)
• Bodlaender, Hans; Fomin, Fedor; Broersma, Hajo et al. (2002). Radio Labeling with Pre-assigned Frequencies. (external link)
• Bodlaender, Hans; Fomin, Fedor (2002). Tree Decompositions with Small Cost. (external link)
• Fomin, Fedor; Broersma, Hajo; Woeginger, Gerhard et al. (2001). Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. (external link)

Lecture

• Bandyapadhyay, Sayan; Fomin, Fedor; Simonov, Kirill (2021). On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. (external link)

Editorial

• Fomin, Fedor; Podolskii, Vladimir V (2020). CSR 2018 Special Issue on TOCS. (external link)
• Fomin, Fedor; Podolskii, Vladimir V (2018). Preface. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas et al. (2016). Forewords: Special issue on Theory and Applications of Graph Searching Problems. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Kreutzer, Stephan et al. (2012). Foreword: Special Issue on Theory and Applications of Graph Searching Problems. (external link)
• Fellows, Michael R.; Fomin, Fedor; Gutin, Gregory (2011). Special Issue on Parameterized Complexity of Discrete Optimization Preface. (external link)
• Fomin, Fedor; Fraigniaud, Pierre; Thilikos, Dimitrios M. (2008). Forewords: Special issue on graph searching. (external link)
• Fomin, Fedor; Iwama, Kazuo; Kratsch, Dieter (2008). Abstracts Collection -- Moderately Exponential Time Algorithms. (external link)

Textbook

• Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket et al. (2019). Kernelization. Theory of Parameterized Preprocessing. (external link)

Academic anthology/Conference proceedings

• Fomin, Fedor; Podolskii, Vladimir V (2018). Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. (external link)
• Fomin, Fedor; Kaski, Petteri (2012). Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. (external link)
• Chen, Jianer; Fomin, Fedor (2009). Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009. (external link)
• Fomin, Fedor; Stepanov, Alexey (2007). Counting Minimum Weighted Dominating Sets. (external link)
• Fomin, Fedor (2006). Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006 Bergen, Norway, June 22-23, 2006 Revised Papers, Lecture Notes in Computer Science, vol. 4271. (external link)

Doctoral dissertation

• Drange, Pål Grønås; Fomin, Fedor (2015). Parameterized Graph Modification Algorithms. (external link)

Academic monograph

• Cygan, Marek; Fomin, Fedor; Lokshtanov, Daniel et al. (2015). Parameterized Algorithms. (external link)
• Fomin, Fedor; Kratsch, Dieter (2010). Exact exponential algorithms. (external link)

Abstract

• Fomin, Fedor; Golovach, Petr (2013). Long Circuits and Large Euler Subgraphs. (external link)
• Fomin, Fedor; Golovach, Petr; Korhonen, Janne (2013). On the Parameterized Complexity of Cutting a Few Vertices from a Graph. (external link)
• Fomin, Fedor; Iwama, Kazuo; Kratsch, Dieter (2008). 08431 Executive Summary -- Moderately Exponential Time Algorithms. (external link)

Academic chapter/article/Conference paper

• Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr (2013). Preventing unraveling in social networks gets harder. (external link)
• Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr (2013). Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. (external link)
• Fellows, Michael; Rosamond, Frances; Fomin, Fedor et al. (2009). Local Search: Is Brute-Force Avoidable?. (external link)
• Fomin, Fedor; Thilikos, Dimitrios (2008). Branchwidth of Graphs. (external link)
• Dorn, Frederic ; Fomin, Fedor; Thilikos, Dimitrios M. (2008). Catalan structures and dynamic programming in /H/-minor-free graphs. (external link)
• Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter (2006). Measure and conquer: a simple O(2 0.288n) independent set algorithm. (external link)

See a complete overview of publications in Cristin.