search result

Cover von Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs

A Complete Classification
Year: 2024
Media group: LIPIcs
Cover von Fundamental Problems on Bounded-Treewidth Graphs

Fundamental Problems on Bounded-Treewidth Graphs

The Real Source of Hardness
Year: 2024
Media group: LIPIcs
Cover von Multicut Problems in Embedded Graphs

Multicut Problems in Embedded Graphs

The Dependency of Complexity on the Demand Pattern
Year: 2024
Media group: LIPIcs
Cover von Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)

Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)

Year: 2022
Media group: LIPIcs
Cover von Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Year: 2022
Media group: LIPIcs
Cover von The Constraint Satisfaction Problem: Complexity andApproximability; 5
pp. 112-130
Search for this author
Year: 2022
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 5
Media group: DAGSTUHL REPORT
Cover von Degrees and Gaps

Degrees and Gaps

Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
Year: 2021
Media group: LIPIcs
Cover von On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting

On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting

Year: 2021
Media group: LIPIcs
Cover von New Horizons in Parameterized Complexity; 1
pp. 67-87
Search for this author
Year: 2019
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 1
Media group: DAGSTUHL REPORT
Cover von Multi-Budgeted Directed Cuts

Multi-Budgeted Directed Cuts

Year: 2019
Media group: LIPIcs
OPEN V 11.1.0.0