Publications

Publications in reverse chronological order.

2026

  1. EJC
    Combinatorial Generation via Permutation Languages. VII. Supersolvable hyperplane arrangements
    Sofia Brenner, Jean Cardinal, Arturo Merino, Thomas McConville, and Torsten Mütze
    European Journal of Combinatorics, 2026
    DOI arXiv
  2. E-JC
    Minimum Maximal Matchings in Permutahedra
    Sofia Brenner, Jiři Fink, Hung P. Hoang, Arturo Merino, and Vincent Pilaud
    The Electronic Journal of Combinatorics, 2026
    DOI arXiv
  3. DM
    Generating All Invertible Matrices by Row Operations
    Petr Gregor, Hung P. Hoang, Arturo Merino, and Ondřej Mička
    Discrete Mathematics, 2026
    DOI arXiv
  4. SODA 2026
    Traversing Regions of Supersolvable Hyperplane Arrangements and Their Lattice Quotients
    Sofia Brenner, Jean Cardinal, Arturo Merino, Thomas McConville, and Torsten Mütze
    In Proc. 37th SIAM Symposium on Discrete Algorithms, 2026
    DOI arXiv
  5. SODA 2026
    Listing Faces of Polytopes
    Nastaran Behrooznia, Sofia Brenner, Arturo Merino, Torsten Mütze, Christian Rieck, and Francesco Verciani
    In Proc. 37th SIAM Symposium on Discrete Algorithms, 2026
    DOI arXiv
  6. ICALP 2026
    Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
    Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen, and Kevin Schewior
    In Proc. 53rd EATCS International Colloquium on Automata, Languages, and Programming, 2026
    arXiv
  7. FUN 2026
    A Demigod’s Number for the Rubik’s Cube
    Arturo Merino and Bernardo Subercaseaux
    In Proc. 13th International Conference on Fun with Algorithms, 2026
    DOI arXiv
  8. IWOCA 2026
    Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
    Christoph Dürr, Arturo Merino, José A. Soto, and José Verschae
    In Proc. 37th International Workshop on Combinatorial Algorithms, 2026
    DOI arXiv
  9. ESA 2026
    Strategyproof Mechanisms Without Money for 2-Exchange Systems
    Javier Cembrano, Max Klimm, Martin Knaack, and Arturo Merino
    In Proc. 34th Annual European Symposium on Algorithms, 2026

2025

  1. Adv
    Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and Namrata
    Advances in Mathematics, 2025
    DOI arXiv
  2. DM
    Graphs that Admit a Hamiltonian Path are Cup-Stackable
    Petr Gregor, Arturo Merino, Torsten Mütze, and Francesco Verciani
    Discrete Mathematics, 2025
    DOI arXiv
  3. FCT 2025
    Computing Diverse and Nice Triangulations
    Waldo Gálvez, Mayank Goswami, Arturo Merino, Gi Beom Park, and Meng-Tsung Tsai
    In Proc. 25th International Symposium on Fundamentals of Computation Theory, 2025
    Awarded DOI arXiv
  4. 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, and Victor Verdugo
    arXiv preprint, 2025
    arXiv

2024

  1. SICOMP
    Traversing Combinatorial 0/1-Polytopes via Optimization
    Arturo Merino and Torsten Mütze
    SIAM Journal on Computing, 2024
    DOI arXiv
  2. TALG
    Combinatorial Generation via Permutation Languages. IV. Elimination trees
    Jean Cardinal, Arturo Merino, and Torsten Mütze
    ACM Transactions on Algorithms, 2024
    DOI arXiv
  3. TALG
    On the Two-Dimensional Knapsack Problem for Convex Polygons
    Arturo Merino and Andreas Wiese
    ACM Transactions on Algorithms, 2024
    DOI arXiv
  4. WINE 2024
    Impartial Selection under Combinatorial Constraints
    Javier Cembrano, Max Klimm, and Arturo Merino
    In Proc. 20th Workshop on Internet and Network Economics, 2024
    DOI arXiv
  5. ISAAC 2024
    Generating All Invertible Matrices by Row Operations
    Petr Gregor, Hung P. Hoang, Arturo Merino, and Ondřej Mička
    In Proc. 35th International Symposium on Algorithms and Computation, 2024
    DOI arXiv
  6. WALCOM 2024
    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
    DOI arXiv

2023

  1. 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
    DOI arXiv
  2. AOCO
    The Hamilton Compression of Highly Symmetric Graphs
    Petr Gregor, Arturo Merino, and Torsten Mütze
    Annals of Combinatorics, 2023
    DOI arXiv
  3. JGT
    Star Transposition Gray Codes for Multiset Permutations
    Petr Gregor, Arturo Merino, and Torsten Mütze
    Journal of Graph Theory, 2023
    DOI arXiv
  4. FOCS 2023
    Traversing Combinatorial 0/1-Polytopes via Optimization
    Arturo Merino and Torsten Mütze
    In Proc. 64th IEEE Symposium on Foundations of Computer Science, 2023
    DOI arXiv
  5. STOC 2023
    Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and Namrata
    In Proc. 55th ACM Symposium on Theory of Computing, 2023
    DOI arXiv
  6. SODA 2023
    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
    DOI arXiv

2022

  1. DCG
    Combinatorial Generation via Permutation Languages. III. Rectangulations
    Arturo Merino and Torsten Mütze
    Discrete & Computational Geometry, 2022
    DOI arXiv
  2. SICOMP
    On a Combinatorial Generation Problem of Knuth
    Arturo Merino, Ondřej Mička, and Torsten Mütze
    SIAM Journal on Computing, 2022
    DOI arXiv
  3. MFCS 2022
    The Hamilton Compression of Highly Symmetric Graphs
    Petr Gregor, Arturo Merino, and Torsten Mütze
    In Proc. 47th Mathematical Foundations of Computer Science, 2022
    Awarded DOI arXiv
  4. FUN 2022
    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
  5. STACS 2022
    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
    DOI arXiv
  6. SODA 2022
    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
    DOI arXiv

2021

  1. SoCG 2021
    Efficient Generation of Rectangulations via Permutation Languages
    Arturo Merino and Torsten Mütze
    In Proc. 37th Symposium on Computational Geometry, 2021
    DOI arXiv
  2. SODA 2021
    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
    DOI arXiv

2020

  1. ICALP 2020
    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
    DOI arXiv

2019

  1. ICALP 2019
    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
    DOI arXiv