6 papers
Faster and simpler traversal of 0/1-polytopes
Jiří Fink, Petr Hladík, Arturo Merino +2
Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope , where …
Generating all invertible matrices by row operations
Petr Gregor, Hung P. Hoang, Arturo Merino +1
We show that all invertible matrices over any finite field can be generated in a Gray code fashion. More specifically, there exists a listing such that…
Combinatorial generation via permutation languages. V. Acyclic orientations
Jean Cardinal, Hung P. Hoang, Arturo Merino +2
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provi…
Cache-Oblivious Representation of B-Tree Structures
Lukáš Ondráček, Ondřej Mička
We propose a general data structure CORoBTS for storing B-tree-like search trees dynamically in a cache-oblivious way combining the van Emde Boas memory layout with packed memory a…
On a combinatorial generation problem of Knuth
Arturo Merino, Ondřej Mička, Torsten Mütze
The well-known middle levels conjecture asserts that for every integer , all binary strings of length with exactly many 0s and 1s can be ordered cyclically…
On the central levels problem
Petr Gregor, Ondřej Mička, Torsten Mütze
The central levels problem asserts that the subgraph of the -dimensional hypercube induced by all bitstrings with at least many 1s and at most many 1s,…