Arturo Merino

merino.jpg

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: Broadly speaking, I am interested in the design of algorithms and discrete mathematics in general. Lately, I’ve been focused on the design of generation 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. The Hamilton Compression of Highly Symmetric Graphs
    Petr GregorArturo Merino, and Torsten Mütze
    In Proc. 47th International Symposium on Mathematical Foundations of Computer Science, 2022
    ⭐ Best paper award!
  2. On a Combinatorial Generation Problem of Knuth
    Arturo MerinoOndřej Mička, and Torsten Mütze
    SIAM Journal on Computing, 2022
    An extended abstract was presented at SODA 2021
  3. Efficient generation of elimination trees and graph associahedra
    Jean CardinalArturo Merino, and Torsten Mütze
    In Proc. 33rd ACM-SIAM Symposium on Discrete Algorithms, 2022