Abstract is missing.
- On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad FeaturesGiuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. 1-13 [doi]
- Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous GraphsNicola Santoro. 14 [doi]
- Fun with Sub-linear Time AlgorithmsLuca Trevisan. 15 [doi]
- Wooden Geometric Puzzles: Design and Hardness ProofsHelmut Alt, Hans Leo Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel. 16-29 [doi]
- HIROIMONO Is NP-CompleteDaniel Andersson. 30-39 [doi]
- Tablatures for Stringed Instruments and Generating FunctionsDavide Baccherini, Donatella Merlini, Renzo Sprugnoli. 40-52 [doi]
- Knitting for Fun: A Recursive SweaterAnna Bernasconi, Chiara Bodei, Linda Pagli. 53-65 [doi]
- Pictures from Mongolia - Partial Sorting in a Partial WorldPaolo Boldi, Flavio Chierichetti, Sebastiano Vigna. 66-77 [doi]
- Efficient Algorithms for the Spoonerism ProblemHans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel. 78-92 [doi]
- High Spies (or How to Win a Programming Contest)André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom. 93-107 [doi]
- Robots and Demons (The Code of the Origins)Yoann Dieudonné, Franck Petit. 108-119 [doi]
- The Traveling Beams Optical Solutions for Bounded NP-Complete ProblemsShlomi Dolev, Hen Fitoussi. 120-134 [doi]
- The Worst Page-Replacement PolicyKunal Agrawal, Michael A. Bender, Jeremy T. Fineman. 135-145 [doi]
- Die Another DayRudolf Fleischer. 146-155 [doi]
- Approximating Rational Numbers by FractionsMichal Forisek. 156-165 [doi]
- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku PuzzlesRonen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum. 166-182 [doi]
- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting AlgorithmsHermann Gruber, Markus Holzer, Oliver Ruepp. 183-197 [doi]
- The Troubles of Interior Design-A Complexity Analysis of the Game HeyawakeMarkus Holzer, Oliver Ruepp. 198-212 [doi]
- Drawing Borders EfficientlyKazuo Iwama, Eiji Miyano, Hirotaka Ono. 213-226 [doi]
- The Ferry Cover ProblemMichael Lampis, Valia Mitsou. 227-239 [doi]
- Web Marshals Fighting Curly Link FarmsFabrizio Luccio, Linda Pagli. 240-248 [doi]
- Intruder Capture in Sierpinski GraphsFlaminia L. Luccio. 249-261 [doi]
- On the Complexity of the Traffic Grooming Problem in Optical NetworksMordechai Shalom, Walter Unger, Shmuel Zaks. 262-271 [doi]