5. FUN 2010:
Iscia,
Italy
Paolo Boldi, Luisa Gargano (Eds.):
Fun with Algorithms, 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings.
Lecture Notes in Computer Science 6099 Springer 2010, ISBN 978-3-642-13121-9 
- Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano:
Fun with Olympiad in Algorithmics.
1-2
- Prabhakar Raghavan:
The FUNnest Talks That belong to FUN (Abstract).
3
- Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou:
Fun with Games.
4-15
- Tetsuo Asano:
Do We Need a Stack to Erase a Component in a Binary Image?
16-27
- Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara:
Kaboozle Is NP-complete, Even in a Strip.
28-36
- Oren Ben-Zwi, Guy Wolfovitz:
A Hat Trick.
37-40
- Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Fun at a Department Store: Data Mining Meets Switching Theory.
41-52
- Peter Boothe:
Using Cell Phone Keyboards Is (NP\mathcal{NP}) Hard.
53-67
- Marco Bressan, Enoch Peserico:
Urban Hitchhiking.
68-76
- Nieves R. Brisaboa, Miguel Rodríguez Luaces, Gonzalo Navarro, Diego Seco:
A Fun Application of Compact Data Structures to Indexing Geographic Data.
77-88
- Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.
89-101
- Yu-Feng Chien, Wing-Kai Hon:
Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram.
102-112
- Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch:
A Better Bouncer's Algorithm.
113-120
- Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem.
121-132
- Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO Is Hard, Even for a Single Player.
133-144
- Dimitrios I. Diochnos:
Leveling-Up in Heroes of Might and Magic III.
145-155
- Amr Elmasry, Claus Jensen, Jyrki Katajainen:
The Magic of a Number System.
156-165
- Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Bit-(Parallelism)2: Getting to the Next Level of Parallelism.
166-177
- Rudolf Fleischer, Gerhard J. Woeginger:
An Algorithmic Analysis of the Honey-Bee Game.
178-189
- Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Mapping an Unfriendly Subway System.
190-201
- Riccardo Focardi, Flaminia L. Luccio:
Cracking Bank PINs by Playing Mastermind.
202-213
- Michal Forisek:
Computational Complexity of Two-Dimensional Platform Games.
214-227
- Arpita Ghosh, Mohammad Mahdian:
Christmas Gift Exchange Games.
228-236
- Magnús M. Halldórsson, Hadas Shachnai:
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary.
237-248
- Patrick Healy:
Managing Change in the Era of the iPhone.
249-259
- Markus Holzer, Pierre McKenzie:
The Computational Complexity of RaceTrack.
260-271
- Irina Kostitsyna, Valentin Polishchuk:
Simple Wriggling Is Hard Unless You Are a Fat Hippo.
272-283
- Evangelos Kranakis, Danny Krizanc:
The Urinal Problem.
284-295
- Mohammad Mahdian:
Fighting Censorship with Algorithms.
296-306
- David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games.
307-318
- Oliver Ruepp, Markus Holzer:
The Computational Complexity of the Kakuro Puzzle, Revisited.
319-330
- Tao Cao, Khalegh Mamakani, Frank Ruskey:
Symmetric Monotone Venn Diagrams with Seven Curves.
331-342
- Frank Ruskey, Aaron Williams:
The Feline Josephus Problem.
343-354
- Tami Tamir:
Scheduling with Bully Selfish Jobs.
355-367
- Aaron Williams:
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List.
368-379
Last update Fri May 25 08:14:30 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
