- Christoph Ambühl
- Artur Andrzejak
- Robert Berke
- Kaspar Fischer
- Bernd Gärtner
- Joachim Giesen
- Michael Hoffmann
- Dieter Mitsche
- Yoshio Okamoto
- Andreas Paffenholz
- Eva Schuberth
- Ingo Schurr
- Shakhar Smorodinsky
- Bettina Speckmann
- Milos Stojakovic
- Tibor Szabó
- Ulrich Wagner
- Emo Welzl
Twenty-five problems were proposed by the participants. Three of
these problems have been solved during the workshop:
- Problem 6: Blackboard Drawing in General Position,
- Problem 10: Stable Sets in Bipartite Graphs, and
- Problem 25: Coloring Line-Arrangements.
Problem 4 (Large
MSTs in the Unit Circle) was solved by Christoph later on. (To
appear at ICALP 2005.)
Problem 8 (Trank) was solved
independently by Kim and Roush.
It turned out that the solution to Problem 1 (Closed
Formula for Power Series) was already known due to Loeffler.
Finally, there are partial results concerning
- Problem 3: Minimizing Gaussian Curvature,
- Problem 16: Optimizing over Ladders, and
- Problem 18: Path-Decompositions of 3-regular Graphs.
-
"An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks"
Christoph Ambühl.
Proc. 32nd Internat. Colloq. Automata Lang. Prog. (ICALP 2005), Lecture Notes Comput. Sci., Volume 3580, Lisbon, Portugal, 2005, 1139-1150.
-
"Core Stability of Minimum Coloring Games"
Thomas Bietenhader and Yoshio Okamoto.
Math. Oper. Res., Volume 31(2), 2006, 418-431.
-
"Unique Sink Orientation on Ladders"
Leonard Y. Rüst.
Chapter 3.3 in The P-Matrix Linear Complementarity Problem-Generalizations and Specializations, Diss. ETH, Volume 17387, 2007, 36-57.
-
"Relaxed Two-coloring of Cubic Graphs"
Robert Berke and Tibor Szabó.
J. Combin. Theory Ser. B, Volume 97(4), 2007, 652-668.
There is also a list of papers from all GWOPs.
Last modified: Thu May 2 16:51:06 2024
Valid HTML5