Skip to main content
SpringerLink
Log in

Fun with Algorithms

6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Evangelos Kranakis

    1. School of Computer Science, Carleton University, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Danny Krizanc

    1. Department of Mathematics and Computer Science, Wesleyan University, Middleton, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Flaminia Luccio

    1. Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Mestre (Ve), Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

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

Included in the following conference series:

Conference proceedings info: FUN 2012.

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

  1. Front Matter

    Download chapter PDF

  2. Distributed Algorithms by Forgetful Mobile Robots

    • Paola Flocchini
    Pages 1-1

  3. Stability and Metastability of the Logit Dynamics of Strategic Games

    • Giuseppe Persiano
    Pages 2-2

  4. Art Galleries, k-modems, and k-convexity

    • Jorge Urrutia
    Pages 3-3

  5. The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs

    • Terry Anderson, Therese Biedl
    Pages 4-15

  6. Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box

    • Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell et al.
    Pages 16-27

  7. The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye

    • Michael A. Bender, Ritwik Bose, Rezaul Chowdhury, Samuel McCauley
    Pages 28-39

  8. Mad at Edge Crossings? Break the Edges!

    • Till Bruckdorfer, Michael Kaufmann
    Pages 40-50

  9. Train Marshalling Is Fixed Parameter Tractable

    • Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis et al.
    Pages 51-56

  10. Conflict-Free Graph Orientations with Parity Constraints

    • Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth
    Pages 57-68

  11. The Multi-interval Ulam-Rényi Game

    • Ferdinando Cicalese
    Pages 69-80

  12. Picture-Hanging Puzzles

    • Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Pǎtraşcu
    Pages 81-93

  13. Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors

    • Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny
    Pages 94-106

  14. The Byzantine Brides Problem

    • Swan Dubois, Sébastien Tixeuil, Nini Zhu
    Pages 107-118

  15. Lean Programs, Branch Mispredictions, and Sorting

    • Amr Elmasry, Jyrki Katajainen
    Pages 119-130

  16. On Computer Integrated Rationalized Crossword Puzzle Manufacturing

    • Jakob Engel, Markus Holzer, Oliver Ruepp, Frank Sehnke
    Pages 131-141

  17. Solving Single-Digit Sudoku Subproblems

    • David Eppstein
    Pages 142-153

  18. Finding Good Coffee in Paris

    • Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro
    Pages 154-165

  19. To Satisfy Impatient Web Surfers Is Hard

    • Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse
    Pages 166-176

  20. Making Life Easier for Firefighters

    • Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen
    Pages 177-188
Back to top

Other volumes

  1. Fun with Algorithms

Keywords

About this book

This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 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.

Editors and Affiliations

  • School of Computer Science, Carleton University, Ottawa, Canada

    Evangelos Kranakis

  • Department of Mathematics and Computer Science, Wesleyan University, Middleton, USA

    Danny Krizanc

  • Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Mestre (Ve), Italy

    Flaminia Luccio

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation