Arturo Merino

42 papers A* 10A 1B 4Misc 1Journal 26
YearRankTypeTitle / Venue / Authors
2026 J jnl
Combinatorial Perpetual Scheduling.
CoRR
Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen, Kevin Schewior
2026 J jnl
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements.
Eur. J. Comb.
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze
2026 J jnl
Generating all invertible matrices by row operations.
Discret. Math.
Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka
2026 A* conf
Listing faces of polytopes.
SODA
Nastaran Behrooznia, Sofia Brenner, Arturo Merino, Torsten Mütze, Christian Rieck, Francesco Verciani
2026 A* conf
Traversing regions of supersolvable hyperplane arrangements and their lattice quotients.
SODA
Sofia Brenner, Jean Cardinal, Thomas McConville, Arturo Merino, Torsten Mütze
2025 J jnl
A Demigod's Number for the Rubik's Cube.
CoRR
Arturo Merino, Bernardo Subercaseaux
2025 J jnl
A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions.
CoRR
Waldo Gálvez, Mayank Goswami, Arturo Merino, Gibeom Park, Meng-Tsung Tsai, Victor Verdugo
2025 J jnl
Combinatorial Generation via Permutation Languages. IV. Elimination Trees.
ACM Trans. Algorithms
Jean Cardinal, Arturo Merino, Torsten Mütze
2025 B conf
Computing Diverse and Nice Triangulations.
FCT
Waldo Gálvez, Mayank Goswami, Arturo Merino, Gibeom Park, Meng-Tsung Tsai
2025 J jnl
Computing Diverse and Nice Triangulations.
CoRR
Waldo Gálvez, Mayank Goswami, Arturo Merino, Gibeom Park, Meng-Tsung Tsai
2025 J jnl
Graphs that admit a Hamilton path are cup-stackable.
Discret. Math.
Petr Gregor, Arturo Merino, Torsten Mütze, Francesco Verciani
2024 B conf
Generating All Invertible Matrices by Row Operations.
ISAAC
Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka
2024 J jnl
Impartial Selection Under Combinatorial Constraints.
CoRR
Javier Cembrano, Max Klimm, Arturo Merino
2024 B conf
On the Hardness of Gray Code Problems for Combinatorial Objects.
WALCOM
Arturo Merino, Namrata, Aaron Williams
2024 J jnl
On the Hardness of Gray Code Problems for Combinatorial Objects.
CoRR
Arturo Merino, Namrata, Aaron Williams
2024 J jnl
On the Two-Dimensional Knapsack Problem for Convex Polygons.
ACM Trans. Algorithms
Arturo Merino, Andreas Wiese
2024 J jnl
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds.
CoRR
Christoph Dürr, Arturo Merino, José A. Soto, José Verschae
2024 J jnl
Traversing Combinatorial 0/1-Polytopes via Optimization.
SIAM J. Comput.
Arturo Merino, Torsten Mütze
2023 J jnl
Combinatorial Generation via Permutation Languages. III. Rectangulations.
Discret. Comput. Geom.
Arturo Merino, Torsten Mütze
2023 J jnl
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.
SIAM J. Discret. Math.
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze
2023 A* conf
Kneser Graphs Are Hamiltonian.
STOC
Arturo Merino, Torsten Mütze, Namrata
2023 J jnl
Star transposition Gray codes for multiset permutations.
J. Graph Theory
Petr Gregor, Arturo Merino, Torsten Mütze
2023 A* conf
Traversing combinatorial 0/1-polytopes via optimization.
FOCS
Arturo Merino, Torsten Mütze
2023 J jnl
Traversing combinatorial 0/1-polytopes via optimization.
CoRR
Arturo Merino, Torsten Mütze
2023 A* conf
Zigzagging through acyclic orientations of chordal graphs and hypergraphs.
SODA
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze
2022 Misc conf
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.
FUN
Arturo Merino, Torsten Mütze, Aaron Williams
2022 J jnl
Combinatorial generation via permutation languages. V. Acyclic orientations.
CoRR
Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka, Torsten Mütze
2022 A* conf
Efficient generation of elimination trees and graph associahedra.
SODA
Jean Cardinal, Arturo Merino, Torsten Mütze
2022 J jnl
On a Combinatorial Generation Problem of Knuth.
SIAM J. Comput.
Arturo Merino, Ondrej Micka, Torsten Mütze
2022 A conf
Star Transposition Gray Codes for Multiset Permutations.
STACS
Petr Gregor, Torsten Mütze, Arturo Merino
2022 B conf
The Hamilton Compression of Highly Symmetric Graphs.
MFCS
Petr Gregor, Arturo Merino, Torsten Mütze
2022 J jnl
The Hamilton compression of highly symmetric graphs.
CoRR
Petr Gregor, Arturo Merino, Torsten Mütze
2021 J jnl
Combinatorial generation via permutation languages. III. Rectangulations.
CoRR
Arturo Merino, Torsten Mütze
2021 J jnl
Combinatorial generation via permutation languages. IV. Elimination trees.
CoRR
Jean Cardinal, Arturo Merino, Torsten Mütze
2021 A* conf
Efficient Generation of Rectangulations via Permutation Languages.
SoCG
Arturo Merino, Torsten Mütze
2021 A* conf
On a combinatorial generation problem of Knuth.
SODA
Arturo Merino, Ondrej Micka, Torsten Mütze
2021 J jnl
Star transposition Gray codes for multiset permutations.
CoRR
Petr Gregor, Arturo Merino, Torsten Mütze
2020 J jnl
On a combinatorial generation problem of Knuth.
CoRR
Arturo Merino, Ondrej Micka, Torsten Mütze
2020 A* conf
On the Two-Dimensional Knapsack Problem for Convex Polygons.
ICALP
Arturo Merino, Andreas Wiese
2020 J jnl
On the Two-Dimensional Knapsack Problem for Convex Polygons.
CoRR
Arturo Merino, Andreas Wiese
2019 A* conf
The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
ICALP
Arturo Merino, José A. Soto
2019 J jnl
The minimum cost query problem on matroids with uncertainty areas.
CoRR
Arturo Merino, José A. Soto