( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.

, , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 102-113. Springer, (2008)

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

Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems., and . Inf. Process. Lett., 61 (5): 227-232 (1997)On exact algorithms for treewidth., , , , and . ACM Trans. Algorithms, 9 (1): 12:1-12:23 (2012)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)Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 87-98. Springer, (2019)Definability Equals Recognizability for k-Outerplanar Graphs., and . IPEC, volume 43 of LIPIcs, page 175-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality., , and . Electron. Notes Discret. Math., (2015)The algorithmic theory of treewidth.. Electron. Notes Discret. Math., (2000)The Classification of Coverings of Processor Networks.. J. Parallel Distributed Comput., 6 (1): 166-182 (1989)