| Certified CNF translations for pseudo-Boolean solving S Gocht, R Martins, J Nordström, A Oertel 25th International Conference on Theory and Applications of Satisfiability …, 2022 | 25 | 2022 |
| Certified core-guided MaxSAT solving J Berg, B Bogaerts, J Nordström, A Oertel, D Vandesande International Conference on Automated Deduction, 1-22, 2023 | 23 | 2023 |
| End-to-end verification for subgraph solving S Gocht, C McCreesh, MO Myreen, J Nordström, A Oertel, YK Tan Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 8038-8047, 2024 | 6 | 2024 |
| Documentation of VeriPB and CakePB for the SAT competition 2023 B Bogaerts, C McCreesh, MO Myreen, J Nordström, A Oertel, YK Tan | 5 | 2023 |
| Maximum number of r-edge-colorings such that all copies of Kk are rainbow AJO Bastos, H Lefmann, A Oertel, C Hoppen, DR Schmidt Procedia Computer Science. Amsterdam. Vol. 195 (2021), p. 419-426, 2021 | 5 | 2021 |
| Certifying MIP-Based Presolve Reductions for – Integer Linear Programs A Hoen, A Oertel, A Gleixner, J Nordström International Conference on the Integration of Constraint Programming …, 2024 | 4 | 2024 |
| BreakID-kissat in SAT competition 2023 (system description) B Bogaerts, J Nordström, A Oertel, CU Yıldırımoglu SAT COMPETITION 2023, 25, 2023 | 2 | 2023 |
| Crafted benchmark formulas requiring symmetry breaking and/or parity reasoning B Bogaerts, J Nordström, A Oertel, CU Yıldırımoglu SAT COMPETITION 2023, 67, 2023 | 2 | 2023 |
| Certified MaxSAT Preprocessing H Ihalainen, A Oertel, YK Tan, J Berg, M Järvisalo, MO Myreen, ... International Joint Conference on Automated Reasoning, 396-418, 2024 | 1 | 2024 |
| Graphs with many edge-colorings such that complete graphs are rainbow JO Bastos, C Hoppen, H Lefmann, A Oertel, DR Schmidt Discrete Applied Mathematics 333, 151-164, 2023 | 1 | 2023 |
| Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411) O Beyersdorff, A Biere, V Ganesh, J Nordström, A Oertel Dagstuhl Reports 12 (10), 2023 | 1 | 2023 |
| Proving an Extremal Graph Coloring Theorem using Linear Programming A Oertel, H Lefmann, K Odermann Master Thesis, TU-Chemnitz, 2021 | 1 | 2021 |
| Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms E Demirović, C McCreesh, MJ McIlree, J Nordström, A Oertel, K Sidorov 30th International Conference on Principles and Practice of Constraint …, 2024 | | 2024 |
| Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability J Berg, B Bogaerts, J Nordström, A Oertel, T Paxian, D Vandesande 30th International Conference on Principles and Practice of Constraint …, 2024 | | 2024 |
| Certified Core-Guided MaxSAT Solving A Oertel | | 2023 |
| Documentation of V PB and C PB for the SAT Competition 2023 B Bogaerts, C McCreesh, MO Myreen, J Nordström, A Oertel, YK Tan | | 2023 |
| Fast ultrametric matrix-vector multiplication T Hofmann, A Oertel arXiv preprint arXiv:2201.00017, 2021 | | 2021 |
| Maximum number of r-edge-colorings such that all copies of Kk are rainbow J de Oliveira Bastos, H Lefmann, A Oertel, C Hoppen, DR Schmidt Procedia Computer Science 195, 419-426, 2021 | | 2021 |
| Crafted Benchmark Formulas Benefitting from Symmetry Breaking and/or Parity Reasoning B Bogaerts, J Nordström, A Oertel, D Vandesande SAT COMPETITION 2024, 34, 2018 | | 2018 |
| BreakID-kissat in SAT Competition 2024 (System B Bogaerts, J Nordström, A Oertel, D Vandesande SAT COMPETITION 2024, 11, 0 | | |
