( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Complexity Results for the Spanning Tree Congestion Problem.

, , and . WG, volume 6410 of Lecture Notes in Computer Science, page 3-14. (2010)

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

On exact algorithms for treewidth., , , , and . ACM Trans. Algorithms, 9 (1): 12:1-12:23 (2012)Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems., and . Inf. Process. Lett., 61 (5): 227-232 (1997)On Linear Time Minor Tests with Depth-First Search.. J. Algorithms, 14 (1): 1-23 (1993)Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs., and . J. Algorithms, 21 (2): 358-402 (1996)lambda-Coloring of Graphs., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 395-406. Springer, (2000)Weighted Treewidth Algorithmic Techniques and Results., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 893-903. Springer, (2007)Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms., , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 239-248. Springer, (2003)W2-hardness of precedence constrained K-processor scheduling., and . Oper. Res. Lett., 18 (2): 93-97 (1995)A Cubic Kernel for Feedback Vertex Set and Loop Cutset., and . Theory Comput. Syst., 46 (3): 566-597 (2010)Parameterized Complexity of the Spanning Tree Congestion Problem., , , , and . Algorithmica, 64 (1): 85-111 (2012)