Abstract is missing.
- Algorithmic Gems in the Data Miner's CavePaolo Boldi. 1-15 [doi]
- Fun with Fonts: Algorithmic TypographyErik D. Demaine, Martin L. Demaine. 16-27 [doi]
- Happy Edges: Threshold-Coloring of Regular LatticesMd. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter. 28-39 [doi]
- Classic Nintendo Games Are (Computationally) HardGreg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta. 40-51 [doi]
- On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation MethodMichele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes. 52-63 [doi]
- No Easy Puzzles: A Hardness Result for Jigsaw PuzzlesMichael Brand. 64-73 [doi]
- Normal, Abby Normal, Prefix NormalPeter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada. 74-88 [doi]
- Nonconvex Cases for Carpenter's RulersKe Chen, Adrian Dumitrescu. 89-99 [doi]
- How to go Viral: Cheaply and QuicklyFerdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro. 100-112 [doi]
- Synchronized Dancing of Oblivious ChameleonsShantanu Das 0001, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro. 113-124 [doi]
- Another Look at the Shoelace TSP: The Case of Very Old ShoesVladimir G. Deineko, Gerhard J. Woeginger. 125-136 [doi]
- Playing Dominoes Is Hard, Except by YourselfErik D. Demaine, Fermi Ma, Erik Waingarten. 137-146 [doi]
- UNO Gets Easier for a Single PlayerPalash Dey, Prachi Goyal, Neeldhara Misra. 147-157 [doi]
- Secure Auctions without CryptographyJannik Dreier, Hugo Jonker, Pascal Lafourcade. 158-170 [doi]
- Towards an Algorithmic Guide to Spiral GalaxiesGuillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz. 171-182 [doi]
- Competitive Analysis of the Windfall GameRudolf Fleischer, Tao Zhang. 183-193 [doi]
- Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract)Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc. 194-205 [doi]
- Zombie Swarms: An Investigation on the Behaviour of Your Undead RelativesVincenzo Gervasi, Giuseppe Prencipe, Valerio Volpi. 206-217 [doi]
- Approximability of Latin Square Completion-Type PuzzlesKazuya Haraguchi, Hirotaka Ono. 218-229 [doi]
- Sankaku-Tori: An Old Western-Japanese Game Played on a Point SetTakashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi. 230-239 [doi]
- QuellMinghui Jiang, Pedro J. Tejada, Haitao Wang. 240-251 [doi]
- How Even Tiny Influence Can Have a Big Impact!Barbara Keller, David Peleg, Roger Wattenhofer. 252-263 [doi]
- Optimizing Airspace Closure with Respect to Politicians' EgosIrina Kostitsyna, Maarten Löffler, Valentin Polishchuk. 264-276 [doi]
- Being Negative Makes Life NP-hard (for Product Sellers)Sven Oliver Krumke, Florian D. Schwahn, Clemens Thielen. 277-288 [doi]
- Clearing Connections by Few AgentsChristos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski. 289-300 [doi]
- Counting Houses of Pareto Optimal Matchings in the House Allocation ProblemAndrei Asinowski, Balázs Keszegh, Tillmann Miltzow. 301-312 [doi]
- Practical Card-Based CryptographyTakaaki Mizuki, Hiroki Shizuya. 313-324 [doi]
- The Harassed Waitress ProblemHarrah Essed, Wei Therese. 325-339 [doi]
- Lemmings Is PSPACE-CompleteGiovanni Viglietta. 340-351 [doi]
- Finding Centers and Medians of a Tree by Distance QueriesBang Ye Wu. 352-363 [doi]
- Swapping Labeled Tokens on GraphsKatsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno. 364-375 [doi]