SUNDAY JUNE 3, 2007
| Conference registration | |
| 14:30 - 15:30 | |
| Invited talk | |
| 15:30 - 16:30 | Fun with Sub-linear Time Algorithms Luca Trevisan -- UC Berkeley |
| Coffee break | |
| 16:30 - 17:00 | |
| Regular papers | |
| 17:00 - 17:30 | Pictures from Mongolia - Partial Sorting in a Partial World Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna |
| 17:30 - 18:00 | Die Another Day Rudolf Fleischer |
| 18:00 - 18:30 | Efficient Algorithms for the Spoonerism Problem Hans-Joachim Bockenhauer, Juraj Hromkovic, Richard Kralovic, Tobias Momke, Kathleen Steinhofel |
| 18:30 - 19:00 | Tablatures for Stringed Instruments and Generating Functions Davide Baccherini, Donatella Merlini, Renzo Sprugnoli |
| Welcome Reception | |
| 20:00 | |
MONDAY, JUNE 4, 2007
| Invited talk | |
| 9:00 - 10:00 | On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features Giuseppe Di Battista -- U. Roma III |
| Coffee break | |
| 10:00 - 10:30 | |
| Regular papers | |
| 10:30 - 11:00 | The Worst Page-Replacement Policy Kunal Agrawal, Michael Bender, Jeremy Fineman |
| 11:00 - 11:30 | Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms Hermann Gruber, Markus Holzer, Oliver Ruepp |
| 11:30 - 12:00 | Approximating Rational Numbers by Fractions Michal Forisek |
| 12:00 - 12:30 | Drawing Borders Efficiently Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
| 12:30 - 13:00 | Knitting for Fun: a Recursive Sweater Anna Bernasconi, Chiara Bodei, Linda Pagli |
| Lunch break | |
| 13:00 - 15:00 | |
| Regular Papers | |
| 15:00 - 15:30 | The Ferry Cover Problem Michael Lampis, Valia Mitsou |
| 15:30 - 1600 | The Traveling Beams Optical Solutions for Bounded NP-Complete Problems Shlomi Dolev, Hen Fitoussi |
| 16:00 - 16:30 | High Spies (or How to Win a Programming Contest) Andre Deutz, Rudy Van Vliet, Hendrik Jan Hoogeboom |
| Coffee break | |
| 16:30 - 17:00 | |
| Regular papers | |
| 17:00 - 17:30 | HIROIMONO is NP-complete Daniel Andersson |
| 17:30 - 18:00 | The Troubles of Interior Design -- A Complexity Analysis of the Game Heyawake Markus Holzer, Oliver Ruepp |
| 18:00 - 18:30 | Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy Rothblum |
| 18:30 - 19:00 | Wooden Geometric Puzzles: Design and Hardness Proofs Helmut Alt, Hans Bodlaender, Marc van Kreveld, Gunter Rote, Gerard Tel |
| Social Dinner | |
| 20:00 | |
TUESDAY, JUNE 5
| Invited talk | |
| 9:00 - 10:00 | CLOSE ENCOUNTERS WITH A BLACK HOLE or Explorations and Gatherings in Dangerous Graphs Nicola Santoro -- Carleton Univeristy |
| Coffee break | |
| 10:00 - 10:30 | |
| Regular papers | |
| 10:30 - 11:00 | Intruder Capture in Sierpinski Graphs Flaminia Luccio |
| 11:00 - 11:30 | On the Complexity of the Traffic Grooming Problem in Optical Networks Mordechai Shalom, Walter Unger, Shmuel Zaks |
| 11:30 - 12:00 | Web Marshals Fighting Curly Link Farms Fabrizio Luccio, Linda Pagli |
| 12:00 - 12:30 | Robots and Demons (The Origins Code) Yoann Dieudonné, Franck Petit |
| End of the conference | |