( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Steiner Trees for Hereditary Graph Classes.

, , , , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 613-624. Springer, (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

On exact algorithms for treewidth., , , , and . ACM Trans. Algorithms, 9 (1): 12:1-12:23 (2012)The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs., , , , and . Theor. Comput. Sci., 244 (1-2): 167-188 (2000)Derivation of algorithms for cutwidth and related graph layout parameters., , and . J. Comput. Syst. Sci., 75 (4): 231-244 (2009)Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors.. J. Comput. Syst. Sci., 42 (1): 97-118 (1991)A Note on Exact Algorithms for Vertex Ordering Problems on Graphs., , , , and . Theory Comput. Syst., 50 (3): 420-432 (2012)Stable Divisorial Gonality is in NP., , and . Theory Comput. Syst., 65 (2): 428-440 (2021)lambda-Coloring of Graphs., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 395-406. Springer, (2000)Intervalizing k-Colored Graphs., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 87-98. Springer, (1995)A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth., and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 255-266. Springer, (2006)The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 356-367. Springer, (2011)