Author of the publication

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems.

, , , , , and . CP, volume 12333 of Lecture Notes in Computer Science, page 338-357. Springer, (2020)

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

Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling., , and . CAV (1), volume 12224 of Lecture Notes in Computer Science, page 463-484. Springer, (2020)Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems., , , , , and . CP, volume 12333 of Lecture Notes in Computer Science, page 338-357. Springer, (2020)An Auditable Constraint Programming Solver., , and . CP, volume 235 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Certified Symmetry and Dominance Breaking for Combinatorial Optimisation., , , and . AAAI, page 3698-3707. AAAI Press, (2022)Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract)., , and . PxTP, volume 336 of EPTCS, page 48. (2021)Certified CNF Translations for Pseudo-Boolean Solving., , , and . SAT, volume 236 of LIPIcs, page 16:1-16:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract)., , , and . IJCAI, page 6436-6441. ijcai.org, (2023)Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning"., , , , and . (September 2020)On Division Versus Saturation in Pseudo-Boolean Solving., , and . IJCAI, page 1711-1718. ijcai.org, (2019)Accelerating SAT Based Planning with Incremental SAT Solving., and . ICAPS, page 135-139. AAAI Press, (2017)