Skip to main content
SpringerLink
Log in
Book cover

Fun with Algorithms

7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Alfredo Ferro

    1. Dipartimento di Matematica e Informatica, Città Universitaria, Università degli Studi di Catania, Catania, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Fabrizio Luccio

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Peter Widmayer

    1. Institute of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    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 8496)

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

Included in the following conference series:

Conference proceedings info: FUN 2014.

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 (31 papers)

  1. Front Matter

    Download chapter PDF

  2. Algorithmic Gems in the Data Miner’s Cave

    • Paolo Boldi
    Pages 1-15

  3. Fun with Fonts: Algorithmic Typography

    • Erik D. Demaine, Martin L. Demaine
    Pages 16-27

  4. Happy Edges: Threshold-Coloring of Regular Lattices

    • Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter
    Pages 28-39

  5. Classic Nintendo Games Are (Computationally) Hard

    • Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
    Pages 40-51

  6. On the Solvability of the Six Degrees of Kevin Bacon Game

    • Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter Kosters, Andrea Marino, Frank Takes
    Pages 52-63

  7. No Easy Puzzles: A Hardness Result for Jigsaw Puzzles

    • Michael Brand
    Pages 64-73

  8. Normal, Abby Normal, Prefix Normal

    • Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
    Pages 74-88

  9. Nonconvex Cases for Carpenter’s Rulers

    • Ke Chen, Adrian Dumitrescu
    Pages 89-99

  10. How to go Viral: Cheaply and Quickly

    • Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, M. Milanič, Joseph G. Peters, Ugo Vaccaro
    Pages 100-112

  11. Synchronized Dancing of Oblivious Chameleons

    • Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Pages 113-124

  12. Another Look at the Shoelace TSP: The Case of Very Old Shoes

    • Vladimir G. Deineko, Gerhard J. Woeginger
    Pages 125-136

  13. Playing Dominoes Is Hard, Except by Yourself

    • Erik D. Demaine, Fermi Ma, Erik Waingarten
    Pages 137-146

  14. UNO Gets Easier for a Single Player

    • Palash Dey, Prachi Goyal, Neeldhara Misra
    Pages 147-157

  15. Secure Auctions without Cryptography

    • Jannik Dreier, Hugo Jonker, Pascal Lafourcade
    Pages 158-170

  16. Towards an Algorithmic Guide to Spiral Galaxies

    • Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz
    Pages 171-182

  17. Competitive Analysis of the Windfall Game

    • Rudolf Fleischer, Tao Zhang
    Pages 183-193

  18. Excuse Me! or The Courteous Theatregoers’ Problem

    • Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc
    Pages 194-205

  19. Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives

    • Vincenzo Gervasi, Giuseppe Prencipe, Valerio Volpi
    Pages 206-217

  20. Approximability of Latin Square Completion-Type Puzzles

    • Kazuya Haraguchi, Hirotaka Ono
    Pages 218-229
Back to top

Other volumes

  1. Fun with Algorithms

Keywords

About this book

This book constitutes the refereed proceedings of the 7th International Conference, FUN 2014, held in July 2014 in Lipari Island, Sicily, Italy.

The 29 revised full papers were carefully reviewed and selected from 49 submissions. They feature a large variety of topics in the field of the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. In particular, algorithmic questions rooted in biology, cryptography, game theory, graphs, the internet, robotics and mobility, combinatorics, geometry, stringology, as well as space-conscious, randomized, parallel, distributed algorithms and their visualization are addressed.

Editors and Affiliations

  • Dipartimento di Matematica e Informatica, Città Universitaria, Università degli Studi di Catania, Catania, Italy

    Alfredo Ferro

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

    Fabrizio Luccio

  • Institute of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    Peter Widmayer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation