Arturo Merino

According to our database, Arturo Merino authored at least 19 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the Two-Dimensional Knapsack Problem for Convex Polygons.

Arturo Merino, Andreas Wiese

ACM Trans. Algorithms, April, 2024

Traversing Combinatorial 0/1-Polytopes via Optimization.

Arturo Merino, Torsten Mütze

SIAM J. Comput., 2024

Impartial Selection Under Combinatorial Constraints.

Javier Cembrano, Max Klimm, Arturo Merino

CoRR, 2024

Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds.

Christoph Dürr, Arturo Merino, José A. Soto, José Verschae

CoRR, 2024

On the Hardness of Gray Code Problems for Combinatorial Objects.

Arturo Merino, Namrata, Aaron Williams

Proceedings of the WALCOM: Algorithms and Computation, 2024

Generating All Invertible Matrices by Row Operations.

Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.

Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze

SIAM J. Discret. Math., September, 2023

Combinatorial Generation via Permutation Languages. III. Rectangulations.

Arturo Merino, Torsten Mütze

Discret. Comput. Geom., July, 2023

Star transposition Gray codes for multiset permutations.

Petr Gregor, Arturo Merino, Torsten Mütze

J. Graph Theory, June, 2023

Combinatorial generation: greedy approaches and symmetry (Kombinatorische Generierung: Greedy-Ansätze und Symmetrie)

Arturo Merino

PhD thesis, 2023

Kneser Graphs Are Hamiltonian.

Arturo Merino, Torsten Mütze, Namrata

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Zigzagging through acyclic orientations of chordal graphs and hypergraphs.

Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

On a Combinatorial Generation Problem of Knuth.

Arturo Merino, Ondrej Micka, Torsten Mütze

SIAM J. Comput., 2022

Efficient generation of elimination trees and graph associahedra.

Jean Cardinal, Arturo Merino, Torsten Mütze

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Hamilton Compression of Highly Symmetric Graphs.

Petr Gregor, Arturo Merino, Torsten Mütze

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.

Arturo Merino, Torsten Mütze, Aaron Williams

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Combinatorial generation via permutation languages. IV. Elimination trees.

Jean Cardinal, Arturo Merino, Torsten Mütze

CoRR, 2021

Efficient Generation of Rectangulations via Permutation Languages.

Arturo Merino, Torsten Mütze

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2019

The Minimum Cost Query Problem on Matroids with Uncertainty Areas.

Arturo Merino, José A. Soto

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019