Author of the publication

Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study.

, , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 388-399. Springer, (2014)

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

Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages.. ICLP, page 376-393. MIT Press, (1987)MAX/C on Sakai - A Web-based C-Programming Course., , and . CSEDU (1), page 196-201. INSTICC Press, (2010)Optimal branch-decomposition of planar graphs in O(n3) Time., and . ACM Trans. Algorithms, 4 (3): 30:1-30:13 (2008)Finalizing tentative matches from truncated preference lists.. CoRR, (2016)An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization., , and . IPEC, volume 89 of LIPIcs, page 25:1-25:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Treedepth Parameterized by Vertex Cover Number., and . IPEC, volume 63 of LIPIcs, page 18:1-18:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study., , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 388-399. Springer, (2014)Transformational Logic Program Synthesis., and . FGCS, page 195-201. OHMSHA Ltd. Tokyo and North-Holland, (1984)Parameterized Graph Algorithms & Data Reduction: Theory Meets Practice (NII Shonan Meeting 144)., , and . NII Shonan Meet. Rep., (2019)Heuristic Computation of Exact Treewidth.. SEA, volume 233 of LIPIcs, page 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)