Arturo Merino


Office 425

Saarland Informatics Campus E1.3

66123 Saarbrücken, Germany

I am currently a postdoc in Karl Bringmann’s group at the University of Saarland. Before that, 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. Even 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. Traversing Combinatorial 0/1-Polytopes via Optimization
    Arturo Merino, and Torsten Mütze
    In Proc. 64th IEEE Symposium on the Foundations of Computer Science, 2023
  2. Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and  Namrata
    In Proc. 55th ACM Symposium on Theory of Computing, 2023
  3. 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
  4. 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!