Prati
Andy Oertel
Andy Oertel
Department of Computer Science, Lund University
Potvrđena adresa e-pošte na cs.lth.se - Početna stranica
Naslov
Citirano
Citirano
Godina
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
182022
Certified core-guided MaxSAT solving
J Berg, B Bogaerts, J Nordström, A Oertel, D Vandesande
International Conference on Automated Deduction, 1-22, 2023
112023
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
52021
Certifying MIP-based presolve reductions for 0-1 integer linear programs
A Hoen, A Oertel, A Gleixner, J Nordström
arXiv preprint arXiv:2401.09277, 2024
32024
End-to-End Verification for Subgraph Solving
S Gocht, C McCreesh, MO Myreen, J Nordström, A Oertel, YK Tan
22024
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
12023
Certified MaxSAT Preprocessing
H Ihalainen, A Oertel, YK Tan, J Berg, M Järvisalo, J Nordström
arXiv preprint arXiv:2404.17316, 2024
2024
Certified Core-Guided MaxSAT Solving
A Oertel, D Vandesande
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
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
2023
Fast ultrametric matrix-vector multiplication
T Hofmann, A Oertel
arXiv preprint arXiv:2201.00017, 2021
2021
Proving an Extremal Graph Coloring Theorem using Linear Programming
A Oertel, H Lefmann, K Odermann
Master Thesis, TU-Chemnitz, 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
Professur Theoretische Informatik
A Oertel, A Goerdt, L Falke
Certified MaxSAT Preprocessing Extended version including appendix
H Ihalainen, A Oertel, YK Tan, J Berg, M Järvisalo, MO Myreen, ...
3.21 Certified CNF Translations for Pseudo-Boolean Solving
A Oertel
Theory and Practice of SAT and Combinatorial Solving, 100, 0
BREAKID-KISSAT in SAT Competition 2023 (System Description)
B Bogaerts, J Nordström, A Oertel, CU Yıldırımoglu
SAT COMPETITION 2023, 25, 0
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, 0
BREAKID-KISSAT and BREAKID-KISSAT-WITHUNSATCERTIFICATES in
B Bogaerts, J Nordström, A Oertel, CU Yıldırımoglu
SAT COMPETITION 2022, 12, 0
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–19