me

Robert Lauff

I am a PhD candidate at the Technische Universität Berlin, advised by Stefan Felsner. My research interests include structured graph theory and combinatorics. Recently I have focused on finding constructions for nice cycles and paths on graphs and polytopes, such as rainbow cycles or facet-Hamiltonian cycles, and Gray-codes in general.

Publications and Preprints

FPSAC 2026

UniTriSat: Unimodular Triangulations via satisfiability.

Kyle Huang, Charles Zhang

WG 2025

Subgraph-universal planar graphs for trees

Helena Bergold, Vesna Iršič, Joachim Orthaber, Manfred Scheucher, Alexandra Wesolek

EuroCG 2025

On Triangles in Colored Pseudoline Arrangements

Yan Alves Radtke, Balázs Keszegh

EuroCG 2025

On Triangular Separation of Bichromatic Point Sets

Helena Bergold, Arun Kumar Das, Manfred Scheucher, Felix Schröder, Marie Diana Sieper

Facet-Hamiltonicity

Hugo Akitaya, Jean Cardinal, Stefan Felsner, Linda Kleist

Software Projects

See the respective github repositories for more details on the projects and their current status. If you are interested in contributing to any of the projects, please feel free to reach out to me.
Rust / Wasm

Subtext

An esoteric programming language based on RegEx matching.

Julia

UniTriSat

A Julia-package to compute (regular) unimodular triangulations of lattice polytopes using SAT-solvers.

Rust

Rhombic Strips

Software to compute rhombic strips in a given lattice. The lattice can be passed via a file or build in a simple gui.

Rust

Quiver Mutations

An efficient implementation of quiver mutations. The quiver can be build and manipulated using a simple gui.

Rust

Hanabi

An implementation of the card game Hanabi. Strategies can be easily add via a trait. Please feel free to contribute strategies.

Rust

Quoridor

My first Rust project was a simple AI for Quoridor. It is based on brute force backtracking with a simple score heuristic. Check out the tui visualizations of the board.