2024 arXiv Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds Christoph Dürr, Arturo Merino, José A. Soto, and José Verschae arXiv preprint, 2024 arXiv arXiv Graphs that Admit a Hamiltonian Path are Cup-Stackable Petr Gregor, Arturo Merino, Torsten Mütze, and Francesco Verciani arXiv preprint, 2024 arXiv WINE Impartial Selection under Combinatorial Constraints Javier Cembrano, Max Klimm, and Arturo Merino To appear in Proc. 20th Workshop on Internet and Network Economics, 2024 arXiv ISAAC Generating All Invertible Matrices by Row Operations Petr Gregor, Hung P. Hoang, Arturo Merino, and Ondřej Mička To appear in Proc. 35th International Symposium on Algorithms and Computation, 2024 arXiv WALCOM On the Hardness of Gray Code Problems for Combinatorial Objects Arturo Merino, Namrata, and Aaron Williams In Proc. 18th Workshop on Algorithms and Computation, 2024 arXiv DOI SICOMP Traversing Combinatorial 0/1-Polytopes via Optimization Arturo Merino, and Torsten Mütze SIAM Journal on Computing, 2024 An extended abstract was presented at FOCS 2023 arXiv DOI TALG Combinatorial Generation via Permutation Languages. IV. Elimination trees Jean Cardinal, Arturo Merino, and Torsten Mütze To appear in ACM Transactions on Algorithms, 2024 An extended abstract was presented at SODA 2022 arXiv TALG On the Two-Dimensional Knapsack Problem for Convex Polygons Arturo Merino, and Andreas Wiese ACM Transactions on Algorithms, 2024 An extended abstract was presented at ICALP 2020 arXiv DOI 2023 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 STOC Kneser Graphs are Hamiltonian Arturo Merino, Torsten Mütze, and Namrata In Proc. 55th ACM Symposium on Theory of Computing, 2023 arXiv DOI 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 SIDMA Combinatorial Generation via Permutation Languages. V. Acyclic orientations Jean Cardinal, Hung P. Hoang, Arturo Merino, Ondřej Mička, and Torsten Mütze SIAM Journal on Discrete Mathematics, 2023 An extended abstract was presented at SODA 2023 arXiv combos DOI AOCO The Hamilton Compression of Highly Symmetric Graphs Petr Gregor, Arturo Merino, and Torsten Mütze Annals of Combinatorics, 2023 An extended abstract was presented at MFCS 2022 arXiv DOI JGT Star Transposition Gray Codes for Multiset Permutations Petr Gregor, Arturo Merino, and Torsten Mütze Journal of Graph Theory, 2023 An extended abstract was presented at STACS 2022 arXiv DOI 2022 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 FUN All Your Base(s) Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges Arturo Merino, Torsten Mütze, and Aaron Williams In Proc. 11th International Conference on Fun with Algorithms, 2022 DOI STACS Star Transposition Gray Codes for Multiset Permutations Petr Gregor, Arturo Merino, and Torsten Mütze In Proc. 39th Symposium on Theoretical Aspects of Computer Science, 2022 arXiv DOI SODA Efficient Generation of Elimination Trees and Graph Associahedra Jean Cardinal, Arturo Merino, and Torsten Mütze In Proc. 33rd SIAM Symposium on Discrete Algorithms, 2022 arXiv DOI DCG Combinatorial Generation via Permutation Languages. III. Rectangulations Arturo Merino, and Torsten Mütze Discrete & Computational Geometry, 2022 An extended abstract was presented at SoCG 2021 arXiv combos DOI SICOMP On a Combinatorial Generation Problem of Knuth Arturo Merino, Ondřej Mička, and Torsten Mütze SIAM Journal on Computing, 2022 An extended abstract was presented at SODA 2021 arXiv combos DOI 2021 SoCG Efficient Generation of Rectangulations via Permutation Languages Arturo Merino, and Torsten Mütze In Proc. 37th Symposium on Computational Geometry, 2021 arXiv combos DOI SODA On a Combinatorial Generation Problem of Knuth Arturo Merino, Ondřej Mička, and Torsten Mütze In Proc. 32nd SIAM Symposium on Discrete Algorithms, 2021 arXiv combos DOI 2020 ICALP On the Two-Dimensional Knapsack Problem for Convex Polygons Arturo Merino, and Andreas Wiese In Proc. 47th International Colloquium on Automata, Languages, and Programming, 2020 arXiv DOI 2019 ICALP The Minimum Cost Query Problem on Matroids with Uncertainty Areas Arturo Merino, and José A. Soto In Proc. 46th International Colloquium on Automata, Languages, and Programming, 2019 arXiv DOI