E-Book, Englisch, 378 Seiten, eBook
Ferro / Luccio / Widmayer Fun with Algorithms
Erscheinungsjahr 2014
ISBN: 978-3-319-07890-8
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark
7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014, Proceedings
E-Book, Englisch, 378 Seiten, eBook
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-319-07890-8
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Algorithmic Gems in the Data Miner’s Cave.- Fun with Fonts: Algorithmic Typography.- Happy Edges: Threshold-Coloring of Regular Lattices.- Classic Nintendo Games Are (Computationally) Hard.- On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.- No Easy Puzzles: A Hardness Result for Jigsaw Puzzles.- Normal, Abby Normal, Prefix Normal.- Nonconvex Cases for Carpenter’s Rulers.-How to Go Viral: Cheaply and Quickly.- Synchronized Dancing of Oblivious Chameleons.- Another Look at the Shoelace TSP: The Case of Very Old Shoes.- Playing Dominoes Is Hard, Except by Yourself.- UNO Gets Easier for a Single Player.- Secure Auctions without Cryptography.- Towards an Algorithmic Guide to Spiral Galaxies.- Competitive Analysis of the Windfall Game.- Excuse Me! or The Courteous Theatregoers’ Problem.- Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.-Approximability of Latin Square Completion-Type Puzzles.-Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.- Quell.- How Even Tiny Influence Can Have a Big Impact.-Optimizing Airspace Closure with Respect to Politicians’ Egos.- Being Negative Makes Life NP-hard (for Product Sellers).- Clearing Connections by Few Agents.- Counting Houses of Pareto Optimal Matchings in the House Allocation Problem.- Practical Card-Based Cryptography.- The Harassed Waitress Problem.- Lemmings Is PSPACE-Complete.- Finding Centers and Medians of a Tree by Distance Queries.- Swapping Labeled Tokens on Graphs.