Abstract is missing.
- A Survey of Results for Deletion Channels and Related Synchronization ChannelsMichael Mitzenmacher. 1-3 [doi]
- Nash Bargaining Via Flexible Budget MarketsVijay V. Vazirani. 4 [doi]
- Simplified Planar Coresets for Data StreamsJohn Hershberger, Subhash Suri. 5-16 [doi]
- Uniquely Represented Data Structures for Computational GeometryGuy E. Blelloch, Daniel Golovin, Virginia Vassilevska. 17-28 [doi]
- I/O Efficient Dynamic Data Structures for Longest Prefix QueriesMoshe Hershcovitch, Haim Kaplan. 29-40 [doi]
- Guarding Art Galleries: The Extra Cost for Sculptures Is LinearLouigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé. 41-52 [doi]
- Vision-Based Pursuit-Evasion in a GridAdrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski. 53-64 [doi]
- Angle Optimization in Target TrackingBeat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer. 65-76 [doi]
- Improved Bounds for Wireless LocalizationTobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno. 77-89 [doi]
- Bicriteria Approximation Tradeoff for the Node-Cost Budget ProblemYuval Rabani, Gabriel Scalosub. 90-101 [doi]
- Integer Maximum Flow in Wireless Sensor Networks with Energy ConstraintHans Leo Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen. 102-113 [doi]
- The Maximum Energy-Constrained Dynamic Flow ProblemSándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller. 114-126 [doi]
- Bounded Unpopularity MatchingsChien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre. 127-137 [doi]
- Data Structures with Local Update OperationsYakov Nekrich. 138-147 [doi]
- On the Redundancy of Succinct Data StructuresAlexander Golynski, Rajeev Raman, S. Srinivasa Rao. 148-159 [doi]
- Confluently Persistent Tries for Efficient Version ControlErik D. Demaine, Stefan Langerman, Eric Price. 160-172 [doi]
- A Uniform Approach Towards Succinct Representation of TreesArash Farzan, J. Ian Munro. 173-184 [doi]
- An Algorithm for L(2, 1)-Labeling of TreesToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno. 185-197 [doi]
- Batch Coloring Flat Graphs and ThinMagnús M. Halldórsson, Hadas Shachnai. 198-209 [doi]
- Approximating the Interval Constrained Coloring ProblemErnst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre. 210-221 [doi]
- A Path Cover Technique for LCAs in DagsMiroslaw Kowaluk, Andrzej Lingas, Johannes Nowak. 222-233 [doi]
- Boundary Labeling with Octilinear LeadersMichael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis. 234-245 [doi]
- Distributed Disaster DisclosureBernard Mans, Stefan Schmid, Roger Wattenhofer. 246-257 [doi]
- Reoptimization of Steiner TreesDavide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych. 258-269 [doi]
- On the Locality of Extracting a 2-Manifold in Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic. 270-281 [doi]
- On Metric Clustering to Minimize the Sum of RadiiMatt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan. 282-293 [doi]
- On Covering Problems of RadoSergey Bereg, Adrian Dumitrescu, Minghui Jiang. 294-305 [doi]
- Packing Rectangles into 2OPT Bins Using RotationsRolf Harren, Rob van Stee. 306-318 [doi]
- A Preemptive Algorithm for Maximizing Disjoint Paths on TreesYossi Azar, Uriel Feige, Daniel Glasner. 319-330 [doi]
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold GraphsPinar Heggernes, Daniel Meister, Andrzej Proskurowski. 331-342 [doi]
- On a Special Co-cycle Basis of GraphsTelikepalli Kavitha. 343-354 [doi]
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc GraphsMin Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter. 355-366 [doi]
- Spanners of Additively Weighted Point SetsProsenjit Bose, Paz Carmi, Mathieu Couture. 367-377 [doi]
- The Kinetic Facility Location ProblemBastian Degener, Joachim Gehweiler, Christiane Lammersen. 378-389 [doi]
- Computing the Greedy Spanner in Near-Quadratic TimeProsenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid. 390-401 [doi]
- Parameterized Computational Complexity of Dodgson and Young ElectionsNadja Betzler, Jiong Guo, Rolf Niedermeier. 402-413 [doi]
- Online Compression CachingC. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick Vin. 414-425 [doi]
- On Trade-Offs in External-Memory Diameter-ApproximationUlrich Meyer. 426-436 [doi]