(Meta) Kernelization

(Meta) Kernelization

A Linear Vertex Kernel for Maximum Internal Spanning Tree

A Polynomial Kernel for Proper Interval Vertex Deletion

A Polynomial Kernel for Proper Interval Vertex Deletion

A linear vertex kernel for maximum internal spanning tree

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

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

An Exact Algorithm for Minimum Distortion Embedding

An exact algorithm for minimum distortion embedding

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs

Branching and Treewidth Based Exact Algorithms

scholarly article by Fedor Fomin et al published 2006 in Lecture Notes in Computer Science

Computing Optimal Steiner Trees in Polynomial Space

Counting Subgraphs via Homomorphisms

Counting Subgraphs via Homomorphisms

Distortion Is Fixed Parameter Tractable

Distortion is Fixed Parameter Tractable

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms

Exact algorithms via monotone local search

Faster Exact Algorithms for Some Terminal Set Problems

Faster algorithms for finding and counting subgraphs

Going Far From Degeneracy

artículo científico publicado en 2020

Graph Layout Problems Parameterized by Vertex Cover

Graph Modification Problems: A Modern Perspective

Hitting Forbidden Minors: Approximation and Kernelization

Implicit branching and parameterized partial cover problems

Improved Exact Algorithms for Counting 3- and 4-Colorings

scholarly article published in Lecture Notes in Computer Science

Irrelevant vertices for the planar Disjoint Paths Problem ⬇️

Iterative Compression and Exact Algorithms

scholarly article published in Lecture Notes in Computer Science

Iterative compression and exact algorithms

Kernel(s) for problems with no kernel

Kernelization Methods for Fixed-Parameter Tractability

Kernels for feedback arc set in tournaments

Local search: Is brute-force avoidable?

On Cutwidth Parameterized by Vertex Cover

On Two Techniques of Combining Branching and Treewidth

On the Complexity of Some Colorful Problems Parameterized by Treewidth

On the complexity of some colorful problems parameterized by treewidth

On the parameterized complexity of vertex cover and edge cover with connectivity constraints

Parameterized Algorithms

scholarly article published 2015

Parameterized Algorithms for Boxicity

artículo científico publicado en 2010

Parameterized Algorithms to Preserve Connectivity

Parameterized Complexity of Maximum Edge Colorable Subgraph

artículo científico publicado en 2022

Parameterized Complexity of Superstring Problems

Parameterized Complexity of Superstring Problems

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree

artículo científico publicado en 2019

Parameterized algorithm for eternal vertex cover

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

Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms

article published in 2012

Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin

artículo científico publicado en 2018

Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles

Ranking and Drawing in Subexponential Time

Representative Families of Product Families

Representative Sets of Product Families

Sharp Separation and Applications to Exact and Parameterized Algorithms

Sharp Separation and Applications to Exact and Parameterized Algorithms

article published in 2010

Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

Spanning Directed Trees with Many Leaves

Strengthening Erdös-Pósa property for minor-closed graph classes

Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering

Subexponential algorithms for partial cover problems

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

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

artículo científico publicado en 2009

The Curse of Connectivity: t-Total Vertex (Edge) Cover