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: [second-level domain of this website]@dcc.uchile.cl

Address: office N313, Beauchef 851, Santiago.

If you are a student interested in the topics I work on, the foundations of computer science, or discrete mathematics, do not hesitate to reach out.

News

20 Apr 2026 Our paper “Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules” was accepted at ICALP 2026! 🎉
17 Apr 2026 From April 22 to 24, 2026, together with Nicolás Sanhueza, we will be organizing the Discrete Mathematics, Algorithms, and Combinatorics session at JMZS 2026. We have an excellent lineup of speakers; you can check the program here.
13 Apr 2026 Our paper “Minimum Maximal Matchings in Permutahedra” was accepted in Discrete Mathematics! 🎉
26 Mar 2026 Our paper “Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds” was accepted at IWOCA 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 International 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