default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th FUN 2007: Castiglioncello, Italy
- Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci:
Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings. Lecture Notes in Computer Science 4475, Springer 2007, ISBN 978-3-540-72913-6 - Giuseppe Di Battista, Fabrizio Frati
, Maurizio Patrignani:
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. 1-13 - Nicola Santoro:
Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs. 14 - Luca Trevisan:
Fun with Sub-linear Time Algorithms. 15 - Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. 16-29 - Daniel Andersson:
HIROIMONO Is NP-Complete. 30-39 - Davide Baccherini, Donatella Merlini, Renzo Sprugnoli:
Tablatures for Stringed Instruments and Generating Functions. 40-52 - Anna Bernasconi, Chiara Bodei, Linda Pagli:
Knitting for Fun: A Recursive Sweater. 53-65 - Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna:
Pictures from Mongolia - Partial Sorting in a Partial World. 66-77 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel:
Efficient Algorithms for the Spoonerism Problem. 78-92 - André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom:
High Spies (or How to Win a Programming Contest). 93-107 - Yoann Dieudonné, Franck Petit:
Robots and Demons (The Code of the Origins). 108-119 - Shlomi Dolev, Hen Fitoussi:
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems. 120-134 - Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. 135-145 - Rudolf Fleischer:
Die Another Day. 146-155 - Michal Forisek:
Approximating Rational Numbers by Fractions. 156-165 - Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum:
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. 166-182 - Hermann Gruber, Markus Holzer, Oliver Ruepp:
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. 183-197 - Markus Holzer, Oliver Ruepp:
The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. 198-212 - Kazuo Iwama, Eiji Miyano, Hirotaka Ono:
Drawing Borders Efficiently. 213-226 - Michael Lampis, Valia Mitsou:
The Ferry Cover Problem. 227-239 - Fabrizio Luccio, Linda Pagli:
Web Marshals Fighting Curly Link Farms. 240-248 - Flaminia L. Luccio:
Intruder Capture in Sierpinski Graphs. 249-261 - Mordechai Shalom, Walter Unger, Shmuel Zaks:
On the Complexity of the Traffic Grooming Problem in Optical Networks. 262-271
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-29 02:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
