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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 22, 2024, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Michael Hoffmann

Bipartite Dichotomous Ordinal Graphs

A dichotomous ordinal graph is an undirected graph where every edge is specified to be either short or long. We study geometric representations of these graphs, which are straight-line drawings where the short edges are exactly those edges of at most unit length. We characterize the complete bipartite graphs for which all corresponding dichotomous ordinal graphs admit a geometric representation. Moreover, we show that any bipartite dichotomous ordinal graph admits a geometric representation if the short edges induce an outerplanar graph. Joint work with Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Eleni Katsanou, Fabrizio Montecchiani, and Antonios Symvonis.

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

Previous talks by year:   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