Conferences in DBLP

(fun)
2007 (conf/fun/2007)

1. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
   On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:1-13 [Conf]
   
2. Nicola Santoro
   Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:14- [Conf]
   
3. Luca Trevisan
   Fun with Sub-linear Time Algorithms. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:15- [Conf]
   
4. Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
   Wooden Geometric Puzzles: Design and Hardness Proofs. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:16-29 [Conf]
   
5. Daniel Andersson
   HIROIMONO Is NP-Complete. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:30-39 [Conf]
   
6. Davide Baccherini, Donatella Merlini, Renzo Sprugnoli
   Tablatures for Stringed Instruments and Generating Functions. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:40-52 [Conf]
   
7. Anna Bernasconi, Chiara Bodei, Linda Pagli
   Knitting for Fun: A Recursive Sweater. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:53-65 [Conf]
   
8. Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna
   Pictures from Mongolia - Partial Sorting in a Partial World. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:66-77 [Conf]
   
9. Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
   Efficient Algorithms for the Spoonerism Problem. [Citation Graph (0, 0)][DBLP]
   FUN, 2007, pp:78-92 [Conf]
   
10. André H. Deutz, Rudy van Vliet, Hendrik Jan Hoogeboom
    High Spies (or How to Win a Programming Contest). [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:93-107 [Conf]
    
11. Yoann Dieudonné, Franck Petit
    Robots and Demons (The Code of the Origins). [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:108-119 [Conf]
    
12. Shlomi Dolev, Hen Fitoussi
    The Traveling Beams Optical Solutions for Bounded NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:120-134 [Conf]
    
13. Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
    The Worst Page-Replacement Policy. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:135-145 [Conf]
    
14. Rudolf Fleischer
    Die Another Day. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:146-155 [Conf]
    
15. Michal Forisek
    Approximating Rational Numbers by Fractions. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:156-165 [Conf]
    
16. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
    Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:166-182 [Conf]
    
17. Hermann Gruber, Markus Holzer, Oliver Ruepp
    Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:183-197 [Conf]
    
18. Markus Holzer, Oliver Ruepp
    The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:198-212 [Conf]
    
19. Kazuo Iwama, Eiji Miyano, Hirotaka Ono
    Drawing Borders Efficiently. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:213-226 [Conf]
    
20. Michael Lampis, Valia Mitsou
    The Ferry Cover Problem. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:227-239 [Conf]
    
21. Fabrizio Luccio, Linda Pagli
    Web Marshals Fighting Curly Link Farms. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:240-248 [Conf]
    
22. Flaminia L. Luccio
    Intruder Capture in Sierpinski Graphs. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:249-261 [Conf]
    
23. Mordechai Shalom, Walter Unger, Shmuel Zaks
    On the Complexity of the Traffic Grooming Problem in Optical Networks. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:262-271 [Conf]