Your search returned the following 5 documents:

5. Self-organizing data structures
   Susanne Albers and Jeffery Westbrook
   In: Online Algorithms: The State of the Art, 1998, 13-51
   
4. Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
   Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, and Romeo Rizzi
   In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, Copenhagen, Denmark, 2009, 301-312
   
3. Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
   Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, and Romeo Rizzi
   In: Algorithms - ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, 2009, 301-312
   
2. Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
   Khaled Elbassioni, Kazuhisa Makino, and Imran Rauf
   In: Algorithms - ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, 2009, 143-154
   [PDF: Download: esa09.pdf]
   
1. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
   Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar
   In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, Copenhagen, Denmark, 2009, 694-705
   [PDF: Download: ds_kernel_LNCS.pdf]