Bobby
Miraftab
From Erdős’s Triangle Question to Clique Cover Problems
Mittagsseminar Discrete Mathematics 📅
Institute
Head
Stefan Felsner
Organizer
Sandro M. Roch
Number of talks
719
April 2026
Yasumi
Kogo
On 1-planar drawings of C_m x C_n.
Abstract.
This weeks seminar concerns simple 1-planar drawings of the torus grid C_m x C_n.<br><br>We showed: up to drawing isomorphism there are exactly three simple 1-planar drawings of C_m x C_n in the plane (or on the sphere) for m,n >= 5. This drawing classification is incomplete if 3 <= m <= 4, 3 <= n; in that case more wild twisted drawings are possible.<br><br>In 1973, Harary, Kainen and Schwenk conjectured that the crossing number of C_m x C_n is m(n-2) for n >= m >= 3. The conjecture has been proven for 3 <= m <= 7, and for n >= m(m+1), m >= 3. Our classification shows the conjecture for 1-planar drawings.<br><br>Joint work with Kolja Knauer and Stefan Felsner.
November 2025
Stijn
Cambie
Extremal and particular behaviour in reconfiguration of graph colouring
Abstract.
In this talk, we will explain the notion of reconfiguration graph (of graph colourings). This elementary notion lead to some conjectures, most famously the one of Cereceda. We will proceed with some particular observations, mention some results and further directions (in particular the favorite conjectures). Based on joint work with Wouter Cames van Batenburg, Daniel W. Cranston, Jan van den Heuvel and Ross J. Kang.
October 2025
Alexandra
Wesolek
Asymptotic dimension and distributed algorithms
Abstract.
Imagine you play a colouring game on a metric space with k colours. Your opponent picks some distance r>0 and you colour the metric space into regions such that two regions of the same colour are at least at distance r from each other. If the regions have bounded diameter and each point of the metric space is coloured, you win, otherwise you lose. The asymptotic dimension of a metric space is the largest k at which your opponent has a winning strategy. For example, the asymptotic dimension of an infinite line is 1. The concept of asymptotic dimension can be applied to graph classes and the shortest path metric. Recently it was shown that H-minor-free graphs have asymptotic dimension at most 2. I will discuss how this result can be used for distributed algorithms. Joint work with Bonamy, Gavoille and Picavet.
Stefan
Felsner
Antipodal pairs and crossing numbers
Abstract.
We show that minimal counterexamples to the Hill conjecture about the crossing number of the complete graph and a more recent conjecture of Mohar about the crossing number of $M_{2k}^t$ do not contain antipodal pairs. The graph $M_{n}^t$ is obtained from the complete graph $K_{n}$ by removing the edges of a matching of size t. This yields large families of drawings for which the conjectures are true.
Robert
Lauff
Exponential Rainbow Cycles on Permutahedra and Associahedra
Abstract.
Most common flip graphs have a natural coloring of their edges. Given a flip graph with colored edges, we seek cycles which use each color exactly r times. Such a cycle is then a r-rainbow cycle. In this talk, I will present constructions for r-rainbow cycles in Permutahedra and Associahedra, where r is exponential in the dimension. Such cycles can be seen as intermediary steps towards balanced Gray codes, which in this context would be rainbow Hamilton cycles.
Yan
Alves Radtke
On the surjectivity of a map by Kapranov and Voevodsky
July 2025
Maximilian
Gorsky
On a variant of the crossing number in the graph minor structure theorem
June 2025
Lucas
Burggraf
Packing plane graphs in random geometric graphs
Abstract.
The study of graph packings has a long history whose systematic study began with the landmark result of Wilson. In his paper from 1975 he proved the existence of graph packings on complete digraphs under certain divisibility conditions. Packing problems on other graphs besides complete graphs are also widely studied, yet many open questions remain. We will study packings in random r-geometric graphs. That is, intersection graphs of disks with radius r chosen randomly from the unit square. The main result is that we can pack non-crossing cycles of arbitrary length into a random r-geometric graph covering almost all edges. The proof uses tessellations and their symmetry.
May 2025
Mino
Mischlich
Kontaktdarstellungen von Graphen auf dem Torus
Abstract.
Neben der üblichen Darstellung von Graphen durch Zeichnungen sind Kontaktdarstellungen eine weitere mögliche Repräsentation von Graphen. Hierbei werden Knoten gleichgesetzt mit geometrischen Objekten, welche sich berühren sollen in vorgegebener Weise, genau dann, wenn die entsprechenden Knoten im Graphen durch eine Kante verbunden sind. Dreiecks- und Rechteckskontaktdarstellungen von planaren Graphen wurden bereits ausgiebig untersucht. Nach einer kurzen Vorstellung der Ergebnisse im planaren Falle wird untersucht, inwiefern sich diese auch für Graphen auf dem Torus übertragen lassen. Im planaren Fall induzieren Dreiecks- und Rechteckskontaktdarstellungen insbesondere kombinatorische Strukturen auf dem Graphen, und zwar Schnyder Woods und transversale Strukturen. Während bereits Ergebnisse zu toroidalen Schnyder Woods bestehen, werden wir das Konzept der transversalen Struktur erstmalig auf den Torus übertragen und auf einige Eigenschaften untersuchen.
Yucheng
Hua
Permutation representation of boxed Plattenbauten
Yan Alves
Radkte
Orientations of good covers
Yan Alves
Radtke
Orientations of good covers
April 2025
Diogo
Soares
On the number of shellable arrangements of pseudolines
Yan Alves
Radtke
Counting Persistent Graphs and Triangulations of the Cyclic Polytope
March 2025
Jacob
von Holly-Ponientzietz
Homothetic Triangle Contact Representations: A New Approach
Jan
Kratochvil
Hamiltonian path and cycle problems in graphs of bounded independence number
Melanie
Reihl
Simultaneous Contact Representations of Planar Graphs
Lisa
Kudlik
Durchmesser von Flipgraphen
January 2025
Ekin
Ergen
Online Makespan Scheduling Under Scenarios
Julian
Marx
Beiträge zum Zählen von Bäumen auf Punktmengen
James
Davies
Frame matroids with a distinguished frame element
Felix
Schröder
The Beer Index and Related Convexity Measures
November 2024
Stefan
Felsner
Fast and Simple Sorting Using Partial Information
Robert
Lauff
On triangular separation of bichromatic point sets
Vesna
Iršič Chenoweth
Burning game
Yan
Alves Radtke
Signotopes and Pseudoconfigurations
October 2024
Alexandra
Wesolek
Turán-good graphs
June 2024
Stefan
Felsner
Drawings of products of cycles
Silas
Rathke
On the maximum diameter of d-dimensional simplicial complexes
May 2024
Yan
Alves Radtke
Signotopes: Pseudoconfigurations and Extensions
Manfred
Scheucher
Saturation results around the Erdős-Szekeres problem
Robert
Lauff
Trees in Planar Graphs
April 2024
Hannes
Tarun
Konstruktion und Geometrische Repräsentationen dreiecksfreier Graphen mit hoher chromatischer Zahl (Wiederholung)
Todor
Antić
Star-Forest Decompositions of Complete (Geometric) Graphs
Hannes
Tarun
Konstruktion und Geometrische Repräsentationen dreiecksfreier Graphen mit hoher chromatischer Zahl (Wiederholung)
Miriam
Goetze
Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs
Lucca
Tiemens
A balanced Transposition Grey Code for the Symmetric Group and on SCDs for the Permutahedron of Order 5 and below
March 2024
Hannes
Tarun
Konstruktion und Geometrische Repräsentationen dreiecksfreier Graphen mit hoher chromatischer Zahl
Sandro
Roch
Exact covering with unit disks
February 2024
Alexandra
Wesolek
Reconfiguration of plane trees in convex geometric graphs
January 2024
Malin
Heinacher
Trees and co-trees in planar graphs
Raphael
Steiner
Chromatic number is not tournament-local
December 2023
Robert
Lauff
Facet hamiltonian paths in graph associahedra of complete bipartite graphs (and maybe trees)
Stefan
Felsner
On digons in arrangements of (pseudo)circles
Manfred
Scheucher
On the empty hexagon theorem
November 2023
Maximilian
Wittmann
The Dimension of Products of Orders
Helena
Bergold
Plane Hamiltonian cycles and paths in convex drawings
Vesna
Iršič
Domination of subcubic planar graphs with large girth
Sandro
Roch
Coloring problems on arrangements of pseudolines
October 2023
Alexandra
Wesolek
Cops and robber game on surfaces
Stefan
Felsner
Triangulations and partial triangulations: flips and counting
Rimma
Hämäläinen
Few Slopes Without Collinearity
September 2023
Felix
Schröder
Edge density of RAC graphs
Julian
Sampels
Zählen von Elimination Trees
Julian
Pfeifle
Different embeddings of the Grassmannian, applied to realization problems
August 2023
Robert
Lauff
Facet guarding cycles in graph associahedra
July 2023
Ekin
Ergen
Total completion time scheduling under scenarios
Felix
Schröder
A new Lemma for proving density bounds of beyond-planar graphs
Sandro
Roch
A general lower bound on the mixing time of Glauber dynamics
June 2023
Robert
Lauff
Facet guarding cycles in graph associahedra
Stefan
Felsner
Geometric representations of signotopes
Yan
Alves Radke
On the connectivity of the flipgraph of pseudoline arrangements
Helena
Bergold
Strong Erdős-Hajnal properties in chordal graphs
May 2023
Rimma
Hämäläinen
Area Proportionality of Euler diagrams
Felix
Schöder
Gons and Holes in Projective Point Sets (Part 2)
Sandro
Roch
Block coupling on k-heights
April 2023
Anna
Barkova
Geometrische Realisierbarkeit der Repräsentation von Graphen mit polygonalen Flächen
Robert
Lauff
Three nice riddles
Stefan
Felsner
Partial orders induced by rectangulations
February 2023
Manfred
Scheucher
SAT encodings for planarity and other graph properties
Robin
Chemnitz
Markov chain methods for nowhere-zero flows
Fernando
Cortés Kühnast
On the Number of Arrangements of Pseudolines
Jasmin
Lindner
Lohnt es sich, längste Ketten zu suchen? – Approximieren von Kettenzerlegungen mit Greedy und First-Fit
Emmanuel
Silva
Consecutive pattern-avoidance in Catalan words according to the last symbol
January 2023
Rimma
Hämäläinen
On Subdivision Numbers of Triangulations and Equiareality
Felix
Schröder
Introduction to Nowhere zero flows
Sandro
Roch
Introduction to hyperplane arrangements
Robert
Lauff
Plus und Minus: Zur Kombinatorik von Signotopen
December 2022
Louis
Borchert
Hamiltonkreise in Mindestabstandsgraphen in der euklidischen Ebene
Felix
Schröder
Completing Partial Generalized Signotopes is NP-hard
November 2022
Manfred
Scheucher
Isomorphism of point sets
Stefan
Felsner
The flip-graph of arrangements of pairwise intersecting pseudocircles
Helena
Bergold
Holes in Convex Drawings of $K_n$
October 2022
Manfred
Scheucher
Plane Hamiltonian Cycles in Convex Drawings of $K_n$
Rimma
Hämäläinen
A Solution to a Problem About Bichromatic Configurations in the Plane
Sandro
Roch
Introduction to Cluster Algebras
Paul
Jungeblut
The Air-Pressure Method for Area-Universality
September 2022
Felix
Schröder
Improper colorings of planar graphs
Stefan
Felsner
Orthogonal convexity
Melanie
Reihl
Zur Geradeüberdeckungszahl von Graphen
Alex
Nedev
Partially ordered sets: structure and compact encoding
July 2022
Raphael
Steiner
Odd Hadwiger for line graphs
Anton
Dochtermann
Homomorphism complexes and reconfiguration for digraphs
Markus
Kirchweger
A SAT Attack on Rota's Basis Conjecture
Stefan
Felsner
Convex tilings with given slopes
Rimma
Hämäläinen
Graph Drawings with Few Slopes
June 2022
Torsten
Mütze
The Hamilton compression of highly symmetric graphs
Hany
Ibrahim
Edge Contraction and Forbidden Induced Subgraph
Johannes
Obenaus
Edge Partitions of Complete Geometric Graphs
May 2022
Helena
Bergold
Unavoidable patterns in complete simple topological graphs
Rosna
Paul
Perfect matchings with crossings
Markus
Kirchweger
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
April 2022
Manfred
Scheucher
SAT, ASP, and Symmetry Breaking
Sandro
Roch
Constructions in combinatorics via neuronal networks
Krishnendu
Bhowmick
Methods of Hypergraph Containers
Felix
Schröder
Matroid depth parameters for integer programming
March 2022
Meghana M.
Reddy
Lions and Contamination
Marcel
Boesl
Rechts-Links Pfade und ein Kriterium für Planarität
February 2022
Maximilian
Gorsky
Matching Theory, Hamiltonicity, and Barnette's Conjecture
Svenja
Griesbach
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
Loïc
Dubois
Packness and Tree-Path indices
Raphael
Steiner
Cycle lengths modulo k in expanders
January 2022
Stefan
Felsner
Box graphs with large girth and large chromatic number
Manfred
Scheucher
The Big-Line-Big-Clique Conjecture
Helena
Bergold
Colorings of oriented planar graphs avoiding a monochromatic subgraph
December 2021
Sandro
Roch
Algorithms for sampling random pseudoline arrangements
Joris
Wenzel
Enforceable Drawings of Graphs
Felix
Schröder
Asymmetry in Planar Ramsey Graphs
November 2021
Loïc
Dubois
Delaunay flips on flat tori
Stefan
Felsner
Degrees of freedom and the speed of graph classes
Torsten
Mütze
Star transposition Gray codes for multiset permutations
Raphael
Steiner
Two notes on relatives of Hadwiger's conjecture
October 2021
Manfred
Scheucher
Gons and Holes in Projective Point Sets (Part 1)
Laura
Merker
A Sublinear Bound on the Page Number of Upward Planar Graphs
Helena
Bergold
Higher Dimensional Signotopes
September 2021
Lilli
Leifheit
Rechteckzerlegungen und Baxterpermutationen
July 2021
Felix
Schröder
Density of Fan-Planar Graphs
Shagnik
Das
Isomorphic bisections of cubic graphs
Raphael
Steiner
Polynomial bound for divisible subdivisions
June 2021
Tim
Bastian
Listenfärbbarkeit von Arrangement-Graphen
Sebastian
Wiederrecht
Even Circuits in Oriented Matroids
Niklas
Affolter
Triple Crossing Diagrams (TCDs) and some Posets
Stefan
Felsner
Counting Plane Partitions - Kuo's proof of the MacMahon formula
May 2021
Arturo
Merino
Generation of elimination trees and Hamilton paths on graph associahedra
Raphael
Steiner
Disjoint cycles with length constraints in digraphs
Maximilian
Gorsky
k-Outerplanarity and Poset Dimension
April 2021
Felix
Schröder
Two extensions of the Erdös–Szekeres problem
Lisa
Schottstädt
Unique Sink Orientierungen und Anwendungen
Stefan
Felsner
Triangles and Lenses in Arrangements of Pseudocircles
March 2021
Eugenia
Sinatti
Zirkuläre chromatische Zahl von zirkulierenden Graphen
Felix
Schröder
Actual coloring numbers
Raphael
Steiner
Zero sum cycles in group-labelled complete digraphs
February 2021
Manfred
Scheucher
Tight bounds on the expected number of holes in random point sets
Stefan
Felsner
Flip structures and the 4 color theorem
Matthias
Täufer
Group testing, Steiner Systems and Reed-Solomon Codes
January 2021
Julian
Schick
Der Flipgraph von Split und Merge auf Schnyder Woods
Kaja
Wille
Queue and Stack Layouts of partial orders
Raphael
Steiner
Complete minors via dichromatic number
Felix
Schröder
A characterization of always solvable trees in Lights Out game and the activation numbers of vertices
December 2020
Raphael
Steiner
Towards the Directed Gyarfas-Sumner Conjecture
Rahul
Jain
Space-efficient algorithm for the grid graph reachability
November 2020
Stefan
Felsner
Crossings in star-simple drawings
Charlotte
Lenz
Zeichnungen vollständiger Graphen und ihre Gap-Planarität
Florian
Oberender
Drawings of acyclic digraphs: Algorithmic aspects
Jonathan
Rollin
Edge-Minimum Saturated k-Planar Drawings (of Multigraphs)
October 2020
Raphael
Steiner
3-Coloring Arrangements of Great-Circles: Partial Results
Lamar
Chidiac
A lower bound of the number of independent hyperplanes in oriented paving matroids
Leonie
Selbach
Partition algorithms for weighted cactus graphs
Felix
Schröder
Crossing-critical graphs, the bounded degree conjecture and the number 13
September 2020
Johanna
Wiehe
The chromatic polynomial of a digraph
Maximilian
Wittmann
On deletion-perfect families of permutations
Winfried
Hochstättler
Computing Shapley values and elements from the core
August 2020
William
Trotter
Towards a Proof of the Removable Pair Conjecture
Stefan
Felsner
Not all planar graphs are in PURE-4-DIR
Martin
Balko
On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
July 2020
Torsten
Mütze
On flips in planar matchings
Manfred
Scheucher
On the Number of Order Types
June 2020
Helena
Bergold
Neighborhood polynomial in chordal graphs
Raphael
Steiner
Subdivisions in dense digraphs
Jonathan
Rollin
Sparse Ordered Ramsey Graphs
May 2020
Felix
Schröder
A better approximation for the longest non-crossing spanning tree of a point set
Stefan
Felsner
Bundeling crossings of strings
Jens
Schmidt
Dynamics of Cycles in Polyhedra I: The Isolation Lemma
André
Schulz
Representing Graphs by Polygons with Side Contacts in 3D
April 2020
Raphael
Steiner
Strongly Pfaffian Graphs
Manfred
Scheucher
7-gons in 3-space meet cadical
Felix
Schröder
Enumeration of topological drawings of K_n
Stefan
Felsner
Pseudolinear Drawings
Piotr
Micek
Adjacency Labelling for Planar Graphs (and Beyond)
March 2020
Raphael
Steiner
Dichromatic number and forbidden subdivisions
February 2020
Jonathan
Wolff
Zur Kombinatorik von Stick-Graphen
Manfred
Scheucher
Fast Computation of Chirotopes
January 2020
Felix
Schröder
3-face colorings and Tutte's 3-flow conjecture
Max
Richter
Combinatorial properties of topological drawings of complete graphs
Stefan
Felsner
Remarks on Plattenbauten
December 2019
Raphael
Steiner
Another Brick in the Wall
Erik
Tadewaldt
Superpermutations And Super-Patterns
November 2019
Günter
Rote
Enumerating and Counting Pseudoline Arrangements
Torsten
Mütze
The central levels problem and symmetric chains in the hypercube
Malte
Renken
What does the Cyclic Polytope have to do with Terrain Visibility Graphs?
October 2019
Manfred
Scheucher
Simple Topological Drawings, Rotation Systems, and SAT Solvers
Manfred
Scheucher
Holes and islands in random point sets
Felix
Schröder
Bichains - 7 equivalent formulations
Raphael
Steiner
Majority Colourings of Sparse Digraphs
September 2019
Piotr
Micek
Graphs without long ladder minors
Sophie
Rehberg
Verallgemeinerte Permutaeder und Hopf-Monoide
Jonas
Neukamm
Straight-line-triangle-representstions und ihre Berechnung
Stefan
Felsner
Circle graphs are quadratically chi-bounded
August 2019
Sandro
Roch
Sortieren in Netzwerken aus Stacks und Queues
July 2019
Michelle
Döring
Flip Graphs, Topological Drawings and Separable Permutations
Piotr
Micek
Weak coloring numbers of planar graphs
June 2019
Felix
Schröder
Spherical Thrackles and Conway's Conjecture
Raphael
Steiner
Counterexamples to Hedetniemi's Conjecture
May 2019
Helena
Bergold
Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
Manfred
Scheucher
Planar point sets determine many pairwise crossing segments
Stefan
Felsner
Counting Linear Extensions
Kolja
Knauer
Generating k-connected orientations
Emanuel
Hintze
Universelle Wörter mit Jokersymbolen
Raphael
Steiner
Odd Dijoins and Cut Minors
April 2019
Felix
Schröder
Bishellable Drawings of K_n
Sophie
Blasius
Geschichtete Separatoren und ihre Anwendungen
Hendrik
Schrezenmaier
Universal point sets for planar 3-trees
Stefan
Felsner
Segment intersection representations of planar graphs
March 2019
Torsten
Mütze
Combinatorial generation via permutation languages
Piotr
Micek
Planar graphs have bounded queue-number
Raphael
Steiner
Universal Point Sets for Planar Graphs
Manfred
Scheucher
A Generalization of the Erdős-Szekeres Theorem to Arrangements of Pseudocircles
February 2019
Helena
Bergold
A Combinatorial Extension of the Colorful Carathéodory
Raphael
Steiner
Colouring Non-Even Digraphs
Nils
Engler
On Cayley Graphs Generated by Permutations and Shifts
Hans Niklas
Jacob
On the Generalized Middle Levels Problem
January 2019
Raphael
Steiner
On Woodall's Conjecture, Cyclic Base Orderings, Fractional Arboricity and Pseudosphere Arrangements
Manfred
Scheucher
On Erdős-Szekeres Type Questions in $R^d$
December 2018
Sara
Zemljič
The Sierpinski product of graphs
November 2018
Raphael
Steiner
Flip Distances between Graph Orientations
Manfred
Scheucher
Using SAT Solvers in Combinatorics and Geometry
Felix
Schröder
On the extendability of non-degenerate box configurations to tilings
Raphael
Steiner
Metric Colourings of Graphs
October 2018
William
Trotter
Two Fundamentally Important Problems for Planar Posets
September 2018
Stefan
Lendl
Recoverable Robust Discrete Optimization
August 2018
Manfred
Scheucher
L-shaped Point Set Embeddings of Trees
Raphael
Steiner
Star Dichromatic Number
Hendrik
Schrezenmaier
On grounded L-graphs and their relatives
July 2018
Marcel
Milich
Kreise für planare Matchings
Martin
Balko
On Erdős-Szekeres-type problems for k-convex point sets
Stephen
Kobourov
Multi-Level Steiner Tree
June 2018
Stefan
Felsner
Variationen über "Crossing Families"
Linda
Kleist
Convexity increasing morphs of planar graphs
Felix
Schröder
Stand der Wissenschaft zur Borsuk-Vermutung und Max-Distance-Graphen
May 2018
Uwe
Schauz
The Combinatorial Nullstellensatz and List Edge Colorings of Graphs
Kaja
Wille
Zerlegungen des Hyperwürfels in symmetrische Ketten
Felix
Schröder
Zerlegungsgleichheit und die Dehn'sche Invariante
Manfred
Scheucher
Arrangements of Pseudocircles: Triangles, Drawings, and Circularizability
April 2018
Patricia
Franz
Zur Komplexität von Sechseckskontaktdarstellungen
Stefan
Felsner
A routing problem in arrangements with applications
Felix
Schröder
On a crossing lemma for multigraphs
Manfred
Scheucher
Partial Least-Squares Point Matching under Translations
March 2018
Hendrik
Schrezenmaier
Faster Algorithms for some Optimization Problems on Collinear Points
Manfred
Scheucher
Minimal Geometric Graph Representations of Order Types
Nadine
Raasch
Kontaktdarstellungen planarer Graphen mit Fünfecken
February 2018
Stefan
Felsner
Alternating permutations, Euler numbers and some bijections
Linda
Kleist
Area-universality of triangulations
Hendrik
Schrezenmaier
Universal slope sets for 1-bend planar drawings
January 2018
Bartosz
Walczak
Discrepancy of axis-parallel boxes
Henning
Heinrich
Approaching area-universality
Stefan
Felsner
Introduction to Placements of Rooks
December 2017
Patrick
Schnider
Measures of depth for multiple points
Hendrik
Schrezenmaier
Planar graphs as L-intersection graphs
November 2017
Hendrik
Schrezenmaier
Planar graphs as L-contact graphs
Raphael
Steiner
Neumann-Lara-flows and the Two-Colour-Conjecture
Bartosz
Walczak
Extending Partial Representations of Trapezoid Graphs
Stefan
Felsner
More about Circle- and Pseudocirclearrangements
October 2017
Paul
Wancura
Rechteckszerlegungen auf Punktmengen
Christoph
Standke
Zu Kodierung und Kreisbarkeit von Pseudokreisarrangements
Linda
Kleist
On the Monge-Kontorovich transportation problem and Voronoi diagrams
Hendrik
Schrezenmaier
Applications of a topological lemma in combinatorial geometry (circle packing, floorplans)
September 2017
Torsten
Mütze
A short proof of the middle levels theorem
July 2017
Stefan
Felsner
The chip firing game
Linda
Kleist
Towards the Harary Hill conjecture
June 2017
Hendrik
Schrezenmaier
Maximum-area triangle in a convex polygon
Stefan
Felsner
Maximum crossing number of cycles and bipartite graphs
May 2017
Linda
Kleist
Area-universal rectangular layouts
Manfred
Scheucher
SageMath - Eine Kurzeinführung
Hendrik
Schrezenmaier
Optimal Coding and Sampling of Triangulations
April 2017
Stefan
Felsner
Flipping Edges of Triangulations
Michael
Dobbins
Stretching weighted pseudoline arrangements
Till
Miltzow
The Art Gallery Problem is $\exists \mathbb{R}$-complete
March 2017
Linda
Kleist
Area-universality and $\forall\exists\mathbb R$ (\FER)-hardness
Hendrik
Schrezenmaier
Morphing Schnyder drawings of plane triangulations
Manfred
Scheucher
A superlinear lower bound on the number of 5-holes
February 2017
Janine
Felten
Sortieren mit partieller Information
Kolja
Knauer
On lattice path matroid polytopes: integer points and Ehrhart polynomial
Veit
Wiechert
Orthogonal tree decompositions and chromatic number
Stefan
Felsner
Triangles in Arrangements
January 2017
Nikolai
Kalischek
Topologische Zeichnungen bipartiter Graphen
Tom
Trotter
Trees and Circle Orders
December 2016
Linda
Kleist
Equidissections of polygons
Hendrik
Schrezenmaier
Squarability of rectangle arrangements
November 2016
Alexander
Pilz
Deciding monotonicity of complete topological graphs
Veit
Wiechert
On the boxicity of graphs with no K_t minor
Stefan
Felsner
Circle- and Pseudocirclearrangements
Darius
Wuttke
Efficient algorithm for computing middle level Gray codes
October 2016
Linda
Kleist
Popular matchings
Veit
Wiechert
Coloring, sparseness, and girth
August 2016
Hendrik
Schrezenmaier
Maximizing the Sum of Radii of Disjoint Balls or Disks
Stefan
Felsner
Coloring Segments in Space
July 2016
Markus
von der Heyde
Rechtecks-Duale mit vorgegebenen Flächen
Raman
Sanyal
Two double poset polytopes
June 2016
Franz
Brandenburg
Visibility Graphs of Geometric Objects
Veit
Wiechert
Dominating Sets in Sparse Graphs
Linda
Kleist
Union-closed set conjecture
Hendrik
Schrezenmaier
How to morph planar graph drawings
May 2016
Raphael
Steiner
Existenz und Konstruktion von Dreiecks- und Fünfeckskontaktdarstellungen
Julia
Kraus
Magische Eigenschaften von Graphen
Stefan
Felsner
On the Erdős-Szekeres convex polygon problem
Veit
Wiechert
Centered colorings and order dimension
April 2016
Stefanie
Wendisch
q-Catalan Zahlen
Stefan
Felsner
A Geometric Approach to Acyclic Orientations
Linda
Kleist
Decomposing graphs into trees
March 2016
Veit
Wiechert
On Graphs that have the Erdos-Posa Property
Lena
Krauss
De Bruijn Graphen mit Eulerkreisen als Ansatz für DNA Fragment Assembly
February 2016
Stefan
Felsner
Embedding Graphs on Wheel Point Sets.
Katharina
Hoffmann
k-lokal planare Graphen
Hendrik
Schrezenmaier
Ein neuer Existenzbeweis für Kontaktdarstellungen mit homothetischen gleichseitigen Dreiecken.
January 2016
Veit
Wiechert
Improved bounds for the dimension of posets whose cover graphs have bounded treewidth.
Tom
Trotter
Posets and Dimension
Linda
Kleist
Coloring Graphs on Surfaces.
December 2015
Tillmann
Miltzow
An Approximation Algorithm and Parameterized Hardness of the Art Gallery Problem
Felix
Seibert
Square Dissections and Transversal Structures.
Franz
Brandenburg
Semi-bar 1-visibility graphs.
November 2015
Udo
Hoffmann
Polygon obstacle representations of graphs.
Björn
Kapelle
Kontakt- und Schnittdarstellungen planarer Graphen.
Stefan
Felsner
Drawings of K_{r,n}.
October 2015
Linda
Kleist
Drawing planar graphs with prescribed face areas.
Veit
Wiechert
Graphs with locally bounded treewidth.
Udo
Hoffmann
The slope number of graphs.
Stefan
Felsner
Strongly monotone drawings of planar graphs.
Torsten
Mütze
Bipartite Kneser graphs are Hamiltonian.
September 2015
Felix
Seibert
An algorithm for square contact representations.
Linda
Kleist
Points in the plane and depth.
Veit
Wiechert
The dimension of planar posets.
August 2015
Udo
Hoffmann
Illumination of polygons with vertex lights.
Stefan
Felsner
Arrangements of Pseudolines on Dual Arrangements
Linda
Kleist
Counting annular non-crossing matchings.
July 2015
Veit
Wiechert
Queue layouts of graphs with bounded treewidth.
Udo
Hoffmann
Slope minimization of segment intersection graphs.
Stefan
Felsner
Drawings of K_{2,n}.
June 2015
Steve
Chaplick
Partial Bar Visibility Representation Extension.
Linda
Kleist
Rainbow Connectivity
Udo
Hoffmann
Visibility graphs of pseudo-polygons.
May 2015
Kolja
Knauer
Drawing graphs with vertices and edges in convex position
Piotr
Micek
Sparsity and dimension.
Veit
Wiechert
Classes of graphs with bounded expansion: examples and characterizations.
April 2015
Kolja
Junginger
1:d-Graphen: Eine Verallgemeinerung planarer Triangulierungen.
Stefan
Felsner
Hook-formulae
Steve
Chaplick
Intersection Graphs of Non-Crossing Paths.
March 2015
Linda
Kleist
Chromatic Art Gallery Problem
Udo
Hoffmann
Catching light rays with mirrors
Veit
Wiechert
A new proof for the Aztec diamond theorem.
February 2015
Piotr
Micek
Computing dimension of bounded width posets
Stefan
Felsner
Crossing Numbers and Rotation Systems
Nieke
Aerts
Power line route optimization.
Steve
Chaplick
Drawing the Complete Graph with a Planar Subgraph
January 2015
Udo
Hoffmann
Obstacle Representations of Graphs
Linda
Kleist
Long Paths in Line Arrangements
Piotr
Micek
Posets and minors.
December 2014
Veit
Wiechert
Dimension and Standard Examples
Alexander
Hopp
Topologische Bucheinbettungen planarer Graphen.
Christoph
Standke
The list chromatic index of 1-factorable graphs.
November 2014
Stefan
Felsner
Independent and hitting sets of some classes of rectangle intersection graphs.
Steve
Chaplick
Overlap Representations of Planar Graphs
Udo
Hoffmann
Point visibility graphs and the existential theory of the reals.
October 2014
Kolja
Knauer
Orienting Triangulations.
Jonatan
Krolikowski
Refined counting of linear extensions of posets.
Benjamin
Rahman
Würfelkonstaktdarstellungen von Graphen
September 2014
Torsten
Ueckerdt
On-line coloring between two lines.
August 2014
Udo
Hoffmann
Representations of point visibility graphs.
Tillmann
Miltzow
Token Swapping
Veit
Wiechert
Large dimensional posets with planar cover graphs
Linda
Kleist
On the complexity of recognizing unit proper contact graphs of unit regular polygons.
July 2014
Steve
Chaplick
Clique Separators in Neighbourhood Subtree Intersection Graphs
Nieke
Aerts
Touching Triangle Representations of Biconnected Outerplanar Graphs
June 2014
Piotr
Micek
Pathwidth and nonrepetitive colorings of graphs
Stefan
Felsner
Abstract Ham-Sandwich Cuts and Selection in Arrangements
Sarah
Spoenemann
Kombinatorische Eigenschaften von bichromatischen Punktmengen und Arrangements.
May 2014
Udo
Hoffmann
(Pseudo) Vertex-Edge Visibility Graphs in Polygons.
Irina
Mustaţă
Intersection graphs of unit squares and partial grid graphs
Mirjam
Plietzsch
Durchmesser von höheren symmetrischen Shift-Graphen
Veit
Wiechert
Balanced Pairs in Sets of Orderings with many initial Elements
Stefan
Felsner
Generating and counting perfect matchings in bipartite regular graphs
April 2014
Yannik
Stein
The Complexity Class 'Polynomial-Time Local Search' (PLS)
Steve
Chaplick
On (K_{1,3},even-hole)-free graphs.
Linda
Kleist
On Area-Universal Contact Representations with Orthogonal Polygons.
Nieke
Aerts
Grid-Path Contact Representations.
March 2014
Udo
Hoffmann
Slopes of bipartite segment intersection graphs.
Katinka
Becker
Counting triangulations and related structures.
Piotr
Micek
Lower bounds for on-line graph colorings
Irina
Mustaţă
Opaque forests
February 2014
Stefan
Felsner
Bookembeddings and topological bookembeddings
Veit
Wiechert
On the Dimension of Posets that do not have a large Standard Example as a subposet.
Steve
Chaplick
Graph Traversals and Restricted Families of Graphs
January 2014
Jean-Philippe
Labbé
Counting singletons and related structures
Linda
Kleist
On unit distance graphs.
Nieke
Aerts
Triangle contact representation of a planar graph and its dual.
Piotr
Micek
On the number of edges in families of pseudo-discs
December 2013
Udo
Hoffmann
Slopes of k-dir graphs.
Irina
Mustaţă
Graceful labelings of graphs
Veit
Wiechert
On the Dimension of Posets that have a Cover Graph of bounded Treewidth
November 2013
Kolja
Knauer
Connected Covering Numbers.
Stefan
Felsner
Basics of Multitriangulations.
Christoph
Hansknecht
Methoden zur Berechnung von Tabellenkartogrammen
Piotr
Micek
Making Octants Colorful
Michael
Kaufmann
Slanted Orthogonal Drawings.
October 2013
Daniel
Heldt
A (q-analogon)^2 for the number of bounded Motzkin paths.
Manuel
Hensel
Layer Aware Codes
Björn
Kapelle
Anwendungen der Entladungsmethode
Linda
Kleist
Plane Cubic Graphs and the Air-Pressure Method
Stefan
Felsner
Evaluating Determinants Combinatorially
September 2013
Udo
Hoffmann
Extending partial representations of circle graphs
Laura
Gellert
Gradsequenzen von gerichteten Graphen.
Nieke
Aerts
Henneberg Steps for Triangle Representations
August 2013
Katharina
Jochemko
An order-theoretic generalization of Polya's enumeration theorem
Irina
Mustaţă
Untangling two systems of non-crossing curves
July 2013
Daniel
Heldt
For some $\alpha$ the face flip markov chain on the set of $alpha$-orientations is not rapidly mixing on planar triangulations of degree \leq 7
Veit
Wiechert
Unit Interval Graphs and Balanced Pairs
Nieke
Aerts
Decompositions of optimal 1-planar graphs
Stefan
Felsner
Generalized Schnyder woods and box contact graphs in higher dimensions
June 2013
Linda
Kleist
On the queue and track number of planar graphs
Debajyoti
Mondal
Acyclic Coloring with Few Division Vertices
Thibault
Manneville
Counting edges of linear extension graphs
Irina
Mustaţă
On visibility and k-visibility graphs
Udo
Hoffmann
Interval Dimension and Bipartite Graphs
May 2013
Stefan
Felsner
GIGs and Dimension
Lydia
Scheel
Die Max-Algebra und ihre Anwendung in der Graphentheorie und Optimierung
Nieke
Aerts
Not all (2,2)-tight graphs have an L-Contact representation, nor an L-Contact representation allowing degenerate L-shapes.
Henrik
Schrezenmaier
Ein Luftdruckparadigma zur Optimierung von Zerlegungen
Thomas
Hixon
Hook Graphs and More
Linda
Kleist
On a Geometric Partitioning Problem.
April 2013
Irina
Mustaţă
On the Recognition of Orthogonal Ray Graphs
Isabel
Beckenbach
Hall Bedingung für Hypergraphen
Maurice
Liebner
Von perfekten Matchings zu stabilen Hochzeiten
Veit
Wiechert
The Balanced Pair Conjecture for Antimatroids
Udo
Hoffmann
Clique Minimal Separator Decomposition and Intersection Graphs of Trees in a Cactus.
March 2013
Ariadne
Bolz
Algebraische obere Schranken für Codes
Daniel
Heldt
The face flip markov chain is rapidly mixing on 2-orientations of plane quadrangulations of maximum degree 4
Nieke
Aerts
Straight Line Triangle Representations
Irina
Mustaţă
Orthogonal Ray Graphs and Trees
Tobias
Buchwald
Domino Tilings auf dem Torus.
February 2013
Nieke
Aerts
Extremal Graphs Having No Independent Cutsets
Stefan
Felsner
Table Cartograms
January 2013
Udo
Hoffmann
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(log log n) colors.
Daniel
Heldt
The Shannon capacity of C_5
December 2012
Nieke
Aerts
A characterisation of Generic Circuits.
Irina
Mustata
Efficient representations of unit grid intersection graphs
November 2012
Viola
Mészáros
Geometric graphs with few disjoint edges
Stefan
Felsner
Exploiting Air-Pressure to Map Floorplans on Point Sets
Matjaz
Kovse
Betweenness
Kolja
Knauer
Partial Cubes: Lattices and Topology
October 2012
Udo
Hoffmann
Recognition of Simple-Triangle Graphs and Linear-Interval Orders is Easy
Andrei
Asinowski
Orders induced by segments in floorplans, and (2-14-3, 3-41-2)-avoiding permutations
Katharina
Jochemko
Arithmetic of marked order polytopes and monotone triangle reciprocity
September 2012
Tillmann
Miltzow
Unique Bichromatic Matchings
Stefan
Felsner
Coloring rectangle intersection graphs
August 2012
Joachim
Schröder
Eigensequences; Kirchhoff and Graphs
George B.
Mertzios
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy
George
Mertzios
The Intersection of Tolerance and Cocomparability Graphs
Viola
Mészáros
Compatible matchings and planar straight line graphs
Irina
Mustata
The jump number of 2-directional orthogonal ray graphs
June 2012
Nieke
Aerts
Straight Line Triangle Representation of a Graph
Stefan
Felsner
Covering partial cubes with cuts
Torsten
Ueckerdt
L-Contact and Segment-Contact is the same
May 2012
Kolja
Knauer
Drawing outerplanar graphs with few slopes
Daniel
Heldt
Conductance, congestion and canonical paths of Markov chains
Stefan
Felsner
A note on proportional contact representations
Udo
Hoffmann
Recognition of Simple Triangle Graphs
April 2012
Irina
Mustata
Unit grid intersection graphs: Properties and relationships to other graph classes
Viola
Mészáros
Graph Sharing Games
March 2012
Thomas
Hixon
Cyclic segment graphs and diagonal hook graphs
Kristian
Dannowski
Chromatic Invariants of Shift Graphs and Kneser Graphs
Bartosz
Walczak
The chromatic number of geometric intersection graphs
February 2012
Torsten
Ueckerdt
How many bends for one additional direction?
Hao
Chen
The distance geometry for the kissing balls
January 2012
Veit
Wiechert
The dimension of posets with outerplanar cover or planar comparability graphs
Marie
Albenque
Constellations and multicontinued fractions: application to Eulerian triangulations
Stefan
Felsner
The graphs that can be drawn with one bend per edge
Nieke
Aerts
Matchings that yield 'good' triangle representations
December 2011
Irina
Mustata
2-Directional Orthogonal Ray Graphs
Timo
Strunk
Labellings and decompositions of planar and toroidal quadrangulations
November 2011
Viola
Mészáros
The upper bound for separated matchings
Daniel
Heldt
Three families of graphs with bad conductance for the face-flip Markov chain on α-orientations
October 2011
Marie
Albenque
Computing numbers with balls and urns
Thomas
Hixon
Weak conflict free colourings
Kolja
Knauer
The hull number of partial cubes
Torsten
Ueckerdt
Crossing-free curves within pseudodiscs
September 2011
Bartłomiej
Bosek
and
Grzegorz
Matecki
Generalization of Dilworth's Theorem and Semiantichain Conjecture
Stefan
Felsner
Squaring the Torus
Alex
Sheive
The Group Theory of Spinpossible
Irina
Mustata
Jump number(s) of partially ordered sets
Maximilian
Werk
Rhombische Pflasterungen von Dreiecken
August 2011
Daniel
Heldt
Sampling Schnyder-woods of planar triangulations with max degree ≤6
Nieke
Aerts
Graphs that yield safe communication schemes
Thomas
Hixon
The Tron Problem
Marie
Albenque
Planar maps and continued fractions
July 2011
Kolja
Knauer
Cayley graphs of semigroups
Thomas
Picchetti
How to compute a squaring?
Stefan
Felsner
Trapezoidal dissections and Markov chains
June 2011
Jawaherul
Alam
Proportional Contact Representations with Rectilinear Polygons
Raphael
Traut
Zeichnen von Ordnungen; Eine Experimentalstudie
Torsten
Ueckerdt
Introducing the bar visibility number of a graph
May 2011
Irina
Mustata
Tolerance graphs as trapezoid graphs and NP-completeness
Marie
Albenque
On the enumeration of simple symmetric quadrangulations
Daniel
Heldt
Groebner bases for order theorists
April 2011
Veit
Wiechert
Planar Posets and Dimension 2
Thomas
Hixon
Crossing a bridge at night
Kolja
Knauer
A graph-theoretical axiomatization of oriented matroids
March 2011
Julia
Rucker
On Rectangle Contact Representations
Kai
Lawonn
The Colin de Verdiere Graph Parameter
Verena
Richter
Pflasterung orthogonaler Polygone mit Rechtecken
February 2011
Stefan
Felsner
Contact Representations of Planar Graphs with Weights
Torsten
Ueckerdt
The Isometric Dimension of Median Graphs via a Generalization of Birkhoff's Representation Theorem
Marie
Albenque
A bijection between fractional trees and pentagulations of girth 5
January 2011
Richard
Sieg
Dissections of polygons and the cylinder into triangles of equal areas
Irina
Mustata
Grid Intersection Graphs
Stefan
Felsner
Contact representations of planar graphs with cubes
Torsten
Ueckerdt
Online Coloring of Bounded-Tolerance Graphs
December 2010
Thomas
Hixon
On the crossing number of complete and complete bipartite graphs
Daniel
Heldt
Some remarks on the behavior of a local operating Markov chain on the set of k-heights
November 2010
Veit
Wiechert
Planar posets and dimension
Tobias
Mueller
Line arrangements and geometric graph classes
Mathew
Francis
The class of segment graphs
September 2010
Stefan
Felsner
d-Schnyder structures
August 2010
Torsten
Ueckerdt
CAT-Enumeration of the Ideals of a Planar Poset
July 2010
Stefan
Felsner
Square Tilings and Extremal Length
Daniel
Heldt
A glimpse at the kernel method and Knuth's approach to the ballot problem
June 2010
Petr
Gregor
Linear extension diameter of subposets of Boolean lattice induced by two levels
Osmanbey
Uzunkol
Konstruktion elliptischer Kurven mit vorgegebener Ordnung
May 2010
Kolja
Knauer
Lattices and Set Systems
Stefan
Felsner
Transitive orientation and vertex partitioning
Daniel
Heldt
Walking on a path (with loops) II
April 2010
Till
Miltzow
Punkte mit grosser Quadrantentiefe
Torsten
Ueckerdt
Coroutines and Hamiltonian Paths in Lattices
Hendrik
Lüthen
Abzählprobleme für Pfade im Gitterstreifen
March 2010
Torsten
Ueckerdt
Enumerating all Ideals of a Poset - Some Special Cases
Torsten
Ueckerdt
How far is a graph from being an interval graph?
Kolja
Knauer
Edge-intersection graphs of grid paths
Julia
Rucker
Triangle contact representations of plane graphs
Agelos
Georgakopoulos
Hyperbolic graphs, fractal boundaries, and graph limits
February 2010
Stefan
Felsner
Antichains of (k+k)-free posets
Tomasz
Krawczyk
On-line dimension of orders
Bartosz
Walczak
Parity in graph sharing games
Tom
Trotter
On the Size of Maximal Antichains and the Number of Pairwise Disjoint Maximal Chains
January 2010
Torsten
Ueckerdt
One way to generalize interval graphs: edge-intersection graphs of elbows in the plane grid
Kolja
Knauer
Generalizing the order polytope
Daniel
Heldt
Walking on a path (with loops) I
Cornelia
Dangelmayr
Neues zum Satz von Hanani und Tutte
December 2009
Andrea
Hoffkamp
Funktionales Denken im propädeutischen Analysisunterricht - Ansätze und empirische Befunde zu einem qualitativen Zugang durch Computereinsatz II
Andrea
Hoffkamp
Funktionales Denken im propädeutischen Analysisunterricht - Ansätze und empirische Befunde zu einem qualitativen Zugang durch Computereinsatz I
Stefan
Felsner
Lower bounds for on-line chain partitioning
Bartłomiej
Bosek
and
Tomasz
Krawczyk
A subexponential upper bound for the on-line chain partitioning problem
November 2009
Stefan
Felsner
Coding and Counting Arrangements of Pseudolines
Torsten
Ueckerdt
The Balloon Popping Problem
Stefan
Felsner
Planar Bipartite Posets
Daniel
Heldt
Sensitivity of 3-heights on a path
October 2009
Till
Miltzow
Points with Some Quadrant Depth
Kolja
Knauer
Polynomial Time Recognition of Cocircuit Graphs of Uniform Oriented Matroids
Torsten
Ueckerdt
Enumerating all Ideals of a Poset
September 2009
Stefan
Felsner
Squarings of Quadrangulations
Vincent
Pilaud
A failed construction of the multiassociahedron
Mareike
Massow
Swap Colors in Linear Extension Graphs
August 2009
Daniel
Heldt
Layer decomposition of planar graphs
July 2009
Balchandra
Thatte
Reconstruction of Pedigrees
Julia
Pap
Kernels and Sperner's Lemma
Daniel
Heldt
Computational aspects of mixing heights
Matjaz
Kovse
Topological representations of planar partial cubes
June 2009
Kolja
Knauer
Antimatroids, Polytopes and ULDs
Torsten
Ueckerdt
(Linear) Induced Forests in Planar Graphs
Stefan
Felsner
Condorcet Domains and Arrangements of Pseudolines
Pavel
Valtr
On Triconnected and Cubic Plane Graphs on Given Point Sets
May 2009
Stefan
Felsner
Rectangular layouts: associated graphs and constructions.
Florent
Becker
Curry-Hähnchen zu Mittag (An Introduction to Curry-Howard and the Coq Proof-Assistant)
Tobias
Friedel
Root Systems and Generalized Associahedra
April 2009
Sarah
Li
Adjacency Posets
Mareike
Massow
Convex Partitions of the Permutahedron
Jan
Foniok
Constraint Satisfaction and Category Theory: Constructing Tractable Templates
March 2009
Daniel
Heldt
A Short Introduction to Block Cipher Algorithms
Anton
Dochtermann
Graph Homomorphisms and Reflection Positivity
Torsten
Ueckerdt
On Quadrant-Depth - Closing the Gap
Melanie
Win Myint
Compactness proofs for infinite graphs
February 2009
Stefan
Felsner
On Quadrant-Depth
Kolja
Knauer
Generalized Chip Firing
Mareike
Massow
Linear Extension Diameter of Boolean Lattices
January 2009
Stefan
Felsner
Sorting Pairs in Bins, aka 'Das Krawattenraetsel'
Torsten
Ueckerdt
On the number of non-decreasing paths in grid graphs
Mihyun
Kang
Yet Another Way of Counting Planar Graphs
Paul
Bonsma
Avaloqix is strongly PSPACE-hard
December 2008
Florent
Becker
Self-Assembling Tilings, Orders and Signal Systems
Britta
Peis
Covering Graphs by Colored Stable Sets
Bruno
Benedetti
Bipartite Graphs and Basic k-Covers
November 2008
Daniel
Heldt
A Reason Why Avaloqix Could Be 'Interesting' (i.e. NP-hard)
Melanie
Win Myint
An Algebraic Characterization of Planar Graphs
Mareike
Massow
The Boolean Lattice and its Linear Extension Diameter
Sarah
Li
Characterization of Maps with Order Dimension at most 2
October 2008
Stefan
Felsner
Partitioning Boolean Lattices into Intervals
Hal
Kierstead
Efficient packing via game coloring
Torsten
Ueckerdt
How to Eat 4/9 of a Pizza
Daniel
Heldt
and
Jannik
Matuschke
and
Madeleine
Theile
Avaloqix - A Max Flow Game
September 2008
Bartłomiej
Bosek
and
Kamil
Kloch
Online Dimension of Semi-Orders with Representation
Kamil
Kloch
and
Piotr
Micek
Some Open Problems We Like
July 2008
Uwe
Schauz
Tutte's Flow Conjectures and Berlekamp's Switching Game
Bernd
Sturmfels
Evolution on distributive lattices
Torsten
Ueckerdt
Distributive polyhedra and related problems on weighted parameterized graphs
Melanie
Win Myint
Cycles and Bicycles in Locally Finite Graphs II
June 2008
Felix
Fischer
Voting Caterpillars
Melanie
Win Myint
Cycles and Bicycles in Locally Finite Graphs I
Peter
Allen
A connection between Ramsey number and chromatic number
Mareike
Massow
LINEAR EXTENSION DIAMETER is NP-complete
May 2008
Sarah
Li
Random Walks and Search Problems
Ludmila
Scharf
Inducing Polygons of Line Arrangements
Mareike
Massow
Linear Extensions in Diametral Pairs Don't Have to Be Reversing
April 2008
Paul
Bonsma
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Uwe
Schauz
Mr. Paint and Mrs. Sandpaper
Axel
Werner
Linkages in Polytope Graphs
Bernd
Sturmfels
Permutohedra, Semigraphoids, and Mice
March 2008
Stefan
Felsner
Hamiltonicity Properties of Arrangement Graphs
Kolja
Knauer
On Frankl's Conjecture
Cornelia
Dangelmayr
k-Segments in Arrangements of Pseudolines
February 2008
Patrick
Baier
Distributed Computation of Virtual Coordinates
Stefan
Felsner
Markov Chains and the Second Eigenvalue
Moritz
Schmitt
The Spectrum of a Graph
Anton
Dochtermann
Foldings and the Topology of Graph Homomorphisms
January 2008
Mareike
Massow
Reconstructing Posets from Linear Extension Graphs
Kolja
Knauer
A Distributive Lattice on Pseudo-Flows
Gesine
Koch
Counting Paths in Cube Configurations
Paul
Bonsma
A Polynomial Time Algorithm for Finding Fullerene Patches
December 2007
Graham
Brightwell
Polyhedral Methods for Linear Extensions of Partial Orders
Sarah
Li
The Dictator Paradox
Stefan
Felsner
Sorting Using Networks of Stacks and Queues
November 2007
Florian
Zickfeld
Leafy Trees in Planar Graphs
Nina
Siebold
How to Draw an Order
Leonid
Ioffe
Dimension Of Orders via Constraint Programming
Patrick
Baier
Greedy Drawings of Planar Triangulations
October 2007
Cornelia
Dangelmayr
k-Level Complexity of Arrangements of (Pseudo-)Segments
Kolja
Knauer
Construction of Steiner Triple Systems
Martin
Pergel
Recognition and Optimization Problems on Geometric Intersection Graphs
Balazs
Keszegh
Weak Conflict-Free Colorings of Point Sets and Simple Regions
September 2007
Florian
Pfender
Turan's Theorem for Multipartite Graphs
Stefan
Felsner
Compact Drawings with Bends
Mareike
Massow
Partitioning Posets
August 2007
Stefan
Felsner
Matchings and Edge Colorings in Regular Graphs
Carolyn
Chun
Unavoidable Minors of c-connected Graphs
Bertrand
Marc
2-Arrangements of Pseudolines
July 2007
Florian
Zickfeld
Leafy Trees
Eric
Fusy
A bijection between loopless maps and triangulations
Patrick
Baier
Digital Geometry
Stefan
Felsner
Infeasibility of Arrangements
June 2007
Kamil
Kloch
and
Tomasz
Krawczyk
and
Piotr
Micek
On-line Dimension of Intervals
Kamil
Kloch
On-line Colouring of Intervals
Olivier
Bernardi
Bijective Countings of Tree-Rooted Maps
Cornelia
Dangelmayr
Planar Graphs are in 1-STRING
May 2007
Stefan
Felsner
On-line chain partitions of up-growing 2-dimensional orders
Felix
Breuer
Perlenketten mit Quoten
Mareike
Massow
Diametral Pairs of Linear Extensions of a Poset
Florian
Zickfeld
Hardness of Counting Orientations with Fixed Out-Degrees
April 2007
Sarah
Kappes
Was ist ein semidefinites Programm?
Patrick
Baier
Compass Routing
Cornelia
Dangelmayr
Pseudo-Connections in the Plane
Stefan
Felsner
Triangle Contact Representations of Graphs
March 2007
Andreas
Hoffmeister
Random sampling in distributive lattices
Stefan
Felsner
Online Ramsey Theory
January 2007
Mareike
Massow
2-Dimensional Partial Orders Revisited
Florian
Zickfeld
Counting Planar Eulerian Orientations is #P-complete
Cornelia
Dangelmayr
How Many 3-Pseudosegments can a Pseudoline Arrangements have?
Patrick
Baier
The Crossing Number of Geometric Complete Graphs
December 2006
Stefan
Felsner
Arrangements of pseudolines; news, problems, and goodies.
Kolja
Knauer
α-Orientations and Regular Oriented Matroids
Kolja
Knauer
α-Orientations and FlipFlops
November 2006
Sarah
Kappes
Kombinatorik orthogonaler Flächen
Florian
Zickfeld
α-Orientations and Bipartite Perfect Matchings
Leonid
Ioffe
Constraint Programming
Martin
Pergel
On Complicacy of Graphs Representable by Polygons
October 2006
Dominik
Piesker
Spezialfälle der 'list edge coloring conjecture'
Stefan
Felsner
Baxter and Schröder Families
August 2006
Patrick
Baier
Adaptive colouring of upgrowing posets
July 2006
Cornelia
Dangelmayr
Dominating pairs in AT-free graphs
Stefan
Felsner
Counting Bipolar Orientations on the Grid
June 2006
Sarah
Kappes
Convex-Pseudo Decompositions
Maria del Pilar
Sabariego Arenas
3-Loop Networks with many Minimum Distance Diagrams
Eric
Fusy
Enumeration of Bipolar Orientations
Johan
Nilsson
The Gupta-Newman-Rabinovich-Sinclair Conjecture
May 2006
Florian
Zickfeld
Integer Realizations of 3-Polytopes
Stefan
Felsner
Proofs of Untileability
Cornelia
Dangelmayr
Cocomparability graphs of posets with (interval) dimension at most two
Patrick
Baier
Online Chain Partitioning of Upgrowing Interval Posets - The Upper Bound
Mareike
Massow
Semi Bar 1-Visibility Graphs
April 2006
Harald
Schülzke
The Normal Graph Conjecture for line graphs
Steffen
Melang
Bipolar Orientations
Maria del Pilar
Sabariego Arenas
Circulant Graphs and Binomial Ideals
March 2006
Florian
Zickfeld
On the Number of 3-Orientations of a Triangulation
Sarah
Kappes
A binary labeling for the angles of a plane quadrangulation
Johan
Nilsson
Reachability substitutes
February 2006
Stefan
Felsner
Two Algorithms for Bipartite Cardinality Matching
Mareike
Massow
Bar 1-Visibility Graphs - Introduction and First Results
Stefan
Felsner
Counting Linear Extensions
January 2006
Georg
Melamed
Skelette 3-dimensionaler Ordnungen
Cornelia
Dangelmayr
A Representation of the Subset 'VPT' of Chordal Graphs as Intersection Graphs of Pseudosegments
Patrick
Baier
The Upper Bound for Online Chain Covering of Upgrowing Interval Posets
December 2005
Florian
Zickfeld
Schnyder Woods and Pairs of Non-Crossing Dyck Paths
Stefan
Felsner
Box Graphs and Graph Dimension
November 2005
Viktor
Blåsjö
On the Braid Page of Gauss' Handbook 7
Sarah
Kappes
Realizers for d-polytopes with d+2 vertices
Cornelia
Dangelmayr
Relations within the class of intersection graphs
Patrick
Baier
A special case of online chain covering of posets
Stefan
Felsner
Dualization in Products of Chains
October 2005
Florian
Pfender
Visibility Graphs on Point Sets
Mareike
Massow
What makes the treewidth large?
September 2005
Viktor
Blåsjö
Enumeration of Reduced Words in Combinatorial Group Theory
Krisztián
Tichler
Lies and Hypercubes
August 2005
Florian
Zickfeld
A Schnyder Wood with no rigid AND coplanar embedding
Sarah
Kappes
Orthogonal Surfaces - A combinatorial definition for characteristic points
Eric
Fusy
Enumeration of d-polytopes with d+3 vertices
Stefan
Felsner
Poset Polytopes and Linear Extensions
July 2005
Cornelia
Dangelmayr
Intersection Graphs
Patrick
Baier
An upper bound for online chain covering
June 2005
Florian
Pfender
Closure and Hamiltonian Properties in Claw-free Graphs
Kamil
Kloch
Partial Orders - fooling Alice
Sarah
Kappes
What is an orthogonal complex?
Krisztián
Tichler
A Combinatorial Property of Databases
May 2005
Dan
Kral
Claws and Paws