People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Xtract
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Robert Ganian
PDF
Cite
Meta-kernelization using well-structured modulators
Robert Ganian
PDF
Cite
DOI
On the complexity of rainbow coloring problems
Robert Ganian
PDF
Cite
Small Resolution Proofs for QBF using Dependency Treewidth
Eduard Eiben
,
Robert Ganian
PDF
Cite
Solving Problems on Graphs of High Rank-Width
Eduard Eiben
,
Robert Ganian
,
Stefan Szeider
PDF
Cite
DOI
The complexity landscape of decompositional parameters for ILP
Robert Ganian
PDF
Cite
A Linear-Time Parameterized Algorithm for Node Unique Label Cover
Daniel Lokshtanov
,
M. S. Ramanujan
,
Saket Saurabh
PDF
Cite
DOI
Backdoor Treewidth for SAT
Robert Ganian
,
M. S. Ramanujan
,
Stefan Szeider
PDF
Cite
DOI
Combining Treewidth and Backdoors for CSP
Robert Ganian
,
M. S. Ramanujan
,
Stefan Szeider
PDF
Cite
DOI
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian
PDF
Cite
DOI
»
Cite
×