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

27 Jul 2026 Visited Christoph Hertrich at UTN!
20 Jul 2026 New preprint: “Faster and simpler traversal of 0/1-polytopes” with Jiří Fink, Petr Hladík, Ondřej Mička, and Torsten Mütze!
20 Jul 2026 Visited Hung Hoang at TU Wien!
13 Jul 2026 Attended the 19th Emléktábla Workshop on Matroid Theory.

Selected publications

  1. Listing Faces of Polytopes
    In Proc. 37th SIAM Symposium on Discrete Algorithms, 2026
  2. Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
    In Proc. 53rd EATCS International Colloquium on Automata, Languages, and Programming, 2026
  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