Skip to main content
  • Conference proceedings
  • © 2010

Fun with Algorithms

5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010, Proceedings

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

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

Conference series link(s): FUN: International Conference on Fun with Algorithms

Conference proceedings info: FUN 2010.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (35 papers)

  1. Front Matter

  2. Fun with Olympiad in Algorithmics

    • Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano
    Pages 1-2
  3. Fun with Games

    • Paul G. Spirakis, Ioannis Chatzigiannakis, Georgios Mylonas, Panagiota N. Panagopoulou
    Pages 4-15
  4. Kaboozle Is NP-complete, Even in a Strip

    • Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
    Pages 28-36
  5. A Hat Trick

    • Oren Ben-Zwi, Guy Wolfovitz
    Pages 37-40
  6. Fun at a Department Store: Data Mining Meets Switching Theory

    • Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli
    Pages 41-52
  7. Urban Hitchhiking

    • Marco Bressan, Enoch Peserico
    Pages 68-76
  8. A Fun Application of Compact Data Structures to Indexing Geographic Data

    • Nieves R. Brisaboa, Miguel R. Luaces, Gonzalo Navarro, Diego Seco
    Pages 77-88
  9. On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching

    • Péter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták
    Pages 89-101
  10. A Better Bouncer’s Algorithm

    • Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanič, Eberhard Triesch
    Pages 113-120
  11. Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem

    • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse
    Pages 121-132
  12. UNO Is Hard, Even for a Single Player

    • Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
    Pages 133-144
  13. Leveling-Up in Heroes of Might and Magic III

    • Dimitrios I. Diochnos
    Pages 145-155
  14. The Magic of a Number System

    • Amr Elmasry, Claus Jensen, Jyrki Katajainen
    Pages 156-165
  15. Bit-(Parallelism)2: Getting to the Next Level of Parallelism

    • Domenico Cantone, Simone Faro, Emanuele Giaquinta
    Pages 166-177
  16. An Algorithmic Analysis of the Honey-Bee Game

    • Rudolf Fleischer, Gerhard J. Woeginger
    Pages 178-189

Other Volumes

  1. Fun with Algorithms

Keywords

  • IMO
  • IOI
  • Pattern Matching
  • algorithms
  • cell phones
  • complexity
  • cryptography
  • distributed algorithms
  • geographic data
  • graph algorithms
  • graph computations
  • honey-bee game
  • knowledge
  • parallelism
  • zero-knowledge proof
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Milano, Italy

    Paolo Boldi

  • Dip. di Informatica ed Applicazioni, Universitá di Salerno, Fisciano, Italy

    Luisa Gargano

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions