Andy Oertel

According to our database, Andy Oertel authored at least 8 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

End-to-End Verification for Subgraph Solving.

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

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Graphs with many edge-colorings such that complete graphs are rainbow.

Josefran de Oliveira Bastos, Carlos Hoppen, Hanno Lefmann, Andy Oertel, Dionatan Ricardo Schmidt

Discret. Appl. Math., July, 2023

Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract).

Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Certified Core-Guided MaxSAT Solving.

Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Dieter Vandesande

Proceedings of the Automated Deduction - CADE 29, 2023

2022

Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411).

Olaf Beyersdorff, Armin Biere, Vijay Ganesh, Jakob Nordström, Andy Oertel

Dagstuhl Reports, October, 2022

Fast ultrametric matrix-vector multiplication.

Tobias Hofmann, Andy Oertel

CoRR, 2022

Certified CNF Translations for Pseudo-Boolean Solving.

Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

2021

Maximum number of r-edge-colorings such that all copies of K_k are rainbow.

Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021