research
∙
04/17/2023
Traversing combinatorial 0/1-polytopes via optimization
In this paper, we present a new framework that exploits combinatorial op...
share
research
∙
12/07/2022
Combinatorial generation via permutation languages. V. Acyclic orientations
In 1993, Savage, Squire, and West described an inductive construction fo...
research
∙
05/17/2022
The Hamilton compression of highly symmetric graphs
We say that a Hamilton cycle C=(x_1,…,x_n) in a graph G is k-symmetric, ...
research
∙
08/17/2021
Star transposition Gray codes for multiset permutations
Given integers k≥ 2 and a_1,…,a_k≥ 1, let a:=(a_1,…,a_k) and n:=a_1+⋯+a_...
research
∙
06/30/2021
Combinatorial generation via permutation languages. IV. Elimination trees
An elimination tree for a connected graph G is a rooted tree on the vert...
research
∙
03/16/2021
Combinatorial generation via permutation languages. III. Rectangulations
A generic rectangulation is a partition of a rectangle into finitely man...
research
∙
07/31/2020
On the Two-Dimensional Knapsack Problem for Convex Polygons
We study the two-dimensional geometric knapsack problem for convex polyg...
research
∙
07/14/2020
