BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION:  Many nice results in graph theory involve the characterizatio
 n of a graph class in terms of a set of forbidden obstructions. In this tal
 k I will consider the problem of understanding whether a class of graph dra
 wings can be characterized by a set of forbidden obstructions.  I will do a
 n overview on interesting recent results that fall under this theme\, but I
  will emphasize more on those related to geometric arrangements.  
DTSTAMP:20191206T140500
DTSTART:20200120T160000
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Alan Arroyo (Institute of Science and Technology Austria): Obstruct
 ions in graph drawings
UID:95692917@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20200120-C-Arr
 oyo.html
END:VEVENT
END:VCALENDAR