BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: A colored linear layout of a graph is a total ordering of its 
 vertices together with a partition of its edges into color classes. In a st
 ack layout each color class is crossing-free\, in a queue layout each color
  class is nesting-free\, while in both cases our goal is to minimize the nu
 mber of colors. In this talk we discuss on a higher level approaches to fin
 d good stack or queue layouts for planar graphs\, including some recent bre
 akthroughs and open problems. 
DTSTAMP:20220503T173300
DTSTART:20220516T141500
CLASS:PUBLIC
LOCATION:Technische Universität Berlin\n Institut für Mathematik\n Straße d
 es 17. Juni 136\n 10623 Berlin\n Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Torsten Ueckerdt (Karlsruher Institut für Technologie\, KIT): Stack
  and Queue Layouts of Planar Graphs
UID:107920307@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20220516-L-Uec
 kerdt.html
END:VEVENT
END:VCALENDAR