Filter dates
Overview
- parameterized complexity
- tree decompositions
- vertex cover
- np complete
Publications
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
ICALP
Crossing Number is NP-hard for Constant Path-width (and Tree-width).
CoRR
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
CoRR
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
GD (2)
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
SIAM J. Discret. Math.
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.
IPEC