Theory of Combinatorial Algorithms Institute for Theoretical Computer Science Department of Computer Science ETH Zurich

6th Gremo's Workshop on Open Problems 2008

Picture of Kurshaus Lindenbuehl

September 8-10, 2008
Kurshaus Lindenbuehl, Trogen(AR), Switzerland

Combinatorial Algorithms Day on Wednesday, September 10th, 2008

Participants

  • Robert Berke
  • Yves Brise
  • Tobias Christ
  • Bernd Gärtner
  • Heidi Gebauer
  • Michael Hoffmann
  • Martin Jaggi
  • Robin Moser
  • Yoshio Okamoto
  • Andreas Razen
  • Dominik Scheder
  • Shakhar Smorodinsky
  • Marek Sulovský
  • Miloš Stojaković
  • Emo Welzl
  • Philipp Zumstein

Results

Twenty problems were proposed by the participants. At least three of them were solved - completely or partially - during the workshop:
  • Problem 1: Minimum Spanning Tree Verification,
  • Problem 6: Avoidance games on graphs,
  • Problem 13: Can you escape from your furthest neighbors?,
  • Problem 17: Eating Pizza, and
  • Problem 20: Blocking Points from Lines.

Previous Workshops

1st GWOP 2003 in Stels (GR)
2nd GWOP 2004 in Cumpadials (GR)
3rd GWOP 2005 in Kappel am Albis (ZH)
4th GWOP 2006 in Wislikofen (AG)
5th GWOP 2007 in Illgau (SZ)
Last Modified: $Date: 2008/09/04 16:58:00 $ by $Author: hoffmann $. Valid HTML 4.01!