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

A Polynomial Kernel for Trivially Perfect Editing

A Subexponential Parameterized Algorithm for Proper Interval Completion

A Subexponential Parameterized Algorithm for Proper Interval Completion

Computing Tree-Depth Faster Than $$2^{n}$$ 2 n

Computing Tree-Depth Faster Than 2 n

Dynamic Data Structures for Timed Automata Acceptance

artículo científico publicado en 2022

Edge Bipartization Faster than $$2^k$$ 2 k

Exploring the Subexponential Complexity of Completion Problems

Hardness of Approximation for Strip Packing

How to hunt an invisible rabbit on a graph

Jones' Conjecture in Subcubic Graphs

artículo científico publicado en 2021

Largest Chordal and Interval Subgraphs Faster Than 2 n

Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n

Linear Kernels for Outbranching Problems in Sparse Digraphs

Minimizing Rosenthal Potential in Multicast Games

On Cutwidth Parameterized by Vertex Cover

Parameterized Algorithms

scholarly article published 2015

Parameterized Complexity of Eulerian Deletion Problems.

artículo científico publicado en 2012

Polynomial Kernelization for Removing Induced Claws and Diamonds

Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?

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

Preprocessing subgraph and minor problems: When does a small vertex cover help?

article by Fedor Fomin et al published March 2014 in Journal of Computer and System Sciences

Sitting Closer to Friends than Enemies, Revisited

artículo científico publicado en 2014

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

artículo científico publicado en 2022

Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n

Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph

Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters