Wednesday, June 2 |
8:30 - 9:00 |
Registration |
9:00 - 09:50 |
Invited talk by Prabhakar Raghavan
- Analysis of a large scale April Fools' social media experiment
|
09:50 - 10:00 |
Break |
10:00 - 11:15 |
Session I
- The Feline Josephus Problem
Frank Ruskey, Aaron Williams
- Bit-(Parallelism)2: Getting to the Next Level of Parallelism
Simone Faro, Domenico Cantone, Emanuele Giaquinta
- A hat trick
Oren Ben-Zwi, Guy Wolfovitz
|
11:15 - 11:35 |
Coffee break |
11:35 - 12:50 |
Session II
- A Better Bouncer’s Algorithm
Ferdinando Cicalese, Travis Gagie, Anthony Macula, Martin Milanic, Eberhard Triesch
- Do We Need a Stack to Erase a Component in a Binary Image?
Tetsuo Asano
- Mapping an Unfriendly Subway System
Paola Flocchini, Matthew Kellett, Peter Mason, Nicola Santoro
|
12:50 - 14:50 |
Lunch break |
14:50 - 16:05 |
Session III
- Fun at a Department Store: Data Mining Meets Switching Theory
Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
- The Computational Complexity of RACETRACK
Markus Holzer, Pierre McKenzie
- Using Cell Phone Keyboards is (NP) Hard
Peter Boothe
|
16:05 - 16:25 |
Coffee break |
16:25 - 18:30 |
Session IV
- The Urinal Problem
Evangelos Kranakis, Danny Krizanc
- Return of the Boss Problem: The Untold Story
Magnus Halldorsson, Hadas Shachnai
- UNO is hard, even for a single player
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
- The Complexity of Flood Filling Games
Ashley Montanaro, David Arthur, Raphael Clifford, Markus Jalsenius, Benjamin Sach
- Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram
Yu-Feng Chien, Wing Kai Hon
|
19:15 - 20:00 |
Side Presentation:
Algovision by Ludek Kucera |
20:00 |
Cocktail and Dinner |
Thursday, June 3 |
9:00 - 09:50 |
Invited talk by Paul Spirakis
|
09:50 - 10:00 |
Break |
10:00 - 11:15 |
Session V
- Leveling-Up in Heroes of Might and Magic III
Dimitrios I. Diochnos
- Scheduling with Bully Selfish Jobs
Tami Tamir
- Fighting Censorship with Algorithms
Mohammad Mahdian
|
11:15 - 11:35 |
Coffee break |
11:35 - 12:50 |
Session VI
- The Computational Complexity of the Puzzle Revisited
Oliver Ruepp, Markus Holzer
- Tradeoffs in process strategy games with application in the WDM reconguration problem
Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse
- Managing Change in the Era of the iPhone
Patrick Healy
|
12:50 - 15:00 |
Lunch break |
15:00 - 16:15 |
Session VII
- Urban Hitchhiking
Marco Bressan, Enoch Peserico
- Computational complexity of two-dimensional platform games
Michal Forisek
- Unsorting by Prefix-Reversals using Boustrophedon Linked Lists
Aaron Williams
|
16:15 - 16:35 |
Coffee break |
16:35 - 17:25 |
Session VIII
- Kaboozle is NP-complete, even in a Strip Form
Tetsuo Asano, Erik Demaine, Martin Demaine, Ryuhei Uehara
- A Fun Application of Compact Data Structures to Indexing Geographic
Nieves R. Brisaboa, Miguel R. Luaces, Gonzalo Navarro, Diego Seco
|
17:30 |
Social Event and Dinner |
Friday, June 4 |
9:00 - 09:50 |
Invited talk by Roberto Grossi
- Fun with Olympiad in Algorithmics
|
09:50 - 10:00 |
Break |
10:00 - 11:15 |
Session IX
- An algorithmic analysis of the Honey-Bee game
Rudolf Fleischer, Gerhard J. Woeginger
- Symmetric Monotone Venn Diagrams with Seven Curves
Frank Ruskey, Khalegh Mamakani
- Simple Slithering is Hard unless You Are a Fat Hippo
Irina Kostitsyna, Valentin Polishchuk
|
11:15 - 11:35 |
Coffee break |
11:35 - 13:15 |
Session X
- Christmas Gift Exchange Games
Arpita Ghosh, Mohammad Mahdian
- Cracking bank PINs by playing Mastermind
Riccardo Focardi, Flaminia Luccio
- On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Liptak
- The Magic of a Number System
Amr Elmasry, Claus Jensen, Jyrki Katajainen
|
13:15 |
Closing Lunch |