Arturo Merino

arturo.jpeg

I am an Assistant Professor in the CS department at the University of Chile. Before that, I was an Assistant Professor at the University of O’Higgins and a postdoc in Karl Bringmann’s group at Saarland University. I received my PhD from TU Berlin, where I was advised by Torsten Mütze as part of the Combinatorial Optimization and Graph Algorithms group.

Research Interests:
Broadly, my research lies in the theoretical foundations of computer science and discrete mathematics, with a focus on algorithm design and analysis. While my primary 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 particularly interested in unifying paradigms, often through the lens of discrete geometry.

Contact: [firstname initial][surname]@dcc.uchile.cl

Address: office N313, Beauchef 851, Santiago.

News

09 Mar 2026 Participated in the workshop “Algorithms, Combinatorics and Geometry”.
12 Feb 2026 New preprint: Combinatorial Perpetual Scheduling!
22 Jan 2026 Visit by Benjamin Berendsohn

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