- Practically Feasible Proof Logging for Pseudo-Boolean Optimization (CP, 2025)
- Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates (CAV, 2025)
- Approximate Dec-POMDP Solving Using Multi-Agent A* (IJCAI, 2024)
Research Experience
Conducting research on combinatorial optimization and proof logging in the MIAO group; working on (decentralized) partially observable Markov decision processes (POMDPs) and verification of stochastic dynamical systems in the AI-FM group.
Education
PhD student in the Mathematical Insights into Algorithms for Optimization (MIAO) group at Lund University, Sweden, and the University of Copenhagen, Denmark, under the supervision of Prof. Dr. Jakob Nordström. Previously an ELLIS Excellence Fellow in the Artificial Intelligence and Formal Methods (AI-FM) group at Radboud University, Nijmegen, supervised by Dr. Sebastian Junges and Prof. Dr. Nils Jansen.
Background
Research interests include combinatorial optimization and proof logging for combinatorial optimization. Goals include improving existing algorithms and designing new algorithms for pseudo-Boolean solving and optimization, and developing proof logging for such algorithms.