default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndy Oertel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c10]Wietze Koops
, Daniel Le Berre, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan, Marc Vinyals:
Practically Feasible Proof Logging for Pseudo-Boolean Optimization. CP 2025: 21:1-21:27- 2024
- [c9]Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan:
End-to-End Verification for Subgraph Solving. AAAI 2024: 8038-8047 - [c8]Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Tobias Paxian, Dieter Vandesande:
Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability. CP 2024: 4:1-4:28 - [c7]Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov:
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. CP 2024: 9:1-9:21 - [c6]Alexander Hoen, Andy Oertel, Ambros M. Gleixner, Jakob Nordström:
Certifying MIP-Based Presolve Reductions for 0-1 Integer Linear Programs. CPAIOR (1) 2024: 310-328 - [c5]Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Magnus O. Myreen, Jakob Nordström:
Certified MaxSAT Preprocessing. IJCAR (1) 2024: 396-418 - [i3]Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Jakob Nordström:
Certified MaxSAT Preprocessing. CoRR abs/2404.17316 (2024) - 2023
- [j1]Josefran de Oliveira Bastos, Carlos Hoppen, Hanno Lefmann, Andy Oertel, Dionatan Ricardo Schmidt:
Graphs with many edge-colorings such that complete graphs are rainbow. Discret. Appl. Math. 333: 151-164 (2023) - [c4]Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Dieter Vandesande:
Certified Core-Guided MaxSAT Solving. CADE 2023: 1-22 - [c3]Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving (Extended Abstract). IJCAI 2023: 6436-6441 - 2022
- [c2]Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel:
Certified CNF Translations for Pseudo-Boolean Solving. SAT 2022: 16:1-16:25 - [i2]Tobias Hofmann, Andy Oertel:
Fast ultrametric matrix-vector multiplication. CoRR abs/2201.00017 (2022) - [i1]Olaf Beyersdorff, Armin Biere, Vijay Ganesh, Jakob Nordström, Andy Oertel:
Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411). Dagstuhl Reports 12(10): 84-105 (2022) - 2021
- [c1]Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt:
Maximum number of r-edge-colorings such that all copies of Kk are rainbow. LAGOS 2021: 419-426
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-09 01:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
