Fun with Algorithms 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007. Proceedings / [electronic resource] :
edited by Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci.
- X, 273 p. Also available online. online resource.
- Lecture Notes in Computer Science, 4475 0302-9743 ; .
- Lecture Notes in Computer Science, 4475 .
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features -- Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs -- Fun with Sub-linear Time Algorithms -- Wooden Geometric Puzzles: Design and Hardness Proofs -- HIROIMONO Is NP-Complete -- Tablatures for Stringed Instruments and Generating Functions -- Knitting for Fun: A Recursive Sweater -- Pictures from Mongolia Partial Sorting in a Partial World -- Efficient Algorithms for the SpoonerismProblem -- High Spies (or How to Win a Programming Contest) -- Robots and Demons (The Code of the Origins) -- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems -- The Worst Page-Replacement Policy -- Die Another Day -- Approximating Rational Numbers by Fractions -- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles -- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms -- The Troubles of Interior DesignA Complexity Analysis of the Game Heyawake -- Drawing Borders Efficiently -- The Ferry Cover Problem -- Web Marshals Fighting Curly Link Farms -- Intruder Capture in Sierpi?ski Graphs -- On the Complexity of the Traffic Grooming Problem in Optical Networks.
ZDB-2-SCS ZDB-2-LNC
9783540729143
10.1007/978-3-540-72914-3 doi
Computer science. Data structures (Computer science). Computer software. Computational complexity. Computer graphics. Computer Science. Algorithm Analysis and Problem Complexity. Data Structures. Computation by Abstract Devices. Discrete Mathematics in Computer Science. Computer Graphics.