Fun with Algorithms 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings

On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.- Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs.- Fun with Sub-linear Time Algorithms.- Wooden Geometric Puzzles: Design and Hardness Proofs.- HIROIMONO Is NP-Complete.- Tablatures for Stringed Instruments and Generating Functions.- Knitting for Fun: A Recursive Sweater.- Pictures from Mongolia – Partial Sorting in a Partial World.- Efficient Algorithms for the Spoonerism Problem.- High Spies (or How to Win a Programming Contest).- Robots and Demons (The Code of the Origins).- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems.- The Worst Page-Replacement Policy.- Die Another Day.- Approximating Rational Numbers by Fractions.- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms.- The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake.- Drawing Borders Efficiently.- The Ferry Cover Problem.- Web Marshals Fighting Curly Link Farms.- Intruder Capture in Sierpi?ski Graphs.- On the Complexity of the Traffic Grooming Problem in Optical Networks.