Author of the publication

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)

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

Graph classes with structured neighborhoods and algorithmic applications., and . Theor. Comput. Sci., (2013)An algorithm for the maximum weight independent set problem on outerstring graphs., , , and . Comput. Geom., (2017)The point-set embeddability problem for plane graphs., and . SCG, page 41-50. ACM, (2012)Faster Algorithms Parameterized by Clique-width., , and . CoRR, (2013)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)Hardness of computing width parameters based on branch decompositions over the vertex set., and . Electron. Notes Discret. Math., (2015)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 . Theor. Comput. Sci., (2016)The Point-Set Embeddability Problem for Plane graphs., and . Int. J. Comput. Geom. Appl., 23 (4-5): 357-396 (2013)Solving MaxSAT and #SAT on Structured CNF Formulas., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 16-31. Springer, (2014)