( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
A Cubic Kernel for Feedback Vertex Set and Loop Cutset.

, and . Theory Comput. Syst., 46 (3): 566-597 (2010)

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 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)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)Relaxed Update and Partition Network Games., , and . Fundam. Informaticae, 49 (4): 301-312 (2002)lambda-Coloring of Graphs., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 395-406. Springer, (2000)New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors.. GI Jahrestagung, volume 156 of Informatik-Fachberichte, page 82-88. Springer, (1987)New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors., and . STACS, volume 210 of Lecture Notes in Computer Science, page 119-129. Springer, (1986)Recognizing Hyperelliptic Graphs in Polynomial Time., , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 52-64. Springer, (2018)