( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Kernelization for Convex Recoloring.

, , , , , and . ACiD, volume 7 of Texts in Algorithmics, page 23-35. King's College, London, (2006)

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 Linear Time Minor Tests and Depth First Search.. WADS, volume 382 of Lecture Notes in Computer Science, page 577-590. Springer, (1989)Radio Labeling with Pre-assigned Frequencies., , , , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 211-222. Springer, (2002)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)Weighted Treewidth Algorithmic Techniques and Results., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 893-903. Springer, (2007)Parameterized Complexity of the Spanning Tree Congestion Problem., , , , and . Algorithmica, 64 (1): 85-111 (2012)Google Scholar makes it hard - the complexity of organizing one's publications., and . Inf. Process. Lett., 115 (12): 965-968 (2015)A Cubic Kernel for Feedback Vertex Set and Loop Cutset., and . Theory Comput. Syst., 46 (3): 566-597 (2010)lambda-Coloring of Graphs., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 395-406. Springer, (2000)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)