Skip to main content
SpringerLink
Log in

Fun with Algorithms

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

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Pierluigi Crescenzi

    1. Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Firenze, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giuseppe Prencipe

    1. Dipartimento di Informatica, Università degli Studi di Pisa, Pisa, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Geppino Pucci

    1. Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Padova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4475)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: FUN 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Download chapter PDF

  2. On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features

    • Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
    Pages 1-13

  3. Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs

    • Nicola Santoro
    Pages 14-14

  4. Fun with Sub-linear Time Algorithms

    • Luca Trevisan
    Pages 15-15

  5. Wooden Geometric Puzzles: Design and Hardness Proofs

    • Helmut Alt, Hans Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
    Pages 16-29

  6. HIROIMONO Is NP-Complete

    • Daniel Andersson
    Pages 30-39

  7. Tablatures for Stringed Instruments and Generating Functions

    • Davide Baccherini, Donatella Merlini, Renzo Sprugnoli
    Pages 40-52

  8. Knitting for Fun: A Recursive Sweater

    • Anna Bernasconi, Chiara Bodei, Linda Pagli
    Pages 53-65

  9. Pictures from Mongolia – Partial Sorting in a Partial World

    • Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna
    Pages 66-77

  10. Efficient Algorithms for the Spoonerism Problem

    • Hans-Joachim Böckenhauer, Juraj Hromkovič, Richard Královič, Tobias Mömke, Kathleen Steinhöfel
    Pages 78-92

  11. High Spies (or How to Win a Programming Contest)

    • André Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom
    Pages 93-107

  12. Robots and Demons (The Code of the Origins)

    • Yoann Dieudonné, Franck Petit
    Pages 108-119

  13. The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

    • Shlomi Dolev, Hen Fitoussi
    Pages 120-134

  14. The Worst Page-Replacement Policy

    • Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
    Pages 135-145

  15. Die Another Day

    • Rudolf Fleischer
    Pages 146-155

  16. Approximating Rational Numbers by Fractions

    • Michal Forišek
    Pages 156-165

  17. Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles

    • Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
    Pages 166-182

  18. Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms

    • Hermann Gruber, Markus Holzer, Oliver Ruepp
    Pages 183-197

  19. The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake

    • Markus Holzer, Oliver Ruepp
    Pages 198-212

  20. Drawing Borders Efficiently

    • Kazuo Iwama, Eiji Miyano, Hirotaka Ono
    Pages 213-226
Back to top

Other volumes

  1. Fun with Algorithms

Keywords

Editors and Affiliations

  • Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Firenze, Italy

    Pierluigi Crescenzi

  • Dipartimento di Informatica, Università degli Studi di Pisa, Pisa, Italy

    Giuseppe Prencipe

  • Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Padova, Italy

    Geppino Pucci

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation