2025 arXiv Computing Diverse and Nice Triangulations Waldo Gálvez, Mayank Goswami, Arturo Merino, Gi Beom Park, y Meng-Tsung Tsai arXiv preprint, 2025 arXiv arXiv Minimum Maximal Matchings in Permutahedra Sofia Brenner, Jiři Fink, Hung P. Hoang, Arturo Merino, y Vincent Pilaud arXiv preprint, 2025 arXiv arXiv An Easier to Trust Demi-God Number for the Rubik’s Cube Arturo Merino y Bernardo Subercaseaux arXiv preprint, 2025 arXiv arXiv A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions Waldo Gálvez, Mayank Goswami, Arturo Merino, Gi Beom Park, Meng-Tsung Tsai, y Victor Verdugo arXiv preprint, 2025 arXiv DM Graphs that Admit a Hamiltonian Path are Cup-Stackable Petr Gregor, Arturo Merino, Torsten Mütze, y Francesco Verciani Discrete Mathematics, 2025 DOI arXiv Adv Kneser Graphs are Hamiltonian Arturo Merino, Torsten Mütze, y Namrata Advances in Mathematics, 2025 DOI arXiv 2024 arXiv Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds Christoph Dürr, Arturo Merino, José A. Soto, y José Verschae arXiv preprint, 2024 arXiv WINE 2024 Impartial Selection under Combinatorial Constraints Javier Cembrano, Max Klimm, y Arturo Merino In Proc. 20th Workshop on Internet and Network Economics, 2024 arXiv ISAAC 2024 Generating All Invertible Matrices by Row Operations Petr Gregor, Hung P. Hoang, Arturo Merino, y Ondřej Mička In Proc. 35th International Symposium on Algorithms and Computation, 2024 DOI arXiv WALCOM 2024 On the Hardness of Gray Code Problems for Combinatorial Objects Arturo Merino, Namrata, y Aaron Williams In Proc. 18th Workshop on Algorithms and Computation, 2024 DOI arXiv SICOMP Traversing Combinatorial 0/1-Polytopes via Optimization Arturo Merino y Torsten Mütze SIAM Journal on Computing, 2024 DOI arXiv TALG Combinatorial Generation via Permutation Languages. IV. Elimination trees Jean Cardinal, Arturo Merino, y Torsten Mütze ACM Transactions on Algorithms, 2024 DOI arXiv TALG On the Two-Dimensional Knapsack Problem for Convex Polygons Arturo Merino y Andreas Wiese ACM Transactions on Algorithms, 2024 DOI arXiv 2023 FOCS 2023 Traversing Combinatorial 0/1-Polytopes via Optimization Arturo Merino y Torsten Mütze In Proc. 64th IEEE Symposium on Foundations of Computer Science, 2023 DOI arXiv STOC 2023 Kneser Graphs are Hamiltonian Arturo Merino, Torsten Mütze, y Namrata In Proc. 55th ACM Symposium on Theory of Computing, 2023 DOI arXiv SODA 2023 Zigzagging Through Acyclic Orientations of Graphs and Hypergraphs Jean Cardinal, Hung P. Hoang, Arturo Merino, y Torsten Mütze In Proc. 34th SIAM Symposium on Discrete Algorithms, 2023 DOI arXiv SIDMA Combinatorial Generation via Permutation Languages. V. Acyclic orientations Jean Cardinal, Hung P. Hoang, Arturo Merino, Ondřej Mička, y Torsten Mütze SIAM Journal on Discrete Mathematics, 2023 DOI arXiv AOCO The Hamilton Compression of Highly Symmetric Graphs Petr Gregor, Arturo Merino, y Torsten Mütze Annals of Combinatorics, 2023 DOI arXiv JGT Star Transposition Gray Codes for Multiset Permutations Petr Gregor, Arturo Merino, y Torsten Mütze Journal of Graph Theory, 2023 DOI arXiv 2022 MFCS 2022 The Hamilton Compression of Highly Symmetric Graphs Petr Gregor, Arturo Merino, y Torsten Mütze In Proc. 47th Mathematical Foundations of Computer Science, 2022 Awarded DOI arXiv MFCS 2022 best paper award FUN 2022 All Your Base(s) Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges Arturo Merino, Torsten Mütze, y Aaron Williams In Proc. 11th International Conference on Fun with Algorithms, 2022 DOI STACS 2022 Star Transposition Gray Codes for Multiset Permutations Petr Gregor, Arturo Merino, y Torsten Mütze In Proc. 39th Symposium on Theoretical Aspects of Computer Science, 2022 DOI arXiv SODA 2022 Efficient Generation of Elimination Trees and Graph Associahedra Jean Cardinal, Arturo Merino, y Torsten Mütze In Proc. 33rd SIAM Symposium on Discrete Algorithms, 2022 DOI arXiv DCG Combinatorial Generation via Permutation Languages. III. Rectangulations Arturo Merino y Torsten Mütze Discrete & Computational Geometry, 2022 DOI arXiv SICOMP On a Combinatorial Generation Problem of Knuth Arturo Merino, Ondřej Mička, y Torsten Mütze SIAM Journal on Computing, 2022 DOI arXiv 2021 SoCG 2021 Efficient Generation of Rectangulations via Permutation Languages Arturo Merino y Torsten Mütze In Proc. 37th Symposium on Computational Geometry, 2021 DOI arXiv SODA 2021 On a Combinatorial Generation Problem of Knuth Arturo Merino, Ondřej Mička, y Torsten Mütze In Proc. 32nd SIAM Symposium on Discrete Algorithms, 2021 DOI arXiv 2020 ICALP 2020 On the Two-Dimensional Knapsack Problem for Convex Polygons Arturo Merino y Andreas Wiese In Proc. 47th International Colloquium on Automata, Languages, and Programming, 2020 DOI arXiv 2019 ICALP 2019 The Minimum Cost Query Problem on Matroids with Uncertainty Areas Arturo Merino y José A. Soto In Proc. 46th International Colloquium on Automata, Languages, and Programming, 2019 DOI arXiv