Fedor Fomin
#88,297
Most Influential Person Now
Researcher
Fedor Fomin's AcademicInfluence.com Rankings
Fedor Fominmathematics Degrees
Mathematics
#5310
World Rank
#7482
Historical Rank
Graph Theory
#73
World Rank
#81
Historical Rank
Measure Theory
#1752
World Rank
#2152
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Fedor Fomin Influential?
(Suggest an Edit or Addition)According to Wikipedia, Fedor V. Fomin is a professor of Computer Science at the University of Bergen. He is known for his work in algorithms and graph theory. He received his PhD in 1997 at St. Petersburg State University under Nikolai Nikolaevich Petrov.
Fedor Fomin's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Parameterized Algorithms (2015) (1302)
- Exact exponential algorithms (2010) (451)
- An annotated bibliography on guaranteed graph searching (2008) (318)
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs (2005) (309)
- (Meta) Kernelization (2009) (297)
- A measure & conquer approach for the analysis of exact algorithms (2009) (249)
- A ck n 5-Approximation Algorithm for Treewidth (2016) (228)
- Bidimensionality and kernels (2010) (188)
- Dominating sets in planar graphs: branch-width and exponential speed-up (2003) (177)
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms (2016) (175)
- Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms (2012) (172)
- Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs (2005) (157)
- Improved algorithms for feedback vertex set problems (2007) (154)
- Kernelization: Theory of Parameterized Preprocessing (2019) (153)
- Measure and conquer: a simple O(20.288n) independent set algorithm (2006) (141)
- Measure and Conquer: Domination - A Case Study (2005) (139)
- Kernel(s) for problems with no kernel: On out-trees with many leaves (2008) (135)
- Exact (Exponential) Algorithms for the Dominating Set Problem (2004) (130)
- On the Complexity of Some Colorful Problems Parameterized by Treewidth (2007) (128)
- Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms (2005) (126)
- Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs (2004) (115)
- Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications (2008) (113)
- Subexponential parameterized algorithms (2007) (111)
- Treewidth computation and extremal combinatorics (2008) (110)
- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions (2005) (109)
- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions (2010) (105)
- On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms (2008) (102)
- An O(c^k n) 5-Approximation Algorithm for Treewidth (2013) (100)
- Large Induced Subgraphs via Triangulations and CMSO (2013) (99)
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms (2013) (97)
- On Two Techniques of Combining Branching and Treewidth (2009) (95)
- Bidimensional Parameters and Local Treewidth (2004) (90)
- Kernels for feedback arc set in tournaments (2009) (89)
- Approximation algorithms for time-dependent orienteering (2001) (89)
- Contraction obstructions for treewidth (2011) (88)
- Bidimensionality and EPTAS (2010) (87)
- Finding Induced Subgraphs via Minimal Triangulations (2009) (87)
- Pathwidth of cubic graphs and exact algorithms (2006) (83)
- A linear vertex kernel for maximum internal spanning tree (2009) (82)
- Catalan structures and dynamic programming in H-minor-free graphs (2008) (82)
- On exact algorithms for treewidth (2006) (79)
- Pursuing a fast robber on a graph (2010) (78)
- Hitting Forbidden Minors: Approximation and Kernelization (2010) (77)
- Exact Algorithms for Treewidth and Minimum Fill-In (2008) (76)
- Solving Connected Dominating Set Faster than 2n (2007) (75)
- Equitable colorings of bounded treewidth graphs (2004) (74)
- Intractability of Clique-Width Parameterizations (2010) (73)
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth (2015) (72)
- New upper bounds on the decomposability of planar graphs (2006) (69)
- Faster algorithms for finding and counting subgraphs (2009) (69)
- Subexponential parameterized algorithm for minimum fill-in (2011) (69)
- Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (2004) (67)
- Bidimensionality and geometric graphs (2011) (67)
- Counting Subgraphs via Homomorphisms (2009) (64)
- Preprocessing subgraph and minor problems: When does a small vertex cover help? (2012) (62)
- The Multivariate Algorithmic Revolution and Beyond (2012) (61)
- Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters (2014) (61)
- Local Search: Is Brute-Force Avoidable? (2009) (60)
- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (2004) (57)
- Kernelization and Sparseness: the case of Dominating Set (2014) (55)
- Solving Connected Dominating Set Faster than 2 n (2006) (55)
- A Simple and Fast Approach for Solving Problems on Planar Graphs (2004) (54)
- A Note on Exact Algorithms for Vertex Ordering Problems on Graphs (2012) (52)
- Iterative compression and exact algorithms (2008) (51)
- Three complexity results on coloring Pk-free graphs (2009) (50)
- Finding a Minimum Feedback Vertex Set in Time O (1.7548n) (2006) (50)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (2014) (48)
- Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem (2009) (46)
- Clique-width: on the price of generality (2009) (46)
- Nondeterministic Graph Searching: From Pathwidth to Treewidth (2005) (46)
- Spanning Directed Trees with Many Leaves (2008) (46)
- Algorithmic lower bounds for problems parameterized by clique-width (2010) (46)
- Faster parameterized algorithms for minor containment (2010) (45)
- Subexponential algorithms for partial cover problems (2011) (45)
- The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday (2012) (44)
- Representative Families of Product Families (2017) (43)
- Exact algorithms via monotone local search (2015) (43)
- Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes (2018) (43)
- Connected graph searching (2012) (42)
- Representative Sets of Product Families (2014) (42)
- Linear kernels for (connected) dominating set on H-minor-free graphs (2012) (42)
- Sharp Separation and Applications to Exact and Parameterized Algorithms (2010) (40)
- Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach (2005) (39)
- Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs (2010) (38)
- On the monotonicity of games generated by symmetric submodular functions (2001) (38)
- Approximation of pathwidth of outerplanar graphs (2001) (38)
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus (2006) (37)
- Graph Searching and Interval Completion (2000) (36)
- Contraction Bidimensionality: the Accurate Picture (2009) (35)
- Enumerating Minimal Subset Feedback Vertex Sets (2011) (35)
- A Polynomial Kernel for Proper Interval Vertex Deletion (2012) (35)
- Exact Algorithms for Graph Homomorphisms (2005) (34)
- Backbone colorings for graphs: Tree and path backbones (2007) (34)
- Spanners in sparse graphs (2008) (34)
- Parameterized Algorithms for Directed Maximum Leaf Problems (2007) (33)
- On tractability of Cops and Robbers game (2008) (32)
- Subexponential Parameterized Algorithm for Interval Completion (2014) (32)
- On the Tractability of Optimization Problems on H-Graphs (2017) (32)
- Preventing Unraveling in Social Networks Gets Harder (2013) (31)
- Optimal Linear Arrangement of Interval Graphs (2006) (30)
- Rank-width and tree-width of H-minor-free graphs (2009) (28)
- Tree decompositions with small cost (2002) (28)
- Approximating minimum cocolorings (2002) (28)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (2016) (28)
- On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications (2020) (28)
- Backbone Colorings for Networks (2003) (27)
- Parameterized algorithm for eternal vertex cover (2010) (27)
- Connected Graph Searching in Outerplanar Graphs (2005) (27)
- Exploring the Subexponential Complexity of Completion Problems (2015) (26)
- Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (2003) (26)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (2014) (26)
- A survey of parameterized algorithms and the complexity of edge modification (2020) (26)
- Parameterized Algorithms to Preserve Connectivity (2014) (24)
- Helicopter Search Problems, Bandwidth and Pathwidth (1998) (24)
- Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments (2010) (24)
- Graph Searching, Elimination Trees, and a Generalization of Bandwidth (2003) (24)
- Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs (2012) (23)
- Improved Exact Algorithms for Counting 3- and 4-Colorings (2007) (23)
- Strengthening Erdös–Pósa property for minor‐closed graph classes (2011) (23)
- Parameterized complexity of firefighting (2014) (23)
- Approximation Schemes for Low-rank Binary Matrix Approximation Problems (2018) (23)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (2007) (23)
- AT-free graphs: linear bounds for the oriented diameter (2004) (23)
- Algorithm Theory – SWAT 2012 (2012) (22)
- Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques (2014) (22)
- Implicit branching and parameterized partial cover problems (2011) (22)
- Tight Lower Bounds on Graph Embedding Problems (2016) (22)
- Parameterized Complexity of Firefighting Revisited (2011) (22)
- On distance constrained labeling of disk graphs (2004) (22)
- Parameterized low-rank binary matrix approximation (2018) (21)
- Distortion is Fixed Parameter Tractable (2009) (21)
- Branching and Treewidth Based Exact Algorithms (2006) (21)
- Computing branchwidth via efficient triangulations and blocks (2005) (21)
- A 3-approximation for the pathwidth of Halin graphs (2004) (21)
- Exploring Subexponential Parameterized Complexity of Completion Problems (2013) (21)
- The price of connectedness in expansions (2004) (20)
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph (2013) (20)
- Faster Steiner Tree Computation in Polynomial-Space (2008) (20)
- How to Guard a Graph? (2008) (20)
- The Firefighter problem on graph classes (2016) (20)
- Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs (2017) (20)
- Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult (2006) (20)
- More About Subcolorings (2002) (20)
- Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph (2013) (19)
- The Complexity of Approximating the Oriented Diameter of Chordal Graphs (2002) (19)
- Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs (2013) (19)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (2016) (19)
- Finding Detours is Fixed-Parameter Tractable (2016) (18)
- Metric Dimension of Bounded Tree-length Graphs (2016) (18)
- Solving d-SAT via Backdoors to Small Treewidth (2015) (18)
- To satisfy impatient Web surfers is hard (2014) (17)
- Parameterized Complexity of the Spanning Tree Congestion Problem (2012) (17)
- Diverse Pairs of Matchings (2020) (16)
- Hitting topological minors is FPT (2019) (16)
- Computing Tree-Depth Faster Than 2 n (2013) (16)
- Long directed (s, t)-path: FPT algorithm (2018) (16)
- Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles (2013) (16)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (2013) (16)
- Fast Minor Testing in Planar Graphs (2010) (16)
- Exact Algorithm for the Maximum Induced Planar Subgraph Problem (2011) (16)
- Exact Algorithms for Terrain Guarding (2018) (16)
- Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (2020) (15)
- Planar F-Deletion: Approximation and Optimal FPT Algorithms (2012) (15)
- Vertex Cover Structural Parameterization Revisited (2016) (15)
- Ranking and Drawing in Subexponential Time (2010) (15)
- On self duality of pathwidth in polyhedral graph embeddings (2007) (15)
- Cops and Robber Game Without Recharging (2010) (15)
- Interval degree and bandwidth of a graph (2003) (15)
- Online and Offline Distance Constrained Labeling of Disk Graphs (2001) (14)
- Metric Dimension of Bounded Width Graphs (2015) (14)
- Parameterized Complexity of Secluded Connectivity Problems (2015) (14)
- On the Domination Search Number (2000) (14)
- Computing Optimal Steiner Trees in Polynomial Space (2013) (14)
- Making Life Easier for Firefighters (2012) (13)
- Jungles, bundles, and fixed parameter tractability (2011) (13)
- Mixed search number and linear‐width of interval and split graphs (2007) (13)
- Kernelization of Graph Hamiltonicity: Proper H-Graphs (2019) (12)
- Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (2009) (12)
- An exact algorithm for minimum distortion embedding (2009) (12)
- Largest Chordal and Interval Subgraphs Faster than $$2^n$$2n (2013) (12)
- Radio Labeling with Preassigned Frequencies (2004) (12)
- Dominating Sets and Local Treewidth (2003) (12)
- Exact Algorithms via Monotone Local Search (2019) (12)
- Subexponential fixed-parameter tractability of cluster editing (2011) (11)
- Complexity of approximating the oriented diameter of chordal graphs (2004) (11)
- Faster Exact Algorithms for Some Terminal Set Problems (2013) (11)
- The Curse of Connectivity: t-Total Vertex (Edge) Cover (2010) (11)
- Going Far From Degeneracy (2019) (11)
- Guard games on graphs: Keep the intruder out! (2009) (11)
- Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors (2018) (11)
- A Fixed-Parameter Perspective on #BIS (2017) (11)
- Algorithmic Extensions of Dirac's Theorem (2020) (11)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (2015) (11)
- Spanners of bounded degree graphs (2011) (11)
- Diverse Collections in Matroids and Graphs (2021) (11)
- Open problems for FPT School 2014 (2014) (11)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (2015) (10)
- On the complexity of reconstructing H‐free graphs from their Star Systems (2011) (10)
- Note on a Helicopter Search Problem on Graphs (1999) (10)
- Approximating Acyclicity Parameters of Sparse Hypergraphs (2008) (10)
- Refined Complexity of PCA with Outliers (2019) (10)
- Editing to Connected f-Degree Graph (2019) (9)
- Search problems on 1-skeletons of regular polyhedrons (2005) (9)
- Graph Modification Problems: A Modern Perspective (2015) (9)
- Parameterized Low-distortion Embeddings - Graph metrics into lines and trees (2008) (9)
- Branch and Recharge: Exact Algorithms for Generalized Domination (2007) (9)
- 08431 Open Problems - Moderately Exponential Time Algorithms (2008) (9)
- Cops and Robber with Constraints (2012) (9)
- Matrix Rigidity from the Viewpoint of Parameterized Complexity (2018) (9)
- Computing Tree-Depth Faster Than $$2^{n}$$2n (2013) (9)
- Lower Bounds for the Graph Homomorphism Problem (2015) (8)
- Parameterization Above a Multiplicative Guarantee (2020) (8)
- On width measures and topological problems on semi-complete digraphs (2019) (8)
- Counting Minimum Weighted Dominating Sets (2007) (8)
- How to Hunt an Invisible Rabbit on a Graph (2015) (8)
- New upper bounds on the decomposability of planar graphs and fixed parameter algorithms (2002) (8)
- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs (2009) (8)
- Clique-width III (2018) (7)
- On the optimality of pseudo-polynomial algorithms for integer programming (2016) (7)
- Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems (2014) (7)
- Minimum Fill-in of Sparse Graphs: Kernelization and Approximation (2011) (7)
- Long Circuits and Large Euler Subgraphs (2013) (7)
- Modification to Planarity is Fixed Parameter Tractable (2019) (7)
- Parameterized complexity of connected even/odd subgraph problems (2014) (7)
- Sort and Search: Exact algorithms for generalized domination (2009) (7)
- How to Find a Good Explanation for Clustering? (2021) (7)
- k-Gap Interval Graphs (2011) (6)
- Radio Labeling with Pre-assigned Frequencies (2002) (6)
- ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs (2020) (6)
- Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) (2017) (6)
- Computation of Hadwiger Number and Related Contraction Problems (2020) (6)
- Kernelization Methods for Fixed-Parameter Tractability (2014) (6)
- Fast FPT-approximation of branchwidth (2021) (6)
- Path Contraction Faster Than 2n (2019) (6)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (2012) (6)
- Spanning Circuits in Regular Matroids (2016) (6)
- Parameterized k-Clustering: Tractability Island (2021) (6)
- Finding minimum feedback vertex set in bipartite graph (2005) (6)
- Parameterized Complexity of Elimination Distance to First-Order Logic Properties (2021) (6)
- 08431 Abstracts Collection - Moderately Exponential Time Algorithms (2008) (6)
- Approximating Minimum Cocolourings (2001) (5)
- Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) (2013) (5)
- Decomposition of Map Graphs with Applications (2019) (5)
- Distortion is Fixed Parameter Tractable (2013) (5)
- Parameterized k-Clustering: The distance matters! (2019) (5)
- Eliminating graphs by means of parallel knock-out schemes (2007) (5)
- Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs (2020) (5)
- On maximum number of minimal dominating sets in graphs (2005) (5)
- Algorithms for graphs with small octopus (2004) (5)
- Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) (2008) (5)
- Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs (2011) (5)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (2008) (5)
- EPTAS for k-means Clustering of Affine Subspaces (2020) (5)
- On the Parameterized Complexity of Graph Modification to First-Order Logic Properties (2018) (5)
- Covering vectors by spaces: Regular matroids (2017) (4)
- Searching expenditure and interval graphs (2004) (4)
- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous (2002) (4)
- Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs (2020) (4)
- Fine-grained complexity of integer programming: The case of bounded branch-width and rank (2016) (4)
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (2017) (4)
- Detours in Directed Graphs (2022) (4)
- 40th International Colloquium on Automata, Languages and Programming (2015) (4)
- On the Parameterized Complexity of [1, j]-Domination Problems (2018) (4)
- Kernelization: (Invited Talk) (2010) (4)
- Pathwidth of Planar and Line Graphs (2003) (4)
- Path Contraction Faster Than 2 (2019) (4)
- Bilateral Orientations and Domination (2001) (4)
- Parameterized Complexity of Secluded Connectivity Problems (2016) (3)
- Approximation Algorithms for Domination Search (2010) (3)
- More about Subcolorings (Extended Abstract) (2002) (3)
- Computing Tree Decompositions with Small Independence Number (2022) (3)
- Approximation of minimum weight spanners for sparse graphs (2011) (3)
- Split and List (2010) (3)
- Bidimensional Structures: Algorithms, Combinatorics and Logic (2013) (3)
- Backbone colorings for graphs (2003) (3)
- Manipulating Districts to Win Elections: Fine-Grained Complexity (2020) (3)
- Special Issue on "Theory and Applications of Graph Searching Problems" (2011) (3)
- Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers (2006) (3)
- To Satisfy Impatient Web Surfers Is Hard (2012) (3)
- Knot Diagrams of Treewidth Two (2019) (3)
- Subgraph Complementation (2020) (3)
- Largest Chordal and Interval Subgraphs Faster than (2015) (3)
- Fixed-Parameter Tractability of Maximum Colored Path and Beyond (2022) (3)
- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs (2021) (2)
- Partial complementation of graphs (2018) (2)
- Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs (2019) (2)
- Improving the gap of Erdös-Pósa property for minor-closed graph classes (2008) (2)
- Branchwidth of Graphs (2016) (2)
- Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals (2019) (2)
- FPT Approximation for Fair Minimum-Load Clustering (2021) (2)
- Exact Algorithms for Dominating Set (2008) (2)
- Problems from Dagstuhl Seminar 07281 : Structure Theory and FPT Algorithmics for Graphs , Digraphs and Hypergraphs (2007) (2)
- Approximating Width Parameters of Hypergraphs with Excluded Minors (2011) (2)
- Advanced kernelization algorithms (2015) (2)
- Parallel Knock-Out Schemes in Networks (2004) (2)
- On the Complexity of Reconstructing H -free Graphs from Their Star Systems (2008) (2)
- Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013 : proceedings (2013) (2)
- Fixed-Parameter and Approximation Algorithms for PCA with Outliers (2021) (2)
- Structured Connectivity Augmentation (2017) (2)
- Forewords: Special issue on graph searching (2008) (2)
- Algorithm theory - SWAT 2012 : 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4-6 2012: proceedings (2012) (2)
- Cops and Robber Game Without Recharging (2011) (2)
- Matrix Rigidity : Matrix Theory from the Viewpoint of Parameterized Complexity (2016) (2)
- Special Issue on Parameterized Complexity of Discrete Optimization (2011) (2)
- Algebraic techniques: sieves, convolutions, and polynomials (2015) (2)
- Longest Cycle above Erdős-Gallai Bound (2022) (2)
- Time-inconsistent Planning: Simple Motivation Is Hard to Find (2019) (2)
- Interval Completion with the Smallest Max-degree (1998) (2)
- An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL (2020) (2)
- Parameterized Algorithms for Partial Cover Problems (2008) (1)
- On Integer Programming and the Path-width of the Constraint Matrix (2016) (1)
- Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) (2011) (1)
- Finding cuts and separators (2015) (1)
- Parameterized Complexity of Elimination Distance to First-Order Logic Properties (2022) (1)
- Parameterized Complexity of Categorical Clustering with Size Constraints (2021) (1)
- Fast Minor Testing in Planar Graphs (2011) (1)
- Enumerating Minimal Subset Feedback Vertex Sets (2012) (1)
- Parameterized Complexity of Superstring Problems (2015) (1)
- Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science (2006) (1)
- Randomized Methods in Parameterized Algorithms (2015) (1)
- Compound Logics for Modification Problems (2021) (1)
- Graph-Theoretic Concepts in Computer Science (1992) (1)
- 12 On Exact Algorithms for Treewidth (2012) (1)
- Parameterized Complexity of Directed Spanner Problems (2021) (1)
- Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday (2020) (1)
- Collection Moderately Exponential Time Algorithms Dagstuhl Seminar (2008) (1)
- Searching for better fill-in (2014) (1)
- Parameterized Complexity of PCA (Invited Talk) (2020) (1)
- Multiplicative Parameterization Above a Guarantee (2021) (1)
- Parameterized low-rank binary matrix approximation (2020) (1)
- New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) (2019) (1)
- Tight Bounds for Subgraph Isomorphism and Graph Homomorphism (2015) (1)
- Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques (2017) (1)
- Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017 (2017) (1)
- Shortest Cycles With Monotone Submodular Costs (2022) (1)
- Graph-Theoretic Concepts in Computer Science (1990) (1)
- Proportionally Fair Matching with Multiple Groups (2023) (1)
- Time Versus Space (2010) (1)
- Parameterized Complexity of the Spanning Tree Congestion Problem (2011) (1)
- Report on GRASTA 2014 (2014) (1)
- Branch and Recharge: Exact Algorithms for Generalized Domination (2011) (1)
- Lossy Kernelization of Same-Size Clustering (2021) (1)
- Parameterized Complexity of PCA (2020) (1)
- KERNEL(S) FOR PROBLEMS WITH NO KERNEL: ON O UT-TREES WITH MANY LEAVES (EXTENDED ABSTRACT) (2009) (1)
- Minimum Fill-in of Sparse Graphs: Kernelization and Approximation (2013) (1)
- Sharp Separation and Applications to Exact and Parameterized Algorithms (2011) (1)
- Treewidth computation and extremal combinatorics (2012) (1)
- Parameterized Complexity of Feature Selection for Categorical Data Clustering (2021) (1)
- FINDING DETOURS IS FIXED-PARAMETER TRACTABLE\ast (2019) (1)
- Present-Biased Optimization (2020) (1)
- Backbone colorings for networks: tree and path backbones (2003) (1)
- The total vertex separation number and profile of a graph (1998) (1)
- Forewords: Special issue on Theory and Applications of Graph Searching Problems (2016) (0)
- Path Contraction Faster than 2 n ∗ 1 (2019) (0)
- KERNELIZATION OF GRAPH HAMILTONICITY: PROPER \bfitH -GRAPHS\ast (2021) (0)
- The EATCS Award 2017 - Call for Nominations (2016) (0)
- Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin (2018) (0)
- Deposited in DRO : 07 October 2008 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item (2014) (0)
- Subgraph Complementation (2020) (0)
- Computing paths of large rank in planar frameworks deterministically (2023) (0)
- 08431 Executive Summary - Moderately Exponential Time Algorithms (2008) (0)
- Boolean and Fp-Matrix Factorization: From Theory to Practice (2022) (0)
- Three complexity results on coloring P k -free graphs (cid:73) (2020) (0)
- Graph Decompositions and Algorithms (Invited Talk) (2016) (0)
- Foreword: Special Issue on Theory and Applications of Graph Searching Problems (2012) (0)
- Minimizing Rosenthal Potential in Multicast Games (2012) (0)
- EATCS Award 2015 (2015) (0)
- Excluded Grid Minors and EPTAS (2018) (0)
- Using Combinatorics to Prune Search Trees: Independent and Dominating Set (2006) (0)
- 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria (2022) (0)
- ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space (2021) (0)
- Computing Tree-Depth Faster Than 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{n}$$\end{document} (2014) (0)
- Coresets for Clustering in Geometric Intersection Graphs (2023) (0)
- Report on WG 2010 (2013) (0)
- Two-sets cut-uncut on planar graphs (2023) (0)
- Protrusions in Graphs and Their Applications (2010) (0)
- Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin (2018) (0)
- On the Parameterized Complexity of the Expected Coverage Problem (2020) (0)
- Newsletter of the PC Community July 2011 Welcome (0)
- Conclusions, Open Problems and Further Directions (2010) (0)
- Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, gargano, Italy, 13-15 May, 2008 (2008) (0)
- cographic matroids ) , Space Cover generalizes well-studied optimization problems (2019) (0)
- Longest Cycle above Erd\H{o}s-Gallai Bound (2022) (0)
- Bounded Search Trees (2015) (0)
- Rank-widthandtree-widthofH-minor-freegraphs (2010) (0)
- Rank-width and tree-width of <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://w (2010) (0)
- CSR 2018 Special Issue on TOCS (2019) (0)
- Largest Chordal and Interval Subgraphs Faster than 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^n$$\end{documen (2015) (0)
- On the Complexity of Recovering Incidence Matrices (2020) (0)
- Fixed-parameter intractability (2015) (0)
- Minimizing Rosenthal Potential in Multicast Games (2014) (0)
- Connecting Vertices by Independent Trees (2014) (0)
- Computing Optimal Steiner Trees in Polynomial Space (2012) (0)
- A Note on Exact Algorithms for Vertex Ordering Problems on Graphs (2011) (0)
- Preface to the special issue on Graph Searching: Theory and Applications (2021) (0)
- Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs (2011) (0)
- Local Search and SAT (2010) (0)
- Kernelizing Temporal Exploration Problems (2023) (0)
- Computer Science – Theory and Applications (2018) (0)
- Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) (2022) (0)
- GRAph Searching , Theory and Applications ( GRASTA 2012 (0)
- Proceedings of the 13th Scandinavian conference on Algorithm Theory (2012) (0)
- Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice (2022) (0)
- Open Problems Moderately Exponential Time Algorithms Seminar 08431 (2008) (0)
- Strategies d'encerclement non deterministes (2006) (0)
- Inconsistent Planning: When in doubt, toss a coin! (2021) (0)
- Chip firing and vertex cover of squares of graphs (2005) (0)
- Open Problems Moderately Exponential Time Algorithms Seminar 08431 (2008) (0)
- Building large k-cores from sparse graphs (2020) (0)
- Low-rank binary matrix approximation in column-sum norm (2019) (0)
- Domination games and treewidth (2014) (0)
- Improving dynamic programming on tree decompositions (2015) (0)
- Title : Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree Year : 2015 Version : Post print (2016) (0)
- On the Parameterized Complexity of Graph Modification to First-Order Logic Properties (2019) (0)
- A better kernel for treewidth-t modulator (2013) (0)
- (Re)packing Equal Disks into Rectangle (2022) (0)
- Exact Exponential Algorithms for Clustering Problems (2022) (0)
- The EATCS Award 2017 - Laudatio for Eva Tardos (2017) (0)
- D S ] 8 F eb 2 00 7 Parameterized Algorithms for Directed Maximum Leaf Problems ( Extended Abstract ) (2007) (0)
- Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II (2013) (0)
- Kernelization of Whitney Switches (2020) (0)
- Parameterized Complexity of Superstring Problems (2016) (0)
- Reducing Topological Minor Containment to the Unique Linkage Theorem (2019) (0)
- BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN Algorithms (2015) (0)
- CSR 2018 Special Issue on TOCS (2019) (0)
- Mémoire d’habilitation à diriger des recherches Studying Graphs: Structure via Rank-Width, and Listing of Minimal Dominating Sets (2016) (0)
This paper list is powered by the following services:
Other Resources About Fedor Fomin
What Schools Are Affiliated With Fedor Fomin?
Fedor Fomin is affiliated with the following schools:
