Your search returned the following 8 documents:

8. Enumerating Spanning and Connected Subsets in Graphs and Matroids
   Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
   In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 444-455
   
7. How Branch Mispredictions Affect Quicksort
   Kanela Kaligosi and Peter Sanders
   In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 780-791
   
6. Multiline Addressing by Network Flow
   Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, and Chihao Xu
   In: Algorithms - ESA 2006 : 14th Annual European Symposium, Zürich, Switzerland, 2006, 744-755
   
5. On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
   Khaled M. Elbassioni
   In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 340-351
   
4. On the minimum corridor connection and other generalized geometric problems
   Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, Rene Sitters, and Thomas Wolle
   In: 4th Workshop on Approximation and Online Algorithms, WAOA, Zurich, Switzerland, 2006, 69-82
   
3. I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
   Ulrich Meyer and Norbert Zeh
   In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, 2006, 540-551
   
2. On the Minimum Load Coloring Problem
   Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, and Anand Srivastav
   In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 15-26
   [PDF: Download: mlcp_waoa05.pdf]
   
1. Rounding of Sequences and Matrices, with Applications
   Benjamin Doerr, Tobias Friedrich, Christian Klein, and Ralf Osbild
   In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), Palma de Mallorca, Spain, 2005, 96-109
   [PDF: Download: public.pdf] [PDF: Download: final.pdf]