A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs

A survey of parameterized algorithms and the complexity of edge modification

scientific article published in May 2023

Acyclic, Star, and Injective Colouring: Bounding the Diameter

scientific article published in 2022

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

article by Fedor Fomin et al published January 2014 in SIAM Journal on Computing

Approximating Width Parameters of Hypergraphs with Excluded Minors

Approximation Algorithms for Domination Search

Approximation of minimum weight spanners for sparse graphs

Backbone colorings for graphs: Tree and path backbones

Branch and Recharge: Exact Algorithms for Generalized Domination

Compound Logics for Modification Problems

scientific article published on 20 September 2024

Contraction Bidimensionality: The Accurate Picture

Contraction obstructions for treewidth

Cops and Robber Game Without Recharging

Cops and Robber Game without Recharging

Cops and Robber with Constraints

Finding Cactus Roots in Polynomial Time.

scientific article published on 21 November 2017

Going Far From Degeneracy

scholarly article published in 2020

Guard Games on Graphs: Keep the Intruder Out!

Guard games on graphs: Keep the intruder out!

article published in 2011

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

scientific article published on 10 February 2023

How to Guard a Graph?

article published in 2010

How to Guard a Graph?

How to hunt an invisible rabbit on a graph

Long Circuits and Large Euler Subgraphs

Long Circuits and Large Euler Subgraphs

Metric Dimension of Bounded Width Graphs

Minimizing Rosenthal Potential in Multicast Games

On the Parameterized Complexity of Cutting a Few Vertices from a Graph

On tractability of Cops and Robbers game

Parameterized Algorithms to Preserve Connectivity

Parameterized Complexity of Elimination Distance to First-Order Logic Properties

scientific article published on 29 March 2022

Parameterized Complexity of Secluded Connectivity Problems

Parameterized Complexity of Superstring Problems

Parameterized Complexity of Superstring Problems

Parameterized Complexity of the Spanning Tree Congestion Problem

Parameterized algorithm for eternal vertex cover

scholarly article by Fedor Fomin et al published July 2010 in Information Processing Letters

Parameterized complexity of connected even/odd subgraph problems

Parameterized complexity of the anchored k -core problem for directed graphs

Pursuing a fast robber on a graph

Sort and Search: Exact algorithms for generalized domination

scholarly article by Fedor Fomin et al published June 2009 in Information Processing Letters

Spanners in Sparse Graphs

Spanners in sparse graphs

Spanners of bounded degree graphs

scholarly article by Fedor Fomin et al published January 2011 in Information Processing Letters

Three Complexity Results on Coloring P k -Free Graphs

Three complexity results on coloringPk-free graphs

k-Gap Interval Graphs