4. FUN 2007: Castiglioncello, Italy

• Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
  On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. 1-13
  Electronic Edition (link) BibTeX
• Nicola Santoro:
  Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs. 14
  Electronic Edition (link) BibTeX
• Luca Trevisan:
  Fun with Sub-linear Time Algorithms. 15
  Electronic Edition (link) BibTeX
• Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
  Wooden Geometric Puzzles: Design and Hardness Proofs. 16-29
  Electronic Edition (link) BibTeX
• Daniel Andersson:
  HIROIMONO Is NP-Complete. 30-39
  Electronic Edition (link) BibTeX
• Davide Baccherini, Donatella Merlini, Renzo Sprugnoli:
  Tablatures for Stringed Instruments and Generating Functions. 40-52
  Electronic Edition (link) BibTeX
• Anna Bernasconi, Chiara Bodei, Linda Pagli:
  Knitting for Fun: A Recursive Sweater. 53-65
  Electronic Edition (link) BibTeX
• Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna:
  Pictures from Mongolia - Partial Sorting in a Partial World. 66-77
  Electronic Edition (link) BibTeX
• Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel:
  Efficient Algorithms for the Spoonerism Problem. 78-92
  Electronic Edition (link) BibTeX
• André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom:
  High Spies (or How to Win a Programming Contest). 93-107
  Electronic Edition (link) BibTeX
• Yoann Dieudonné, Franck Petit:
  Robots and Demons (The Code of the Origins). 108-119
  Electronic Edition (link) BibTeX
• Shlomi Dolev, Hen Fitoussi:
  The Traveling Beams Optical Solutions for Bounded NP-Complete Problems. 120-134
  Electronic Edition (link) BibTeX
• Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
  The Worst Page-Replacement Policy. 135-145
  Electronic Edition (link) BibTeX
• Rudolf Fleischer:
  Die Another Day. 146-155
  Electronic Edition (link) BibTeX
• Michal Forisek:
  Approximating Rational Numbers by Fractions. 156-165
  Electronic Edition (link) BibTeX
• Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum:
  Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. 166-182
  Electronic Edition (link) BibTeX
• Hermann Gruber, Markus Holzer, Oliver Ruepp:
  Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. 183-197
  Electronic Edition (link) BibTeX
• Markus Holzer, Oliver Ruepp:
  The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. 198-212
  Electronic Edition (link) BibTeX
• Kazuo Iwama, Eiji Miyano, Hirotaka Ono:
  Drawing Borders Efficiently. 213-226
  Electronic Edition (link) BibTeX
• Michael Lampis, Valia Mitsou:
  The Ferry Cover Problem. 227-239
  Electronic Edition (link) BibTeX
• Fabrizio Luccio, Linda Pagli:
  Web Marshals Fighting Curly Link Farms. 240-248
  Electronic Edition (link) BibTeX
• Flaminia L. Luccio:
  Intruder Capture in Sierpinski Graphs. 249-261
  Electronic Edition (link) BibTeX
• Mordechai Shalom, Walter Unger, Shmuel Zaks:
  On the Complexity of the Traffic Grooming Problem in Optical Networks. 262-271
  Electronic Edition (link) BibTeX