2023 FOCS Traversing Combinatorial 0/1-Polytopes via Optimization Arturo Merino, and Torsten Mütze In Proc. 64th IEEE Symposium on the Foundations of Computer Science, 2023 arXiv 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 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 ACM-SIAM Symposium on Discrete Algorithms, 2023 arXiv combos 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 DCG Combinatorial Generation via Permutation Languages. III. Rectangulations Arturo Merino, and Torsten Mütze Discrete and Computational Geometry, 2022 An extended abstract was presented at SoCG 2021 arXiv combos DOI MFCS The Hamilton Compression of Highly Symmetric Graphs Petr Gregor, Arturo Merino, and Torsten Mütze In Proc. 47th International Symposium on Mathematical Foundations of Computer Science, 2022 ⭐ Best paper award! arXiv DOI FUN All Your Bases 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 International Symposium on Theoretical Aspects of Computer Science, 2022 arXiv 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 SODA Efficient Generation of Elimination Trees and Graph Aassociahedra Jean Cardinal, Arturo Merino, and Torsten Mütze In Proc. 33rd ACM-SIAM Symposium on Discrete Algorithms, 2022 arXiv combos DOI 2021 SoCG Efficient Generation of Rectangulations via Permutation Languages Arturo Merino, and Torsten Mütze In Proc. 37th International 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 ACM-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