Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Friday, November 30, 2012, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Michael Kaufmann (Universität Tübingen)
To avoid crossings is one of the main tasks when drawing graphs. Recently, we proposed a new pragmatic approach, namely to draw graphs with only partially drawn edges. We developed formal models and efficient algorithms for different graph classes and raised a number of interesting combinatorial questions. In the talk, I will mainly focus on the case of straight-line drawings where the middle half of each edge is omitted.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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