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

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Nicolas Grelier

Nearest-Neighbor Decompositions of Drawings

Let D be a straight-line drawing of a graph in the plane, and let c be a positive integer. We say that D has a nearest-neighbor decomposition into c parts if there are point sets P1,...,Pc such that D is the union of the nearest neighbor graphs on P1,...,Pc. We study the complexity of deciding whether it is possible to draw D as the union of c nearest-neighbor graphs. This is a joint work with Jonas Cleve, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer and Daniel Perz.

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