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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 16, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Abel Guardian Camacho (45m, student GD)

Matched Drawings of Planar Graphs

A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. Di Giacomo et al. introduced the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We review their results and, in particular, show that (i) two 3-connected planar graphs may not be matched drawable, while (ii) two trees are always matched drawable.

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

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