( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs.

, and . J. Algorithms, 21 (2): 358-402 (1996)

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

Treewidth computations II. Lower bounds., and . Inf. Comput., 209 (7): 1103-1119 (2011)The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case, , and . Inf. Comput., 108 (1): 34-50 (January 1994)Simulation of Large Networks on Smaller Networks, and . Inf. Control., 71 (3): 143-180 (December 1986)Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity., , and . ISAAC, volume 64 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On Interval Routing Schemes and Treewidth., , , and . WG, volume 1017 of Lecture Notes in Computer Science, page 181-196. Springer, (1995)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)Kernel bounds for disjoint cycles and disjoint paths., , and . Theor. Comput. Sci., 412 (35): 4570-4578 (2011)A faster parameterized algorithm for Pseudoforest Deletion., , and . Discret. Appl. Math., (2018)Dynamic Algorithms for Graphs with Treewidth 2.. WG, volume 790 of Lecture Notes in Computer Science, page 112-124. Springer, (1993)