People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Nfpc
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian
PDF
Cite
Project
Project
DOI
A Unifying Framework for Characterizing and Computing Width Measures
Robert Ganian
Cite
Project
Project
Algorithmic Applications of Tree-Cut Width
Robert Ganian
,
Eun Jung Kim
,
Stefan Szeider
PDF
Cite
Project
Project
DOI
An efficient algorithm for counting Markov equivalent DAGs
Robert Ganian
PDF
Cite
Project
Project
DOI
How to Find a Good Explanation for Clustering?
Sayan Bandyapadhyay and Fedor v. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov
PDF
Cite
Project
On Covering Segments with Unit Intervals
Robert Ganian
PDF
Cite
Project
Project
DOI
Parameterised Partially-Predrawn Crossing Number
Thekla Hamm and Petr Hlinený
PDF
Cite
Project
Project
DOI
Parameterized Algorithms for Upward Planarity
Robert Ganian
PDF
Cite
Project
Project
DOI
Sum-of-Products with Default Values: Algorithms and Complexity Results
Robert Ganian
,
Eun Jung Kim
,
Friedrich Slivovsky
,
Stefan Szeider
PDF
Cite
Project
Project
The Complexity of Envy-Free Graph Cutting
Robert Ganian
PDF
Cite
Project
Project
DOI
»
Cite
×