Folgen
Arturo Merino
Titel
Zitiert von
Zitiert von
Jahr
Efficient generation of rectangulations via permutation languages
A Merino, T Mütze
37th International Symposium on Computational Geometry (SoCG 2021), 2021
20*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
17*2022
The minimum cost query problem on matroids with uncertainty areas
AI Merino, JA Soto
arXiv preprint arXiv:1904.11668, 2019
92019
On the two-dimensional knapsack problem for convex polygons
A Merino, A Wiese
arXiv preprint arXiv:2007.16144, 2020
62020
On a combinatorial generation problem of Knuth
A Merino, O Micka, T Mütze
SIAM Journal on Computing 51 (3), 379-423, 2022
52022
Star transposition Gray codes for multiset permutations
P Gregor, A Merino, T Mütze
Journal of Graph Theory 103 (2), 212-270, 2023
32023
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
32022
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
2*2023
The Hamilton compression of highly symmetric graphs
P Gregor, A Merino, T Mütze
arXiv preprint arXiv:2205.08126, 2022
22022
Kneser graphs are Hamiltonian
A Merino, T Mütze, Namrata
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 963-970, 2023
12023
Traversing combinatorial 0/1-polytopes via optimization
A Merino, T Mütze
arXiv preprint arXiv:2304.08567, 2023
2023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–11