Arturo Merino

arturo.jpeg

I am an assistant professor at the Universidad de O’Higgins. Before that, I was a postdoc in Karl Bringmann’s group at Saarland University. 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. I also 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. FOCS
    Traversing Combinatorial 0/1-Polytopes via Optimization
    Arturo Merino, and Torsten Mütze
    In Proc. 64th IEEE Symposium on Foundations of Computer Science, 2023
    arXiv DOI
  2. STOC
    Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and  Namrata
    In Proc. 55th ACM Symposium on Theory of Computing, 2023
    arXiv DOI
  3. SODA
    Zigzagging Through Acyclic Orientations of Graphs and Hypergraphs
    Jean Cardinal, Hung P. Hoang, Arturo Merino, and Torsten Mütze
    In Proc. 34th SIAM Symposium on Discrete Algorithms, 2023
    arXiv combos DOI
  4. MFCS
    The Hamilton Compression of Highly Symmetric Graphs
    Petr Gregor, Arturo Merino, and Torsten Mütze
    In Proc. 47th Mathematical Foundations of Computer Science, 2022
    ⭐ Best paper award!!
    arXiv DOI