Andy Oertel is a PhD student at Lund University in the Mathematical Insights into Algorithms for Optimization (MIAO) research group and is supervised by Jakob Nordström. His research interests are pseudo-Boolean optimization (aka 0-1 integer linear programming) and proof logging (certifying algorithms) based on pseudo-Boolean reasoning.
Andy Oertel obtained his MSc degree from the Chemnitz University of Technology and received the best thesis in computer science award from the Chemnitz University of Technology for his MSc thesis in 2021. In 2022, he also received the best paper award at the SAT conference.
During his Master's studies, he worked on extremal graph theory, semidefinite programming relaxations and ultrametric matrices.