Near-Linear Approximation Algorithms for Geometric Hitting Sets Pankaj K. AgarwalEsther EzraMicha Sharir OriginalPaper 06 May 2011 Pages: 1 - 25
Graph Decomposition for Memoryless Periodic Exploration Adrian KosowskiAlfredo Navarra OriginalPaper 03 May 2011 Pages: 26 - 38
Contribution Games in Networks Elliot AnshelevichMartin Hoefer OriginalPaper 06 May 2011 Pages: 51 - 90
On the Hitting Times of Quantum Versus Random Walks Frédéric MagniezAshwin NayakMiklos Santha OriginalPaper 10 May 2011 Pages: 91 - 116
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming Scott M. Summers OriginalPaper 06 May 2011 Pages: 117 - 136
Maximum Series-Parallel Subgraph Gruia CălinescuCristina G. FernandesAlexander Zelikovsky OriginalPaper 11 May 2011 Pages: 137 - 157
A Distributed Algorithm for Computing the Node Search Number in Trees David CoudertFlorian HucDorian Mazauric OriginalPaper 07 May 2011 Pages: 158 - 190
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties Donglei DuRuixing LuDachuan Xu OriginalPaper 10 May 2011 Pages: 191 - 200
Succinct and I/O Efficient Data Structures for Traversal in Trees Craig DillabaughMeng HeAnil Maheshwari OriginalPaper 17 May 2011 Pages: 201 - 223
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs Telikepalli Kavitha OriginalPaper 01 June 2011 Pages: 224 - 245
On Equilibria for ADM Minimization Games Leah EpsteinAsaf Levin OriginalPaper 08 June 2011 Pages: 246 - 273
Minimize the Maximum Duty in Multi-interface Networks Gianlorenzo D’AngeloGabriele Di StefanoAlfredo Navarra OriginalPaper 07 June 2011 Pages: 274 - 295
A Competitive Analysis for Balanced Transactional Memory Workloads Gokarna SharmaCostas Busch OriginalPaper 04 June 2011 Pages: 296 - 322
An Exact Exponential Time Algorithm for Power Dominating Set Daniel Binkele-RaibleHenning Fernau OriginalPaper 08 June 2011 Pages: 323 - 346
Improved Approximation Algorithms for Data Migration Samir KhullerYoo-Ah KimAzarakhsh Malekian OriginalPaper 06 July 2011 Pages: 347 - 362
Interval Partitions and Polynomial Factorization Joachim von zur GathenDaniel PanarioBruce Richmond OriginalPaper 14 June 2011 Pages: 363 - 397
Approximating Node-Connectivity Augmentation Problems Zeev Nutov OriginalPaper 14 June 2011 Pages: 398 - 410
Improved Competitive Performance Bounds for CIOQ Switches Alex KesselmanKirill KoganMichael Segal OriginalPaper 21 June 2011 Pages: 411 - 424
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs A. AazamiJ. CheriyanK. R. Jampani OriginalPaper 15 June 2011 Pages: 425 - 456
External Memory Planar Point Location with Logarithmic Updates Lars ArgeGerth Stølting BrodalS. Srinivasa Rao OriginalPaper 15 June 2011 Pages: 457 - 475
Layered Working-Set Trees Prosenjit BoseKarim DouïebJohn Howat OriginalPaper 21 June 2011 Pages: 476 - 489
Bipartite Matching in the Semi-streaming Model Sebastian EggertLasse KliemannAnand Srivastav OriginalPaper 24 August 2011 Pages: 490 - 508
Average Case Analysis of Moore’s State Minimization Algorithm Frédérique BassinoJulien DavidCyril Nicaud OriginalPaper 12 October 2011 Pages: 509 - 531
Polynomial Kernelizations for MIN F+Π1 and MAX NP Stefan Kratsch OriginalPaper Open access 31 August 2011 Pages: 532 - 550
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm N. CatusseV. ChepoiY. Vaxès OriginalPaper 31 August 2011 Pages: 551 - 567