(Meta) Kernelization

(Meta) Kernelization

A $c^k n$ 5-Approximation Algorithm for Treewidth

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 O(c^k n) 5-Approximation Algorithm for Treewidth

An exact algorithm for minimum distortion embedding

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs

Computing Optimal Steiner Trees in Polynomial Space

Cops and Robber Game Without Recharging

Cops and Robber Game without Recharging

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

Guard Games on Graphs: Keep the Intruder Out!

Guard games on graphs: Keep the intruder out!

article published in 2011

Hitting Forbidden Minors: Approximation and Kernelization

Irrelevant vertices for the planar Disjoint Paths Problem ⬇️

Kernel(s) for problems with no kernel

Local search: Is brute-force avoidable?

On Cutwidth Parameterized by Vertex Cover

On the Complexity of Reconstructing H-free Graphs from Their Star Systems

On the Complexity of Some Colorful Problems Parameterized by Treewidth

On the Threshold of Intractability

On the complexity of reconstructing H-free graphs from their Star Systems

On the complexity of some colorful problems parameterized by treewidth

Parameterized Algorithms

scholarly article published 2015

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

Planar Capacitated Dominating Set Is W[1]-Hard

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

article published in 2012

Polynomial Kernel for Interval Vertex Deletion

artículo científico publicado en 2023

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

SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers

artículo científico publicado en 2014

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

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 Fine Details of Fast Dynamic Programming over Tree Decompositions