All papers authored by Hans Bodlaender
Refreshing results…
,
Yusuke Kobayashi,
Tesshu Hanaka ,
Yoshio Okamoto ,
Yota Otachi ,
Yasuaki Kobayashi ,
Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Download from doi.org
,
Hirotaka Ono,
Yota Otachi
A faster parameterized algorithm for Pseudoforest Deletion
Download from pure.tue.nl
,
Tom C. Van Der Zanden
On the exact complexity of polyomino packing
Download from doi.org
,
Gunther Cornelissen,
Marieke van der Wegen
Recognizing Hyperelliptic Graphs in Polynomial Time
Download from pure.tue.nl
,
Sándor Kisfaludi-Bak,
Dániel Marx,
Tom C. van der Zanden
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
Download from pure.tue.nl
,
Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips
Download from pure.tue.nl
,
Hans L. Bodlaender ,
Tom C. van der Zanden,
Hirotaka Ono
On the Maximum Weight Minimal Separator
Upload
,
Tom C. van der Zanden
Improved Lower Bounds for Graph Embedding Problems
Download from arxiv.org
,
Hl Hans Bodlaender,
Hirotaka Ono,
Yota Otachi
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
Download from dx.doi.org
,
Pål Grǿnås Drange,
Markus S. Dregi,
Fedor V. Fomin,
Daniel Lokshtanov,
Michał Pilipczuk
A $c^k n$ 5-Approximation Algorithm for Treewidth
Download from dspace.library.uu.nl
,
Thomas C. van Dijk,
Han Hoogeveen,
Erik van Ommeren
Robust Recoverable Path Using Backup Nodes
Download from dspace.library.uu.nl
,
Mohammad Taghi Hajiaghayi,
Giuseppe F. Italiano
Download from link.springer.com
,
Hl Hans Bodlaender,
Pinar Heggernes,
Jan Arne Telle
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
Download from repository.tue.nl
,
Hl Hans Bodlaender
Definability Equals Recognizability for $k$-Outerplanar Graphs
Download from arxiv.orgMissing publications? Search for publications with a matching author name.