Order & Geometry Workshop

The workshop will be an informal meeting of around 20 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. There will be perhaps one or two lectures and we will mainly sit and work in subgroups.

Here is a list of confirmed participants (23): Andrei Asinowski, Helena Bergold, Marcin Briański, Sergio Cabello, Jean Cardinal, Stefan Felsner, Éric Fusy, Rimma Hämäläinen, Jędrzej Hodor, Gwenaël Joret, Paul Jungeblut, Hoang La, Konrad Majewski, Piotr Micek, Sandro Roch, Felix Schröder, Manfred Scheucher, Michał Seweryn, Heather Smith, Raphael Steiner, Tom Trotter, Bartosz Walczak, and Marcin Witkowski.

organizers

Stefan Felsner, Technische Universität Berlin
Piotr Micek, Jagiellonian University, Kraków

former events

2020	Order & Geometry Workshop	Wittenberg, 4 days, 13 participants (COVID-19 times)
2018	Order & Geometry Workshop	Ciążeń Palace, 4 days, 24 participants
	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
	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
2011	Partially ordered sets: Methods and challenges	Kraków, 15 lectures & 15 exercise sessions by Tom Trotter (recorded and available on-line)

some results of previous workshops

• 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
  WG 2019.
• 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.