The following pages link to Arturo I. Merino (Q5080483):
Displaying 17 items.
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
- Combinatorial generation via permutation languages. III: Rectangulations (Q6156087) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
- The Hamilton compression of highly symmetric graphs (Q6399331) (← links)
- Star transposition gray codes for multiset permutations (Q6490981) (← links)
- Hamiltonian graphs are cup-stackable (Q6517054) (← links)
- Generating all invertible matrices by row operations (Q6533101) (← links)
- Zigzagging through acyclic orientations of chordal graphs and hypergraphs (Q6538648) (← links)
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges (Q6540592) (← links)
- Efficient generation of elimination trees and graph associahedra (Q6575158) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
- The Hamilton compression of highly symmetric graphs (Q6584056) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
- Facet-Hamiltonian cycles in the $B$-permutahedron (Q6756400) (← links)
- A Demigod's Number for the Rubik's Cube (Q6760496) (← links)
