( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

Better Algorithms for the Pathwidth and Treewidth of Graphs., and . ICALP, volume 510 of Lecture Notes in Computer Science, page 544-555. Springer, (1991)Safe Seperators for Treewidth., and . ALENEX/ANALC, page 70-78. SIAM, (2004)Optimal data structures for stochastic driven simulations., , and . CoRR, (2018)Graphs with Branchwidth at Most Three., and . J. Algorithms, 32 (2): 167-194 (1999)Google Scholar makes it Hard - the complexity of organizing one's publications., and . CoRR, (2014)On Disjoint Cycles.. WG, volume 570 of Lecture Notes in Computer Science, page 230-238. Springer, (1991)Problems Hard for Treewidth but Easy for Stable Gonality., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 84-97. Springer, (2022)Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set., and . STACS, volume 1 of LIPIcs, page 657-668. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Exact algorithms for Kayles., , and . Theor. Comput. Sci., (2015)Tree decompositions with small cost., and . Discret. Appl. Math., 145 (2): 143-154 (2005)