Magnus O. Myreen — accepted AI-conference papers

2026

Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables

Markus Anders, Bart Bogaerts, Benjamin Bogø, Arthur Gontier, Wietze Koops, Ciaran McCreesh +5

AAAI 2026technical

Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs is to make solvers certifying, so that they output not just a solution, but also a mathematical proof of correctness i

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

End-to-End Verification for Subgraph Solving

Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan

AAAI 2024technical

Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness. Recently, some state-of-the-art subgraph solvers have been enhanced to output machine-verifiable proofs that their results are…

Cited by 6 Source ↗PDF ↗Scholar ↗