Two papers from our group accepted at ICALP 2025

Two papers from our group have been accepted at the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP)

• K. Encz, M. Mastrolilli, and E. Vercesi. “Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes”.
  Preprint available on arXiv.
• A. Bortolotti, M. Mastrolilli, and L. F. Vargas. “On the Degree Automatability of Sum-of-Squares Proofs”.
  Preprint available on arXiv.