( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.

, , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 321-334. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Moritz Bodlaender

Emma Bodlaender

Hans-L Endl

Hans-L Wedler

Hans L Schläfer

 

Other publications of authors with the same name

Practical Algorithms for Linear Boolean-width., , and . IPEC, volume 43 of LIPIcs, page 187-198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Subexponential Time Algorithms for Embedding H-Minor Free Graphs., , and . ICALP, volume 55 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Valve Location Problem in Simple Network Topologies., , , and . INFORMS J. Comput., 22 (3): 433-442 (2010)The valve location problem., , , and . CTW, page 13-16. University of Twente, (2007)Safe Reduction Rules for Weighted Treewidth., and . WG, volume 2573 of Lecture Notes in Computer Science, page 176-185. Springer, (2002)Treewidth: Structure and Algorithms.. SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 11-25. Springer, (2007)The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks., , and . ECAI, volume 215 of Frontiers in Artificial Intelligence and Applications, page 237-242. IOS Press, (2010)Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 192-203. Springer, (2000)Kernel bounds for disjoint cycles and disjoint paths., , and . Theor. Comput. Sci., 412 (35): 4570-4578 (2011)On Interval Routing Schemes and Treewidth., , , and . WG, volume 1017 of Lecture Notes in Computer Science, page 181-196. Springer, (1995)