Abstract is missing.
- Distributed Algorithms by Forgetful Mobile RobotsPaola Flocchini. 1 [doi]
- Stability and Metastability of the Logit Dynamics of Strategic GamesGiuseppe Persiano. 2 [doi]
- Art Galleries, k-modems, and k-convexityJorge Urrutia. 3 [doi]
- The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar SubgraphsTerry Anderson, Therese C. Biedl. 4-15 [doi]
- Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All BoxEsther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk. 16-27 [doi]
- The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else GoodbyeMichael A. Bender, Ritwik Bose, Rezaul Chowdhury, Samuel McCauley. 28-39 [doi]
- Mad at Edge Crossings? Break the Edges!Till Bruckdorfer, Michael Kaufmann. 40-50 [doi]
- Train Marshalling Is Fixed Parameter TractableLeo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond. 51-56 [doi]
- Conflict-Free Graph Orientations with Parity ConstraintsSarah Cannon, Mashhood Ishaque, Csaba D. Tóth. 57-68 [doi]
- The Multi-interval Ulam-Rényi GameFerdinando Cicalese. 69-80 [doi]
- Picture-Hanging PuzzlesErik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu. 81-93 [doi]
- Optimal Sensor Networks for Area Monitoring Using Rotating and Beam SensorsStefan Dobrev, Lata Narayanan, Jaroslav Opatrny. 94-106 [doi]
- The Byzantine Brides ProblemSwan Dubois, Sébastien Tixeuil, Nini Zhu. 107-118 [doi]
- Lean Programs, Branch Mispredictions, and SortingAmr Elmasry, Jyrki Katajainen. 119-130 [doi]
- On Computer Integrated Rationalized Crossword Puzzle ManufacturingJakob Engel, Markus Holzer, Oliver Ruepp, Frank Sehnke. 131-141 [doi]
- Solving Single-Digit Sudoku SubproblemsDavid Eppstein. 142-153 [doi]
- Finding Good Coffee in ParisPaola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro. 154-165 [doi]
- To Satisfy Impatient Web Surfers Is HardFedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse. 166-176 [doi]
- Making Life Easier for FirefightersFedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen. 177-188 [doi]
- Counting Perfect Matchings in Graphs of Degree 3Martin Fürer. 189-197 [doi]
- M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon PatternsEllen Gethner, David G. Kirkpatrick, Nicholas Pippenger. 198-209 [doi]
- On the Complexity of Rolling Block and Alice MazesMarkus Holzer, Sebastian Jakobi. 210-222 [doi]
- Grid Graphs with Diagonal Edges and the Complexity of Xmas MazesMarkus Holzer, Sebastian Jakobi. 223-234 [doi]
- Algorithms and Complexity of Generalized River Crossing ProblemsHiro Ito, Stefan Langerman, Yuichi Yoshida. 235-244 [doi]
- Solving Tantrix via Integer ProgrammingFumika Kino, Yushi Uno. 245-257 [doi]
- Scrabble Is PSPACE-CompleteMichael Lampis, Valia Mitsou, Karolina Soltys. 258-269 [doi]
- Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted SetKevin J. Lang. 270-281 [doi]
- Spanning Trees and the Complexity of Flood-Filling GamesKitty Meeks, Alexander Scott. 282-292 [doi]
- $\texttt{\rm Tron}$ , a Combinatorial Game on Abstract GraphsTillmann Miltzow. 293-304 [doi]
- Divorcing Made EasyKirk Pruhs, Gerhard J. Woeginger. 305-314 [doi]
- A New Analysis of Best Fit Bin PackingJiri Sgall. 315-321 [doi]
- The Coolest Order of Binary StringsBrett Stevens, Aaron Williams. 322-333 [doi]
- Hitori NumberAkira Suzuki, Kei Uchizawa, Takeaki Uno. 334-345 [doi]
- Computing Maximum Hamiltonian Paths in Complete Graphs with Tree MetricWojciech Rytter, Bartosz Szreder. 346-356 [doi]
- Gaming Is a Hard Job, But Someone Has to Do It!Giovanni Viglietta. 357-367 [doi]
- Hardness of MastermindGiovanni Viglietta. 368-378 [doi]
- Scienceography: The Study of How Science Is WrittenGraham Cormode, S. Muthukrishnan, Jinyun Yan. 379-391 [doi]