Author of the publication

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.

, , and . Discret. Appl. Math., 158 (7): 809-819 (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.

 

Other publications of authors with the same name

An algorithm for the maximum weight independent set problem on outerstring graphs., , , and . Comput. Geom., (2017)Upper Bounds on Boolean-Width with Applications to Exact Algorithms., , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 308-320. Springer, (2013)Hardness of computing width parameters based on branch decompositions over the vertex set., and . Electron. Notes Discret. Math., (2015)The point-set embeddability problem for plane graphs., and . SCG, page 41-50. ACM, (2012)Recognition of Linear and Star Variants of Leaf Powers is in P., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 70-83. Springer, (2022)Solving MaxSAT and #SAT on Structured CNF Formulas., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 16-31. Springer, (2014)On Alternative Models for Leaf Powers., , , and . CoRR, (2021)Independent Set in P5-Free Graphs in Polynomial Time., , and . SODA, page 570-581. SIAM, (2014)PACE Solver Description: Zygosity., , , , , and . IPEC, volume 285 of LIPIcs, page 39:1-39:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Faster Algorithms on Branch and Clique Decompositions., , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 174-185. Springer, (2010)