Author of the publication

Solving MaxSAT and #SAT on Structured CNF Formulas.

, , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 16-31. 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

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 248-258. Springer, (2015)On Satisfiability Problems with a Linear Structure., , , and . IPEC, volume 63 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Hardness of computing width parameters based on branch decompositions over the vertex set., and . Electron. Notes Discret. Math., (2015)Between Treewidth and Clique-Width., and . Algorithmica, 75 (1): 218-253 (2016)Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set., , and . IPEC, volume 43 of LIPIcs, page 212-223. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Solving MaxSAT and #SAT on Structured CNF Formulas., , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 16-31. Springer, (2014)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . Algorithmica, 80 (2): 714-741 (2018)Broadcast Domination on Block Graphs in Linear Time., and . CSR, volume 7353 of Lecture Notes in Computer Science, page 172-183. Springer, (2012)Between Treewidth and Clique-Width., and . WG, volume 8747 of Lecture Notes in Computer Science, page 396-407. Springer, (2014)Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter.. CALDAM, volume 8959 of Lecture Notes in Computer Science, page 205-216. Springer, (2015)