ComPoSe Voronoi Meeting
The
ComPoSe Voronoi Meeting begins on 8th of July and ends at 12th of July, 2013.
It takes place in Graz at the faculty of computer science (Graz University of Technology).
All talks and working sessions will be held in a room at the following location:
Inffeldgasse 16b
A8010 Graz
http://www.ist.tugraz.at/ http://www.igi.tugraz.at/
List of Participants
http://www.doodle.com/x2qvn7casg6c2zdq http://www.eurogigacompose.eu/events/graz2013_compose_voronoi/participants_schedule.htm
Accommodation
Hotel Stadthalle Johannes Münzgrabenstraße 48
A8010 Graz
http://www.stadthalle.co.at/
Hotel Landhaus Johannes Münzgrabenstraße 87
A8010 Graz
http://www.hotellandhausjohannes.at/
Schedule

Monday 
Tuesday 
Wednesday 
Thursday 
Friday 
09:30 

Talk 2 
Talk 3 
Talk 4a 
Working session 
10:00 

10:30 





11:00 

Working session 
Progress report session 
Talk 4b / working session 
Closing session 
11:30 

12:00 

Lunch (Ganster) 
Lunch (Zapo) 
Lunch (Ganster) 
Lunch (Zapo) 
12:30 

13:00 
Lunch (Trattoria) 
13:30 
Working session 
Working session 
Working session 

14:00 
Opening 

14:30 
Talk 1 

15:00 

15:30 


Business dinner 


16:00 
Open problem session 
Working session 
Working session 

16:30 

17:00 


Talks
The talks will be held in HS i12 (Inffeldgasse 16b).
Monday:
 Rolf Klein: "Abstract Voronoi diagrams"
 Bartosz Walczak: "New results and open problems on topological graphs"
Tuesday:
 Talk Pavel Valtr: "Cubic plane graphs on a given point set"
 Günter Rote / Viola Mészáros: "Voronoi games in graphs"
Wednesday:
 Elena Kramtcova: "On the Hausdorff Voronoi diagram"
 Tillmann Miltzow: "Intersecting a sublinear number of disjoint unit disks"
Thursday:
 Stefan Felsner: "The order dimension of planar maps revisited"
 Jean Cardinal: "Cellpaths in mono and bichromatic line arrangements in the plane"
 Gernot Walzl: "Vertex splitter for straight skeletons in 3space" pdf
 Bert Juettler: "Anisotropic Voronoi diagrams"
Open Problems
We have 2 rooms to work on open problems.
TODO: Please fill in your open problems. Attach/upload a description of the problem (PDF/LaTeX, half a page).
 t =2,3,... Find a digraph such that
 Every ttuple of vertices has a common direct predecessor;
 There is a (not necessarily proper) kcoloring of the arcs so that every directed cycle contains all colors. (k≥2, k as large as possible). (Günter Rote)
 Is there a tiling of space with a finite number of different tiles all of which are combinatorial pentagonal dodecahedra? (For example, a periodic tiling)
Business Dinner
A bus will take us from the faculty of computer science to
Krainerhof Zirknitz 9
A8511 St. Stefan
http://www.krainerhof.at/

GernotWalzl  20130522