( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

, , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 87-98. Springer, (2019)

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

Kernelization for Convex Recoloring., , , , , and . ACiD, volume 7 of Texts in Algorithmics, page 23-35. King's College, London, (2006)A Tourist Guide through Treewidth. Acta Cybernetica, 11 (1-2): 1-21 (1993)Improved Lower Bounds for Graph Embedding Problems., and . CoRR, (2016)On the Complexity of Some Coloring Games.. WG, volume 484 of Lecture Notes in Computer Science, page 30-40. Springer, (1990)The Valve Location Problem in Simple Network Topologies., , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 55-65. (2008)Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , , , and . CoRR, (2019)Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation.. CoRR, (2020)Treewidth for Graphs with Small Chordality., and . Discret. Appl. Math., 79 (1-3): 45-61 (1997)Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's., , , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 87-99. Springer, (2004)Subexponential Time Algorithms for Finding Small Tree and Path Decompositions., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 179-190. Springer, (2015)