Arturo Merino


Office 520

Straße des 17. Juni 136

10623 Berlin, Germany

I’m a fourth year math PhD student at TU Berlin, where I am advised by Torsten Mütze and take part of the Combinatorial Optimization and Graph Algorithms group. Before that, I did a masters degree on applied math at Universidad de Chile under the guidance of José Soto.

Research Interests: I am interested in algorithmic design and, broadly speaking, in discrete mathematics. Lately, I’ve been focused on the design of generation/enumeration algorithms; that is, algorithms which ouput all solutions to a computational problem, instead of only one. More specifically, I’ve been interested in generation algorithms that perform local operations (aka combinatorial Gray codes) and their interplay with combinatorics, discrete geometry, symmetry, and algebra.

Selected publications

  1. Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and  Namrata
    In Proc. 55th ACM Symposium on Theory of Computing, 2023
  2. Zigzagging Through Acyclic Orientations of Graphs and Hypergraphs
    Jean CardinalHung P. Hoang, Arturo Merino, and Torsten Mütze
    In Proc. 34th ACM-SIAM Symposium on Discrete Algorithms, 2023
  3. The Hamilton Compression of Highly Symmetric Graphs
    Petr Gregor, Arturo Merino, and Torsten Mütze
    In Proc. 47th International Symposium on Mathematical Foundations of Computer Science, 2022
    ⭐ Best paper award!
  4. On a Combinatorial Generation Problem of Knuth
    Arturo Merino, Ondřej Mička, and Torsten Mütze
    SIAM Journal on Computing, 2022
    An extended abstract was presented at SODA 2021