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

7th Gremo's Workshop on Open Problems 2009

Picture of Hof de Planis

July 6-10, 2009
Hof de Planis, Stels (GR), Switzerland

Combinatorial Algorithms Day on Monday, July 6th, 2009

Participants

  • Yves Brise
  • Erik Buchin
  • Kevin Buchin
  • Maike Buchin
  • Tobias Christ
  • Péter Csorba
  • Radoslav Fulek
  • Bernd Gärtner
  • Heidi Gebauer
  • Michael Hoffmann
  • Jirka Matoušek
  • Robin Moser
  • Yoshio Okamoto
  • Dömötör Pálvölgyi
  • Golan Pundak
  • Andreas Razen
  • Andrea Salow
  • Shakhar Smorodinsky
  • József Solymosi
  • Bettina Speckmann
  • Miloš Stojaković
  • Marek Sulovský
  • Tibor Szabó
  • Patrick Traxler
  • Csaba Tóth
  • Uli Wagner
  • Emo Welzl
  • Philipp Zumstein

Results

Thirty-seven problems were proposed by the participants. At least three of them were solved - completely or partially - during the workshop:
  • Problem 4: Vectors in a Box,
  • Problem 7: Weighted Graph Pebbling Games,
  • Problem 11: Can Digital Segments be Straight?, and
  • Problem 29: Finding max and min with lies.

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)
6th GWOP 2008 in Trogen (AR)
Last Modified: $Date: 2009/07/01 17:15:00 $ by $Author: hoffmann $. Valid HTML 4.01!