18. ESA 2010: Liverpool, UK

Mark de Berg, Ulrich Meyer (Eds.): Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. Lecture Notes in Computer Science 6347 Springer 2010, ISBN 978-3-642-15780-6

Invited Talk

Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden:
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. 17-28
Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik:
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. 29-38
Piotr Krysta, Carmine Ventre:
Combinatorial Auctions with Verification Are Tractable. 39-50
Yossi Azar, Niv Buchbinder, Kamal Jain:
How to Allocate Goods in an Online Market? 51-62

Kevin Buchin, Maike Buchin, André Schulz:
Fréchet Distance of Surfaces: Some Simple Hard Cases. 63-74
Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). 75-86
Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. 87-99
Éric Colin de Verdière:
Shortest Cut Graph of a Surface with Prescribed Vertex Set. 100-111

Ross J. Kang, Matthias Mnich, Tobias Müller:
Induced Matchings in Subcubic Planar Graphs. 112-122
Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino:
Robust Matchings and Matroid Intersections. 123-134
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. 135-146
Ning Chen, Arpita Ghosh:
Strongly Stable Assignment. 147-158

Jaikumar Radhakrishnan, Smit Shah, Saswata Shannigrahi:
Data Structures for Storing Small Sets in the Bitprobe Model. 159-170
Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. 171-182
Amr Elmasry:
Pairing Heaps with Costless Meld. 183-193
J. Shane Culpepper, Gonzalo Navarro, Simon J. Puglisi, Andrew Turpin:
Top-k Ranked Document Search in General Text Databases. 194-205

Shay Mozes, Christian Wulff-Nilsen:
Shortest Paths in Planar Graphs with Real Lengths in O(nlog²n/loglogn) Time. 206-217
Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). 218-229
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela:
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. 230-241

Last update Thu May 23 16:45:33 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page