Abstract is missing.
- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and TightnessKshipra Bhawalkar, Martin Gairing, Tim Roughgarden. 17-28 [doi]
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion GamesTobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik. 29-38 [doi]
- Combinatorial Auctions with Verification Are TractablePiotr Krysta, Carmine Ventre. 39-50 [doi]
- How to Allocate Goods in an Online Market?Yossi Azar, Niv Buchbinder, Kamal Jain. 51-62 [doi]
- Fréchet Distance of Surfaces: Some Simple Hard CasesKevin Buchin, Maike Buchin, André Schulz. 63-74 [doi]
- Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract)Deepak Ajwani, Nodari Sitchinava, Norbert Zeh. 75-86 [doi]
- Volume in General Metric SpacesIttai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman. 87-99 [doi]
- Shortest Cut Graph of a Surface with Prescribed Vertex SetÉric Colin de Verdière. 100-111 [doi]
- Induced Matchings in Subcubic Planar GraphsRoss J. Kang, Matthias Mnich, Tobias Müller. 112-122 [doi]
- Robust Matchings and Matroid IntersectionsRyo Fujita, Yusuke Kobayashi, Kazuhisa Makino. 123-134 [doi]
- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided TiesKazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. 135-146 [doi]
- Strongly Stable AssignmentNing Chen, Arpita Ghosh. 147-158 [doi]
- Data Structures for Storing Small Sets in the Bitprobe ModelJaikumar Radhakrishnan, Smit Shah 0001, Saswata Shannigrahi. 159-170 [doi]
- On Space Efficient Two Dimensional Range Minimum Data StructuresGerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao. 171-182 [doi]
- Pairing Heaps with Costless MeldAmr Elmasry. 183-193 [doi]
- Top-::::k:::: Ranked Document Search in General Text DatabasesJ. Shane Culpepper, Gonzalo Navarro, Simon J. Puglisi, Andrew Turpin. 194-205 [doi]
- Shortest Paths in Planar Graphs with Real Lengths in ::::O::::(::::n::::log:::2:::::::n::::/loglog::::n::::) TimeShay Mozes, Christian Wulff-Nilsen. 206-217 [doi]
- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract)Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra. 218-229 [doi]
- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task SystemsVincenzo Bonifaci, Alberto Marchetti-Spaccamela. 230-241 [doi]