Följ
Arturo Merino
Arturo Merino
Andra namnArturo I. Merino, Arturo Ignacio Merino Figueroa
Universidad de O'Higgins
Verifierad e-postadress på uoh.cl - Startsida
Titel
Citeras av
Citeras av
År
Efficient generation of rectangulations via permutation languages
A Merino, T Mütze
37th International Symposium on Computational Geometry (SoCG 2021), 2021
34*2021
Efficient generation of elimination trees and graph associahedra
J Cardinal, A Merino, T Mütze
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
24*2022
Kneser graphs are Hamiltonian
A Merino, T Mütze, Namrata
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 963-970, 2023
182023
The minimum cost query problem on matroids with uncertainty areas
AI Merino, JA Soto
arXiv preprint arXiv:1904.11668, 2019
132019
On the Two-Dimensional Knapsack Problem for Convex Polygons
A Merino, A Wiese
ACM Transactions on Algorithms 20 (2), 1-38, 2024
12*2024
All your bases are belong to us: listing all bases of a matroid by greedy exchanges
A Merino, T Mutze, A Williams
11th International Conference on Fun with Algorithms (FUN 2022) 226, 22, 2022
102022
On a combinatorial generation problem of Knuth
A Merino, O Micka, T Mütze
SIAM Journal on Computing 51 (3), 379-423, 2022
92022
Traversing combinatorial 0/1-polytopes via optimization
A Merino, T Mütze
SIAM Journal on Computing 53 (5), 1257-1292, 2024
82024
Zigzagging through acyclic orientations of chordal graphs and hypergraphs
J Cardinal, HP Hoang, A Merino, T Mütze
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
8*2023
The Hamilton compression of highly symmetric graphs
P Gregor, A Merino, T Mütze
Annals of Combinatorics 28 (2), 379-437, 2024
62024
Star transposition Gray codes for multiset permutations
P Gregor, A Merino, T Mütze
Journal of Graph Theory 103 (2), 212-270, 2023
62023
On the Hardness of Gray Code Problems for Combinatorial Objects
A Merino, Namrata, A Williams
International Conference and Workshops on Algorithms and Computation, 103-117, 2024
12024
Graphs that admit a Hamilton path are cup-stackable
P Gregor, A Merino, T Mütze, F Verciani
Discrete Mathematics 348 (5), 114375, 2025
2025
Minimum maximal matchings in permutahedra
S Brenner, J Fink, H Hoang, A Merino, V Pilaud
arXiv preprint arXiv:2502.09968, 2025
2025
A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions
W Gálvez, M Goswami, A Merino, GB Park, MT Tsai, V Verdugo
arXiv preprint arXiv:2501.12261, 2025
2025
A Demigod's Number for the Rubik's Cube
A Merino, B Subercaseaux
arXiv preprint arXiv:2501.00144, 2024
2024
Facet-Hamiltonian cycles in the -permutahedron
N Behrooznia, S Brenner, A Merino, T Mütze, C Rieck, F Verciani
arXiv preprint arXiv:2412.02584, 2024
2024
Impartial Selection Under Combinatorial Constraints
J Cembrano, M Klimm, A Merino
arXiv preprint arXiv:2409.20477, 2024
2024
Generating all invertible matrices by row operations
P Gregor, HP Hoang, A Merino, O Mička
arXiv preprint arXiv:2405.01863, 2024
2024
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
C Dürr, A Merino, JA Soto, J Verschae
arXiv preprint arXiv:2404.17214, 2024
2024
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20