Arturo I. Merino

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 26

Top Topics

Top Venues

Publications

Arturo I. Merino, Namrata, Aaron Williams
On the Hardness of Gray Code Problems for Combinatorial Objects. WALCOM (2024)
Arturo I. Merino, Namrata, Aaron Williams
On the Hardness of Gray Code Problems for Combinatorial Objects. CoRR (2024)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Torsten Mütze
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA (2023)
Arturo I. Merino, Torsten Mütze
Combinatorial Generation via Permutation Languages. III. Rectangulations. Discret. Comput. Geom. 70 (1) (2023)
Arturo I. Merino, Torsten Mütze
Traversing combinatorial 0/1-polytopes via optimization. FOCS (2023)
Arturo I. Merino, Torsten Mütze
Traversing combinatorial 0/1-polytopes via optimization. CoRR (2023)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37 (3) (2023)
Arturo I. Merino, Torsten Mütze, Namrata
Kneser Graphs Are Hamiltonian. STOC (2023)
Petr Gregor, Arturo I. Merino, Torsten Mütze
Star transposition Gray codes for multiset permutations. J. Graph Theory 103 (2) (2023)
Petr Gregor, Arturo I. Merino, Torsten Mütze
The Hamilton compression of highly symmetric graphs. CoRR (2022)
Arturo I. Merino, Ondrej Micka, Torsten Mütze
On a Combinatorial Generation Problem of Knuth. SIAM J. Comput. 51 (3) (2022)
Petr Gregor, Torsten Mütze, Arturo I. Merino
Star Transposition Gray Codes for Multiset Permutations. STACS (2022)
Arturo I. Merino, Torsten Mütze, Aaron Williams
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. FUN (2022)
Jean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Ondrej Micka, Torsten Mütze
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR (2022)
Petr Gregor, Arturo I. Merino, Torsten Mütze
The Hamilton Compression of Highly Symmetric Graphs. MFCS (2022)
Jean Cardinal, Arturo I. Merino, Torsten Mütze
Efficient generation of elimination trees and graph associahedra. SODA (2022)
Jean Cardinal, Arturo I. Merino, Torsten Mütze
Combinatorial generation via permutation languages. IV. Elimination trees. CoRR (2021)
Arturo I. Merino, Torsten Mütze
Combinatorial generation via permutation languages. III. Rectangulations. CoRR (2021)
Petr Gregor, Arturo I. Merino, Torsten Mütze
Star transposition Gray codes for multiset permutations. CoRR (2021)
Arturo I. Merino, Torsten Mütze
Efficient Generation of Rectangulations via Permutation Languages. SoCG (2021)
Arturo I. Merino, Ondrej Micka, Torsten Mütze
On a combinatorial generation problem of Knuth. SODA (2021)
Arturo I. Merino, Ondrej Micka, Torsten Mütze
On a combinatorial generation problem of Knuth. CoRR (2020)
Arturo I. Merino, Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons. CoRR (2020)
Arturo I. Merino, Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons. ICALP (2020)
Arturo I. Merino, José A. Soto
The minimum cost query problem on matroids with uncertainty areas. CoRR (2019)
Arturo I. Merino, José A. Soto
The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ICALP (2019)