Publicaciones

Publicaciones en orden cronológico reverso.

2023

  1. 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
  2. Combinatorial Generation via Permutation Languages. V. Acyclic orientations
    SIAM Journal on Discrete Mathematics, 2023
    An extended abstract was presented at SODA 2023
  3. Kneser Graphs are Hamiltonian
    Arturo Merino, Torsten Mütze, and  Namrata
    In Proc. 55th ACM Symposium on Theory of Computing, 2023
  4. Zigzagging Through Acyclic Orientations of Graphs and Hypergraphs
    Jean CardinalHung P. Hoang, Arturo Merino, and Torsten Mütze
    In Proc. 34th ACM-SIAM Symposium on Discrete Algorithms, 2023
  5. 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

2022

  1. 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
  2. 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!
  3. 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
  4. 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
  5. 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
  6. 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

2021

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

2020

  1. 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

2019

  1. 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