Arturo Merino

arturo.jpeg

I am an assistant professor at the Engineering Institute of Universidad de O’Higgins. Before that, I was a postdoc in Karl Bringmann’s group at Saarland University. I did my PhD at TU Berlin, where I was advised by Torsten Mütze and took part of the Combinatorial Optimization and Graph Algorithms group. I also did a masters degree on applied math at Universidad de Chile under the guidance of José Soto.

Research Interests:
Broadly, my interests lie in the theoretical foundations of computer science and discrete mathematics, with a focus on the design and analysis of algorithms. While most of my work centers on enumeration and generation, I am also drawn to problems in approximation, algorithmic game theory, combinatorics, fine-grained algorithms, and computation under uncertainty. I am especially interested in unifying paradigms, often through the lens of discrete geometry.

Contact: [name].[surname]@uoh.cl

Address: office 519, Building B, Universidad de O’Higgins, Rancagua, Chile.

News

15 Dec 2025 Gave a talk on our paper “Listing Faces of Polytopes” at the Workshop on Optimization and Algorithms
22 Oct 2025 Our paper “Generating all invertible matrices by row operations” was accepted in Discrete Mathematics! 🎉
03 Oct 2025 Our paper “Traversing regions of supersolvable hyperplane arrangements and their lattice quotients” was accepted at SODA 2026! 🎉

Selected publications

  1. Listing Faces of Polytopes
    In Proc. 37th SIAM Symposium on Discrete Algorithms, 2026
  2. Computing Diverse and Nice Triangulations
    Waldo Gálvez, Mayank Goswami, Arturo Merino, Gi Beom Park, and Meng-Tsung Tsai
    In Proc. 25th Intenational Symposium on Fundamentals of Computation Theory, 2025
  3. Traversing Combinatorial 0/1-Polytopes via Optimization
    Arturo Merino and Torsten Mütze
    In Proc. 64th IEEE Symposium on Foundations of Computer Science, 2023
  4. Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and Namrata
    In Proc. 55th ACM Symposium on Theory of Computing, 2023
  5. The Hamilton Compression of Highly Symmetric Graphs
    Petr Gregor, Arturo Merino, and Torsten Mütze
    In Proc. 47th Mathematical Foundations of Computer Science, 2022