Wittenberg, September 10-15, 2024

The workshop will be an informal meeting of around 25 researchers working in combinatorics and theoretical computer science with special emphasis on discrete geometry, partially ordered sets and all kinds of interplays between them. 

This includes: geometric intersection graphs; geometric representations of graphs; point and line arrangements; Schnyder woods and related graph orientations; parameters of partially ordered sets, e.g. order dimension; Ramsey-type problems for orders, graphs, and geometric structures. The format of the workshop is problem and research oriented. 

Here is a preliminary list of attendees (28): Paul Bastide, Marthe Bonamy, Marcin Briański, Sergio Cabello, James Davies,  Ugo Giocanti, Daniel Gonçalves, Jędrzej Hodor, Michael Hoffmann, Gwenaël Joret, Balázs Keszegh, Hoang La, Robert Lauff, Clément Legrand-Duchesne, Torsten Mütze, János Pach, Michał Pilipczuk, Yan Alves Radtke, Clément Rambaud, Günter Rote, Felix Schröder, Michał Seweryn, Tom Trotter, Torsten Ueckerdt, Pavel Valtr, Bartosz Walczak, and organizers:

• Stefan Felsner, Technische Universität Berlin

• Piotr Micek, Jagiellonian University, Kraków 

There will be evening lectures:

• James Davies, Distance graphs in the plane with bounded and unbounded chromatic number

• Torsten Ueckerdt, Flipping Non-Crossing Spanning Trees on Convex Point Sets

The workshop will take place in LEUCOREA Conference Center (Wittenberg, Germany).

Former events:

2022  Order & Geometry Workshop  Ciążeń Palace, 5 days, 23 participants

2020  Order & Geometry Workshop  Wittenberg, 5 days, 13 participants
2018  Order & Geometry Workshop  Ciążeń Palace, 4 days, 24 participants

2018  Order & Geometry Fall School  Gutshof Sauen, 4 days, 4 lecturers, 25 participants
2016  Order & Geometry Workshop  Gułtowy Palace, 4 days, 35 participants

2013  Order & Geometry Workshop  Berlin, 4 days, 27 participants

2013  Order & Geometry Summer School  Döllnsee, 4 days, 4 lecturers, 24 participants

2012  Problems in Combinatorics and Posets session  Kraków, 4 days, 19 participants

Recorded lectures:

2020-21 Introduction to order theory, 30 lectures by SF and PM, all available at our YouTube channel

2011 Partially ordered sets: Methods and challenges, 15 lectures & 15 exercise sessions by Tom Trotter (recorded and available online)

Some results of previous workshops:

• On the Erdős-Szekeres Problem for Convex Permutations and Orthogonally Convex Point Sets
  Heather S. Blake, Stefan Felsner, Rimma Hämäläinen, and Marcin Witkowski
  (Presented at Permutation Patterns 2023; full version in preparation)

• Guillotine rectangulations and mesh patterns
  Andrei Asinowski, Jean Cardinal, Stefan Felsner, and Éric Fusy
  (Presented at Permutation Patterns 2023; full version in preparation)

• Posets with k-outerplanar cover graphs have bounded dimension
  Maximilian Gorsky, and Michał Seweryn
  submitted as of July 2022. 

• Boolean dimension and tree-width
  Stefan Felsner, Tamás Mészáros, and Piotr Micek
  Combinatorica (2020).

• Nowhere dense graph classes and dimension
  Gwenaël Joret, Patrice Ossona de Mendez, Piotr Micek, and Veit Wiechert
  Combinatorica 39, 1055--1079 (2019).

• Dual circumference and collinear sets
  Vida Dujmović and Pat Morin
  In Proceedings of the 35th Symposium on Computational Geometry (SoCG 2019), 29:1-29:17, 2019.

• Flip distances between graph orientations
  Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, and Birgit Vogtenhuber
  Algorithmica 83, pp. 116-143, 2021.

• Boxicity, poset dimension, and excluded minors
  Louis Esperet and Veit Wiechert
  Electronic Journal of Combinatorics 25(4), #P4.51, 2018.

• Intersection graphs of rays and grounded segments
  Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, and Birgit Vogtenhuber
  Journal of Graph Algorithms and Applications 22(2), 273--295, 2018.