Arturo I. Merino

Available identifiers

Publication	Date of Publication	Type
Traversing combinatorial 0/1-polytopes via optimization	2024-09-11	Paper
The Hamilton compression of highly symmetric graphs	2024-08-06	Paper
Efficient generation of elimination trees and graph associahedra	2024-07-19	Paper
On the hardness of Gray code problems for combinatorial objects	2024-07-19	Paper
All your bases are belong to us: listing all bases of a matroid by greedy exchanges	2024-05-16	Paper
Zigzagging through acyclic orientations of chordal graphs and hypergraphs	2024-05-14	Paper
Star transposition gray codes for multiset permutations	2024-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q6147296	2024-01-15	Paper
Star transposition Gray codes for multiset permutations	2023-10-12	Paper
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations	2023-08-10	Paper
Combinatorial generation via permutation languages. III: Rectangulations	2023-06-12	Paper
Traversing combinatorial 0/1-polytopes via optimization	2023-04-17	Paper
Kneser graphs are Hamiltonian	2022-12-07	Paper
The Minimum Cost Query Problem on Matroids with Uncertainty Areas.	2022-07-21	Paper
On a combinatorial generation problem of Knuth	2022-05-31	Paper
The Hamilton compression of highly symmetric graphs	2022-05-17	Paper
Combinatorial generation via permutation languages. IV. Elimination trees	2021-06-30	Paper
Hamiltonian graphs are cup-stackable	N/A	Paper
Generating all invertible matrices by row operations	N/A	Paper

This page was built for person: Arturo I. Merino