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: Tuesday, June 21, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Csaba Dávid Tóth (MIT)

A vertex-face assignment for plane graphs

For any planar straight line graph (PSLG), there is a vertex-face assignment such that every vertex is assigned to at most two adjacent faces, and every face is assigned to all its reflex vertices and one more incident vertex. The existence of such an assignment implies, in turn, that any PSLG can be augmented to a connected PSLG such that the degree of every vertex increases by at most two.

(Joint work with Diane Souvaine)

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