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, March 04, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Tim Taubner

Target-oriented Graph Drawings

Greedy graph drawings are characterized by the ability to perform greedy routing: A message with known geometric destination is simply forwarded to a neighbor closer to the destination. The path this message takes forms a so-called greedy path: A path where each vertex is closer to the destination than its predecessor(s). The drawback is that the length of a greedily paths could be unbounded in terms of the distance between start and target. Recently, stricter versions of greedy drawings have been proposed, which bound the detour by imposing further constraints on the path. In this talk I will present these classes of graph drawings, namely (weakly) self-approaching and increasing-chord drawings and survey what is known to date.

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