Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (by J. Lengler, K. Bringmann, B. Gärtner, M. Hoffmann, R. Kyng, D.Steurer, V. Traub)

Mittagsseminar Talk Information

Date and Time: Thursday, February 26, 2026, 12:15 pm

Duration: 30 minutes

Location: OAT S15

Speaker: Patrick Schnider

Separoids and generalizations of outerplanarity

In this talk I will introduce the combinatorial framework of Separoids, which is a way to capture how sets in d-dimensional Euclidean space can be separated. In particular, I will focus on so-called witnesses of separoids and their relation to linear embeddings of simplicial complexes. This will allow us to give a higher-dimensional generalization of the fact that K_4 is not outerplanar.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2026  2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login