Your search returned the following 11 documents:

11. Approximate Counting of Cycles in Streams
    Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, and He Sun
    In: 19th Annual European Symposium on Algorithms (ESA-11), Saarbrücken, Germany, 2011, 677-688
    
10. Improved Approximation Algorithms for Bipartite Correlation Clustering
    Nir Ailon, Noa Avigdor-Elgrabli, Noa Liberty, and Anke van Zuylen
    In: Algorithms - ESA 2011 : 19th Annual European Symposium, Saarbrücken, Germany, 2011, 25-36
    
9. Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
   George Christodoulou, Kurt Mehlhorn, and Evangelia Pyrga
   In: Algorithms - ESA 2011 : 19th Annual European Symposium, Saarbrücken, Germany, 2011, 119-130
   
8. Mixed-criticality scheduling of sporadic task systems
   Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, and Leen Stougie
   In: Algorithms - ESA 2011 : 19th Annual European Symposium, Saarbrücken, Germany, 2011, 555-566
   [PDF: Download: mixedcritical-esa.pdf]
   
7. Breadth first search on massive graphs
   Deepak Ajwani, Ulrich Meyer, and Vitaly Osipov
   In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 291-307
   
6. Ultrafast shortest-path queries via transit nodes
   Holger Bast, Stefan Funke, and Domagoj Matijevic
   In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 175-192
   
5. A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
   Markus Behle, Michael Jünger, and Frauke Liers
   In: Experimental Algorithms : 6th International Workshop, WEA 2007, Rome, Italy, 2007, 379-392
   
   
4. Algorithms for longer OLED Lifetime
   Friedrich Eisenbrand, Andreas Karrenbauer, and Chihao Xu
   In: WEA 2007, Rome, Italy, 2007, 338-351
   
3. TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
   Holger Bast, Stefan Funke, and Domagoj Matijevic
   In: 9th DIMACS Implementation Challenge --- Shortest Path, Piscataway, New Jersey, 2006
   
2. Better External Memory Suffix Array Construction
   Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, and Peter Sanders
   In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), Vancouver, British Columbia, Canada, 2005, 86-97
   [PDF: Download: DKMS05.pdf]
   
1. Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
   Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, and Jack Snoeyink
   In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005), Vancouver, BC, Canada, 2005, 98-110