Papers authored by Hans Bodlaender
Refreshing results…
,
Daniel Lokshtanov,
Eelko Penninkx
Planar Capacitated Dominating Set Is W[1]-Hard
Download from citeseerx.ist.psu.edu
,
Peter Rossmanith
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Download from www.researchgate.net
,
Stéphan Thomassé,
Anders Yeo
Kernel bounds for disjoint cycles and disjoint paths
Download from doi.org
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
Download from arxiv.org
,
Eelko Penninkx,
Richard B. Tan
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
Upload
Exact Algorithms for Edge Domination
Download from link.springer.com
,
Alexander Grigoriev,
Nadejda V. Grigorieva,
Albert Hendriks
The Valve Location Problem in Simple Network Topologies.
Download from cris.maastrichtuniversity.nl
,
Pinar Heggernes,
Yngve Villanger
Faster Parameterized Algorithms for Minimum Fill-in
Download from dspace.library.uu.nl
,
Richard B. Tan,
Thomas C. van Dijk,
Jan van Leeuwen
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
Download from www.researchgate.net
,
Arie M. C. A. Koster
Combinatorial optimization on graphs of bounded treewidth
Download from citeseerx.ist.psu.edu
,
Michael R. Fellows,
Michael A. Langston,
Mark A. Ragan,
Frances A. Rosamond,
Mark Weyer
Quadratic Kernelization for Convex Recoloring of Trees
Download from link.springer.com
,
M. Yoshioka,
G. N. Yannakakis,
S. Yang,
P. Yan,
S. B. Yahia,
N. Wilson,
O. Watanabe,
F. Wang,
G. Wei,
X.-Y. Xue,
N. Urqhart,
A. S. Uyar,
A. Uhrmacher
and 138 other authors
Upload
,
Marc J. van Kreveld,
Marc J. van Kreveld,
Günter Rote,
Gerard Tel
Wooden Geometric Puzzles: Design and Hardness Proofs
Download from link.springer.com
,
Corinne Feremans,
Alexander Grigoriev,
Eelko Penninkx,
René Sitters,
Thomas Wolle
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
Download from doi.org
,
Gerard Tel
Local Monotonicity in Probabilistic Networks.
Download from www.researchgate.net
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Download from citeseerx.ist.psu.edu
Missing publications? Search for publications with a matching author name.