research
∙
06/14/2023
Combinatorial generation via permutation languages. VI. Binary trees
In this paper we propose a notion of pattern avoidance in binary trees t...
share
research
∙
04/17/2023
Traversing combinatorial 0/1-polytopes via optimization
In this paper, we present a new framework that exploits combinatorial op...
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
∙
02/02/2022
Combinatorial Gray codes-an updated survey
A combinatorial Gray code for a class of objects is a listing that conta...
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/14/2020
On a combinatorial generation problem of Knuth
The well-known middle levels conjecture asserts that for every integer n...
research
∙
02/06/2020
On flips in planar matchings
In this paper we investigate the structure of a flip graph on non-crossi...
research
∙
12/03/2019
On the central levels problem
The central levels problem asserts that the subgraph of the (2m+1)-dimen...
research
∙
06/14/2019
Combinatorial generation via permutation languages. I. Fundamentals
In this work we present a general and versatile algorithmic framework fo...
research
∙
02/16/2019
Flip distances between graph orientations
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
research
∙
10/23/2018
On orthogonal symmetric chain decompositions
The n-cube is the poset obtained by ordering all subsets of {1,...,n} by...
research
∙
07/29/2018
On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples
An L-shaped embedding of a tree in a point set is a planar drawing of th...
research
∙
02/27/2018
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane
It is shown that shift graphs can be realized as disjointness graphs of ...
research
∙
02/16/2018
Gray codes and symmetric chains
We consider the problem of constructing a cyclic listing of all bitstrin...
research
∙
11/05/2017
Sparse Kneser graphs are Hamiltonian
For integers k≥ 1 and n≥ 2k+1, the Kneser graph K(n,k) is the graph whos...
research
∙
10/23/2017
