The Minimum Cost Query Problem on Matroids with Uncertainty Areas. - Arturo Merino; José A. Soto (ICALP, 2019)

Efficient Generation of Rectangulations via Permutation Languages. - Arturo Merino; Torsten Mütze (SoCG, 2021)

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. - Arturo Merino; Torsten Mütze; Aaron Williams 001 (FUN, 2022)

The Hamilton Compression of Highly Symmetric Graphs. - Petr Gregor; Arturo Merino; Torsten Mütze (MFCS, 2022)

Efficient generation of elimination trees and graph associahedra. - Jean Cardinal; Arturo Merino; Torsten Mütze (SODA, 2022)

On a Combinatorial Generation Problem of Knuth. - Arturo Merino; Ondrej Micka; Torsten Mütze (SIAM J. Comput., 2022)

Zigzagging through acyclic orientations of chordal graphs and hypergraphs. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Torsten Mütze (SODA, 2023)

Kneser Graphs Are Hamiltonian. - Arturo Merino; Torsten Mütze; Namrata (STOC, 2023)

Combinatorial generation: greedy approaches and symmetry (Kombinatorische Generierung: Greedy-Ansätze und Symmetrie) - Arturo Merino (2023)

Star transposition Gray codes for multiset permutations. - Petr Gregor; Arturo Merino; Torsten Mütze (J. Graph Theory, 2023)

Combinatorial Generation via Permutation Languages. III. Rectangulations. - Arturo Merino; Torsten Mütze (Discret. Comput. Geom., 2023)

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. - Jean Cardinal; Hung Phuc Hoang; Arturo Merino; Ondrej Micka; Torsten Mütze (SIAM J. Discret. Math., 2023)

Generating All Invertible Matrices by Row Operations. - Petr Gregor; Hung P. Hoang 001; Arturo Merino; Ondrej Micka (ISAAC, 2024)

On the Hardness of Gray Code Problems for Combinatorial Objects. - Arturo Merino; Namrata; Aaron Williams 001 (WALCOM, 2024)

Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds. - Christoph Dürr; Arturo Merino; José A. Soto; José Verschae (CoRR, 2024)

Impartial Selection Under Combinatorial Constraints. - Javier Cembrano; Max Klimm; Arturo Merino (CoRR, 2024)

Traversing Combinatorial 0/1-Polytopes via Optimization. - Arturo Merino; Torsten Mütze (SIAM J. Comput., 2024)

On the Two-Dimensional Knapsack Problem for Convex Polygons. - Arturo Merino; Andreas Wiese (ACM Trans. Algorithms, 2024)

Graphs that admit a Hamilton path are cup-stackable. - Petr Gregor; Arturo Merino; Torsten Mütze; Francesco Verciani (Discret. Math., 2025)

A Demigod's Number for the Rubik's Cube. - Arturo Merino; Bernardo Subercaseaux (CoRR, 2025)

A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions. - Waldo Gálvez; Mayank Goswami 001; Arturo Merino; GiBeom Park; Meng-Tsung Tsai; Victor Verdugo (CoRR, 2025)

Combinatorial Generation via Permutation Languages. IV. Elimination Trees. - Jean Cardinal; Arturo Merino; Torsten Mütze (ACM Trans. Algorithms, 2025)

Computing Diverse and Nice Triangulations. - Waldo Gálvez; Mayank Goswami 001; Arturo Merino; GiBeom Park; Meng-Tsung Tsai (CoRR, 2025)