60 citations · 165 across the 31 of their papers we have counts for
43 papers
A simple algorithm for computing Hamilton paths on independent set polytopes
Jean Cardinal, Pia Herkenrath, Torsten Mütze +1
The independent set polytope, or stable set polytope, of a graph is the 0/1-polytope defined by the convex hull of the characteristic vectors of all independent sets of . We…
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 …
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
Sofia Brenner, Justin Dallant, Linda Kleist +3
We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or c…
Listing faces of polytopes
Nastaran Behrooznia, Sofia Brenner, Arturo Merino +3
This paper investigates the problem of listing faces of polytopes that represent combinatorial objects, such as hypercubes, permutahedra, associahedra, and their generalizations. F…
Flips in colorful triangulations
Rohan Acharya, Torsten Mütze, Francesco Verciani
The associahedron is the graph that has as nodes all triangulations of a convex -gon, and an edge between any two triangulations that differ in a flip operation.…
Graphs that admit a Hamilton path are cup-stackable
Petr Gregor, Arturo Merino, Torsten Mütze +1
Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph , which they called cup stacking. Stacks of cups are placed at the vertices of , a…