Distributed Algorithms by Forgetful Mobile Robots / Paola Flocchini
Stability and Metastability of the Logit Dynamics of Strategic Games / Giuseppe Persiano
Art Galleries, k-modems, and k-convexity / Jorge Urrutia
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs / Terry Anderson and Therese Biedl
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box / Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna and Alexander Kröller, et al.
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye / Michael A. Bender, Ritwik Bose, Rezaul Chowdhury and Samuel McCauley
Mad at Edge Crossings? Break the Edges! / Till Bruckdorfer and Michael Kaufmann
Train Marshalling Is Fixed Parameter Tractable / Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner and Christian Komusiewicz, et al.
Conflict-Free Graph Orientations with Parity Constraints / Sarah Cannon, Mashhood Ishaque and Csaba D. Tóth
The Multi-interval Ulam-Rényi Game / Ferdinando Cicalese
Picture-Hanging Puzzles / Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S.B. Mitchell and Ronald L. Rivest, et al.
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors / Stefan Dobrev, Lata Narayanan and Jaroslav Opatrny
The Byzantine Brides Problem / Swan Dubois, Sébastien Tixeuil and Nini Zhu
Lean Programs, Branch Mispredictions, and Sorting / Amr Elmasry and Jyrki Katajainen
On Computer Integrated Rationalized Crossword Puzzle Manufacturing / Jakob Engel, Markus Holzer, Oliver Ruepp and Frank Sehnke
Solving Single-Digit Sudoku Subproblems / David Eppstein
Finding Good Coffee in Paris / Paola Flocchini, Matthew Kellett, Peter C. Mason and Nicola Santoro
To Satisfy Impatient Web Surfers Is Hard / Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse
Making Life Easier for Firefighters / Fedor V. Fomin, Pinar Heggernes and Erik Jan van Leeuwen
Counting Perfect Matchings in Graphs of Degree 3 / Martin Fürer
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns / Ellen Gethner, David G. Kirkpatrick and Nicholas J. Pippenger
On the Complexity of Rolling Block and Alice Mazes / Markus Holzer and Sebastian Jakobi
Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes / Markus Holzer and Sebastian Jakobi.
Algorithms and Complexity of Generalized River Crossing Problems / Hiro Ito, Stefan Langerman and Yuichi Yoshida
Solving Tantrix via Integer Programming / Fumika Kino and Yushi Uno
Scrabble Is PSPACE-Complete / Michael Lampis, Valia Mitsou and Karolina Sołtys
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set / Kevin J. Lang
Spanning Trees and the Complexity of Flood-Filling Games / Kitty Meeks and Alexander Scott
Tron, a Combinatorial Game on Abstract Graphs / Tillmann Miltzow
Divorcing Made Easy / Kirk Pruhs and Gerhard J. Woeginger
A New Analysis of Best Fit Bin Packing / Jiří Sgall
The Coolest Order of Binary Strings / Brett Stevens and Aaron Williams
Hitori Number / Akira Suzuki, Kei Uchizawa and Takeaki Uno
Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric / Wojciech Rytter and Bartosz Szreder
Gaming Is a Hard Job, But Someone Has to Do It! / Giovanni Viglietta
Hardness of Mastermind / Giovanni Viglietta
Scienceography: The Study of How Science Is Written / Graham Cormode, S. Muthukrishnan and Jinyun Yan.
This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.