( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
A O(c^k n) 5-Approximation Algorithm for Treewidth

, , , , , and . CoRR, (2013)

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 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)Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems., and . Inf. Process. Lett., 61 (5): 227-232 (1997)Introduction.. Algorithmica, 27 (3): 209-211 (2000)Parameterized Complexity of the Spanning Tree Congestion Problem., , , , and . Algorithmica, 64 (1): 85-111 (2012)Google Scholar makes it hard - the complexity of organizing one's publications., and . Inf. Process. Lett., 115 (12): 965-968 (2015)Intervalizing k-Colored Graphs., and . ICALP, volume 944 of Lecture Notes in Computer Science, page 87-98. Springer, (1995)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)Complexity Results for the Spanning Tree Congestion Problem., , and . WG, volume 6410 of Lecture Notes in Computer Science, page 3-14. (2010)