( en | de | ru )

 

Disambiguation of "Bodlaender, Hans L."

Author of the publication

copydeleteadd this publication to your clipboard
Quadratic Kernelization for Convex Recoloring of Trees.

, , , , , and . Algorithmica, 61 (2): 362-388 (2011)

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

Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees.. J. Algorithms, 11 (4): 631-643 (1990)Cutwidth I: A linear time fixed parameter algorithm., , and . J. Algorithms, 56 (1): 1-24 (2005)A Cubic Kernel for Feedback Vertex Set and Loop Cutset., and . Theory Comput. Syst., 46 (3): 566-597 (2010)Google Scholar makes it hard - the complexity of organizing one's publications., and . Inf. Process. Lett., 115 (12): 965-968 (2015)Parameterized Complexity of the Spanning Tree Congestion Problem., , , , and . Algorithmica, 64 (1): 85-111 (2012)W2-hardness of precedence constrained K-processor scheduling., and . Oper. Res. Lett., 18 (2): 93-97 (1995)Definability Equals Recognizability for k-Outerplanar Graphs., and . IPEC, volume 43 of LIPIcs, page 175-186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Subgraph Isomorphism on Graph Classes that Exclude a Substructure., , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 87-98. Springer, (2019)The Classification of Coverings of Processor Networks.. J. Parallel Distributed Comput., 6 (1): 166-182 (1989)Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality., , and . Electron. Notes Discret. Math., (2015)