( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective.

, , , , , and . CoRR, (2020)

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

Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 87-98. Springer, (2019)The algorithmic theory of treewidth.. Electron. Notes Discret. Math., (2000)Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality., , and . Electron. Notes Discret. Math., (2015)Definability Equals Recognizability for k-Outerplanar Graphs., and . IPEC, volume 43 of LIPIcs, page 175-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Classification of Coverings of Processor Networks.. J. Parallel Distributed Comput., 6 (1): 166-182 (1989)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)Complexity Results for the Spanning Tree Congestion Problem., , and . WG, volume 6410 of Lecture Notes in Computer Science, page 3-14. (2010)Exact Algorithms for Kayles., and . WG, volume 6986 of Lecture Notes in Computer Science, page 59-70. Springer, (2011)Robust Recoverable Path Using Backup Nodes., , , , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 95-106. Springer, (2016)