
Minimum Stable Cut and Treewidth
A stable cut of a graph is a cut whose weight cannot be increased by cha...
read it

Determining a Slater Winner is Complete for Parallel Access to NP
We consider the complexity of deciding the winner of an election under t...
read it

Upper Dominating Set: Tight Algorithms for Pathwidth and SubExponential Approximation
An upper dominating set is a minimal dominating set in a graph. In the U...
read it

Digraph Coloring and Distance to Acyclicity
In kDigraph Coloring we are given a digraph and are asked to partition ...
read it

(In)approximability of Maximum Minimal FVS
We study the approximability of the NPcomplete Maximum Minimal Feedback...
read it

Grundy Distinguishes Treewidth from Pathwidth
Structural graph parameters, such as treewidth, pathwidth, and cliquewi...
read it

Parameterized Complexity of (A,ℓ)Path Packing
Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)Path Pac...
read it

New Algorithms for Mixed Dominating Set
A mixed dominating set is a collection of vertices and edges that domina...
read it

Improved (In)Approximability Bounds for dScattered Set
In the dScattered Set problem we are asked to select at least k vertice...
read it

Independent Set Reconfiguration Parameterized by ModularWidth
Independent Set Reconfiguration is one of the most wellstudied problems...
read it

New Results on Directed Edge Dominating Set
We study a family of generalizations of Edge Dominating Set on directed ...
read it

Parameterized Complexity of Safe Set
In this paper we study the problem of finding a small safe set S in a gr...
read it

Maximum Independent Sets in Subcubic Graphs: New Results
The maximum independent set problem is known to be NPhard in the class ...
read it

Parameterized Orientable Deletion
A graph is dorientable if its edges can be oriented so that the maximum...
read it

Token Sliding on Split Graphs
We show that the independent set reconfiguration problem on split graphs...
read it

QBF as an Alternative to Courcelle's Theorem
We propose reductions to quantified Boolean formulas (QBF) as a new appr...
read it

How Bad is the Freedom to FloodIt?
FixedFloodIt and FreeFloodIt are combinatorial problems on graphs th...
read it

Finer Tight Bounds for Coloring on CliqueWidth
We revisit the complexity of the classical kColoring problem parameteri...
read it

Parameterized Power Vertex Cover
We study a recently introduced generalization of the Vertex Cover (VC) p...
read it

Parameterized (Approximate) Defective Coloring
In Defective Coloring we are given a graph G = (V, E) and two integers χ...
read it

On the Parameterized Complexity of RedBlue Points Separation
We study the following geometric separation problem: Given a set R of ...
read it

Structurally Parameterized dScattered Set
In dScattered Set we are given an (edgeweighted) graph and are asked t...
read it
Michael Lampis
is this you? claim profile