Author of the publication

Treewidth of display graphs: bounds, brambles and applications.

, , , , and . J. Graph Algorithms Appl., 23 (4): 715-743 (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.

 

Other publications of authors with the same name

Protocol design for large group multicasting: the message distribution protocol., , and . Comput. Commun., 14 (5): 287-297 (1991)Iterative Plan Construction for the Workflow Satisfiability Problem., , , , and . J. Artif. Intell. Res., (2014)Max-Cut Parameterized Above the Edwards-Erdős Bound., , and . Algorithmica, 72 (3): 734-757 (2015)Parameterized algorithms for load coloring problem., and . Inf. Process. Lett., 114 (8): 446-449 (2014)Parameterized Complexity of MaxSat Above Average, , , , and . CoRR, (2011)Cutting an alignment with Ockham's razor., , , , , , and . CoRR, (2019)Maximum Balanced Subgraph Problem Parameterized Above Lower Bound, , , and . CoRR, (2012)Exploring the tiers of rooted phylogenetic network space using tail moves., , , , and . CoRR, (2017)Parameterized Complexity of MaxSat above Average., , , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 184-194. Springer, (2012)Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound., , and . FSTTCS, volume 18 of LIPIcs, page 400-411. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)