Table of Contents

• Dictionaries using variable-length keys and data, with applicationsDaniel K. Blandford, Guy E. Blelloch. 1-10 [doi]
• Lower bounds on the size of selection and rank indexesPeter Bro Miltersen. 11-12 [doi]
• Dynamic dictionary matching and compressed suffix treesHo-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane. 13-22 [doi]
• A categorization theorem on suffix arrays with applications to space efficient text indexesMeng He, J. Ian Munro, S. Srinivasa Rao. 23-32 [doi]
• Towards a complete characterization of triesGaHyun Park, Wojciech Szpankowski. 33-42 [doi]
• Inoculation strategies for victims of viruses and the sum-of-squares partition problemJames Aspnes, Kevin L. Chang, Aleksandr Yampolskiy. 43-52 [doi]
• Marriage, honesty, and stabilityNicole Immorlica, Mohammad Mahdian. 53-62 [doi]
• Market equilibria for homothetic, quasi-concave utilities and economies of scale in productionKamal Jain, Vijay V. Vazirani, Yinyu Ye. 63-71 [doi]
• On the polynomial time computation of equilibria for certain exchange economiesBruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan. 72-81 [doi]
• Computing equilibria in multi-player gamesChristos H. Papadimitriou, Tim Roughgarden. 82-91 [doi]
• On distance scales, embeddings, and efficient relaxations of the cut coneJames R. Lee. 92-101 [doi]
• Embeddings of negative-type metrics and an improved approximation to generalized sparsest cutShuchi Chawla, Anupam Gupta, Harald Räcke. 102-111 [doi]
• The complexity of low-distortion embeddings between point setsChristos H. Papadimitriou, Shmuel Safra. 112-118 [doi]
• Approximation algorithms for low-distortion embeddings into low-dimensional spacesMihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos. 119-128 [doi]
• A tight threshold for metric Ramsey phenomenaMoses Charikar, Adriana Karagiozova. 129-136 [doi]
• The interface between computational and combinatorial geometryMicha Sharir. 137-145 [doi]
• Multiple-source shortest paths in planar graphsPhilip N. Klein. 146-155 [doi]
• Computing the shortest path: ::::A:::: search meets graph theoryAndrew V. Goldberg, Chris Harrelson. 156-165 [doi]
• Finding large cycles in Hamiltonian graphsTomás Feder, Rajeev Motwani. 166-175 [doi]
• Approximating connectivity augmentation problemsZeev Nutov. 176-185 [doi]
• Primal-dual approach for directed vertex connectivity augmentation and generalizationsLászló A. Végh, András A. Benczúr. 186-194 [doi]
• Multidimensional balanced allocationsAndrei Z. Broder, Michael Mitzenmacher. 195-196 [doi]
• Online client-server load balancing without global informationBaruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton. 197-206 [doi]
• Job shop scheduling with unit processing timesNikhil Bansal, Tracy Kimbrel, Maxim Sviridenko. 207-214 [doi]
• Approximating the average response time in broadcast schedulingNikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor. 215-221 [doi]
• Improved schedule for radio broadcastMichael Elkin, Guy Kortsarz. 222-231 [doi]
• On levels in arrangements of surfaces in three dimensionsTimothy M. Chan. 232-240 [doi]
• Distributions of points in the unit-square and large ::::k::::-gonsHanno Lefmann. 241-250 [doi]
• On geometric permutations induced by lines transversal through a fixed pointBoris Aronov, Shakhar Smorodinsky. 251-256 [doi]
• Approximation hardness of optimization problems in intersection graphs of ::::d::::-dimensional boxesMiroslav Chlebík, Janka Chlebíková. 267-276 [doi]
• Isomorphism and embedding problems for infinite limits of scale-free graphsRobert D. Kleinberg, Jon M. Kleinberg. 277-286 [doi]
• Adversarial deletion in a scale free random graph processAbraham Flaxman, Alan M. Frieze, Juan Vera. 287-292 [doi]
• The influence of search engines on preferential attachmentSoumen Chakrabarti, Alan M. Frieze, Juan Vera. 293-300 [doi]
• On the spread of viruses on the internetNoam Berger, Christian Borgs, Jennifer T. Chayes, Amin Saberi. 301-310 [doi]
• Analyzing and characterizing small-world graphsVan Nguyen, Charles U. Martel. 311-320 [doi]
• Substring compression problemsGraham Cormode, S. Muthukrishnan. 321-330 [doi]
• Optimizing markov models with applications to triangular connectivity codingStefan Gumhold. 331-338 [doi]
• Dotted interval graphs and high throughput genotypingYonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini. 339-348 [doi]
• Algorithms for combining rooted triplets into a galled phylogenetic networkJesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung. 349-358 [doi]
• Unknotting is in AM cup co-AMMasao Hara, Seiichi Tani, Makoto Yamamoto. 359-364 [doi]
• A constant approximation algorithm for the one-warehouse multi-retailer problemRetsef Levi, Robin Roundy, David B. Shmoys. 365-374 [doi]
• Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buyLuca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál. 375-384 [doi]
• Online convex optimization in the bandit setting: gradient descent without a gradientAbraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan. 385-394 [doi]
• Adaptivity and approximation for stochastic packing problemsBrian C. Dean, Michel X. Goemans, Jan Vondrák. 395-404 [doi]
• Theory of semidefinite programming for sensor network localizationAnthony Man-Cho So, Yinyu Ye. 405-414 [doi]
• An O(VE) algorithm for ear decompositions of matching-covered graphsMarcelo H. de Carvalho, Joseph Cheriyan. 415-423 [doi]
• Popular matchingsDavid J. Abraham, Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn. 424-432 [doi]
• Dominator tree verification and vertex-disjoint pathsLoukas Georgiadis, Robert Endre Tarjan. 433-442 [doi]
• Online topological orderingIrit Katriel, Hans Leo Bodlaender. 443-450 [doi]
• All maximal independent sets and dynamic dominance for sparse graphsDavid Eppstein. 451-459 [doi]
• LP decoding achieves capacityJon Feldman, Clifford Stein. 460-469 [doi]
• Maximum-likelihood decoding of Reed-Solomon codes is NP-hardVenkatesan Guruswami, Alexander Vardy. 470-478 [doi]
• Collecting correlated information from a sensor networkMicah Adler. 479-488 [doi]
• Deterministic network coding by matrix completionNicholas J. A. Harvey, David R. Karger, Kazuo Murota. 489-498 [doi]
• Network coding: does the model need tuning?April Rasala Lehman, Eric Lehman. 499-504 [doi]
• Pianos are not flat: rigid motion planning in three dimensionsVladlen Koltun. 505-514 [doi]
• A constant-factor approximation algorithm for optimal terrain guardingBoaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell. 515-524 [doi]
• Ray shooting amid balls, farthest point from a line, and range emptiness searchingMicha Sharir, Hayim Shaul. 525-534 [doi]
• Space-time tradeoffs for approximate spherical range countingSunil Arya, Theocharis Malamatos, David M. Mount. 535-544 [doi]
• Online conflict-free coloring for intervalsAmos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. 545-554 [doi]
• Loop quantum gravityJohn C. Baez. 555 [doi]
• Approximation algorithms for cycle packing problemsMichael Krivelevich, Zeev Nutov, Raphael Yuster. 556-561 [doi]
• Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-roundingHarold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson. 562-571 [doi]
• Partial covering of hypergraphsÖzgür Sümer. 572-581 [doi]
• Approximating vertex cover on dense graphsTomokazu Imamura, Kazuo Iwama. 582-589 [doi]
• Bidimensionality: new connections between FPT algorithms and PTASsErik D. Demaine, Mohammad Taghi Hajiaghayi. 590-601 [doi]
• Limitations of cross-monotonic cost sharing schemesNicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni. 602-611 [doi]
• A group-strategyproof mechanism for Steiner forestsJochen Könemann, Stefano Leonardi, Guido Schäfer. 612-619 [doi]
• Collusion-resistant mechanisms for single-parameter agentsAndrew V. Goldberg, Jason D. Hartline. 620-629 [doi]
• A multiple-choice secretary algorithm with applications to online auctionsRobert D. Kleinberg. 630-631 [doi]
• Rounds vs queries trade-off in noisy computationNavin Goyal, Michael E. Saks. 632-639 [doi]
• Distributed approaches to triangulation and embeddingAleksandrs Slivkins. 640-649 [doi]
• Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametricsNoga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. 650-659 [doi]
• Sparse source-wise and pair-wise distance preserversDon Coppersmith, Michael Elkin. 660-669 [doi]
• Lower bound for sparse Euclidean spannersPankaj K. Agarwal, Yusu Wang, Peng Yin. 670-671 [doi]
• New constructions of (alpha, beta)-spanners and purely additive spannersSurender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie. 672-681 [doi]
• Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionalityErik D. Demaine, Mohammad Taghi Hajiaghayi. 682-689 [doi]
• Dissections and trees, with applications to optimal mesh encoding and to random samplingÉric Fusy, Dominique Poulalhon, Gilles Schaeffer. 690-699 [doi]
• The expected value of random minimal length spanning tree of a complete graphDavid Gamarnik. 700-704 [doi]
• Girth restrictions for the 5-flow conjectureMartin Kochol. 705-707 [doi]
• Linear equations, arithmetic progressions and hypergraph property testingNoga Alon, Asaf Shapira. 708-717 [doi]
• The relative worst order ratio applied to pagingJoan Boyar, Lene M. Favrholdt, Kim S. Larsen. 718-727 [doi]
• Strictly convex drawings of planar graphsGünter Rote. 728-734 [doi]
• External-memory exact and approximate all-pairs shortest-paths in undirected graphsRezaul Alam Chowdhury, Vijaya Ramachandran. 735-744 [doi]
• Graph distances in the streaming model: the value of spaceJoan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang. 745-754 [doi]
• Lower bounds for external algebraic decision treesJeff Erickson. 755-761 [doi]
• On hierarchical routing in doubling metricsHubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou. 762-771 [doi]
• Fast convergence of selfish reroutingEyal Even-Dar, Yishay Mansour. 772-781 [doi]
• Oblivious routing on node-capacitated and directed graphsMohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke. 782-790 [doi]
• Distributed online call control on general networksHarald Räcke, Adi Rosén. 791-800 [doi]
• An optimal online algorithm for packet scheduling with agreeable deadlinesFei Li, Jay Sethuraman, Clifford Stein. 801-802 [doi]
• An optimal dynamic interval stabbing-max data structure?Pankaj K. Agarwal, Lars Arge, Ke Yi. 803-812 [doi]
• Self-adjusting top treesRobert Endre Tarjan, Renato Fonseca F. Werneck. 813-822 [doi]
• An optimal Bloom filter replacementAnna Pagh, Rasmus Pagh, S. Srinivasa Rao. 823-829 [doi]
• Efficient hashing with lookups in two memory accessesRina Panigrahy. 830-839 [doi]
• Improved range-summable random variable construction algorithmsA. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss. 840-849 [doi]
• A spectral heuristic for bisecting random graphsAmin Coja-Oghlan. 850-859 [doi]
• Complete partitions of graphsGuy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian. 860-869 [doi]
• Two algorithms for general list matrix partitionsTomás Feder, Pavol Hell, Daniel Král, Jiri Sgall. 870-876 [doi]
• How fast is the k-means method?Sariel Har-Peled, Bardia Sadri. 877-885 [doi]
• On approximating the depth and related problemsBoris Aronov, Sariel Har-Peled. 886-894 [doi]
• Multicoloring unit disk graphs on triangular lattice pointsYuichiro Miyamoto, Tomomi Matsui. 895-896 [doi]
• An asymptotic approximation scheme for multigraph edge coloringPeter Sanders, David Steurer. 897-906 [doi]
• Computing minimal triangulations in time O(n:::alpha::: log n) = o(n:::2.376:::)Pinar Heggernes, Jan Arne Telle, Yngve Villanger. 907-916 [doi]
• Finding the shortest bottleneck edge in a parametric minimum spanning treeTimothy M. Chan. 917-918 [doi]
• On the random 2-stage minimum spanning treeAbraham D. Flaxman, Alan M. Frieze, Michael Krivelevich. 919-926 [doi]
• Rigorous analysis of heuristics for NP-hard problemsUriel Feige. 927 [doi]
• An improved approximation algorithm for virtual private network designFriedrich Eisenbrand, Fabrizio Grandoni. 928-932 [doi]
• Network design for information networksAra Hayrapetyan, Chaitanya Swamy, Éva Tardos. 933-942 [doi]
• On the approximability of some network design problemsJulia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha. 943-951 [doi]
• Approximating k-median with non-uniform capacitiesJulia Chuzhoy, Yuval Rabani. 952-958 [doi]
• Improved approximation for universal facility locationNaveen Garg, Rohit Khandekar, Vinayaka Pandit. 959-960 [doi]
• The cover time of two classes of random graphsColin Cooper, Alan M. Frieze. 961-970 [doi]
• Coupling with the stationary distribution and improved sampling for colorings and independent setsThomas P. Hayes, Eric Vigoda. 971-979 [doi]
• Sampling regular graphs and a peer-to-peer networkColin Cooper, Martin E. Dyer, Catherine S. Greenhill. 980-988 [doi]
• The bin-covering technique for thresholding random geometric graph propertiesS. Muthukrishnan, Gopal Pandurangan. 989-998 [doi]
• Random planar graphs with ::::n:::: nodes and a fixed number of edgesStefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl. 999-1007 [doi]
• Provably good moving least squaresRavi Krishna Kolluri. 1008-1017 [doi]
• Manifold reconstruction from point samplesSiu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos. 1018-1027 [doi]
• Delaunay triangulations approximate anchor hullsTamal K. Dey, Joachim Giesen, Samrat Goswami. 1028-1037 [doi]
• Greedy optimal homotopy and homology generatorsJeff Erickson, Kim Whittlesey. 1038-1046 [doi]
• Controlled perturbation for Delaunay triangulationsStefan Funke, Christian Klein, Kurt Mehlhorn, Susanne Schmitt. 1047-1056 [doi]
• Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric groupLászló Babai, Thomas P. Hayes. 1057-1066 [doi]
• Matrix rounding with low error in small submatricesBenjamin Doerr. 1067-1068 [doi]
• Can the TPRI structure help us to solve the algebraic eigenproblem?Victor Y. Pan. 1069-1078 [doi]
• Optimal random number generation from a biased coinSung-il Pae, Michael C. Loui. 1079-1088 [doi]
• A new look at survey propagation and its generalizationsElitza N. Maneva, Elchanan Mossel, Martin J. Wainwright. 1089-1098 [doi]
• Coins make quantum walks fasterAndris Ambainis, Julia Kempe, Alexander Rivosh. 1099-1108 [doi]
• Quantum algorithms for the triangle problemFrédéric Magniez, Miklos Santha, Mario Szegedy. 1109-1117 [doi]
• The hidden subgroup problem and permutation group theoryJulia Kempe, Aner Shalev. 1118-1125 [doi]
• Testing hierarchical systemsDamon Mosk-Aoyama, Mihalis Yannakakis. 1126-1135 [doi]
• Conformance testing in the presence of multiple faultsViraj Kumar, Mahesh Viswanathan. 1136-1145 [doi]
• Online ascending auctions for gradually expiring itemsRon Lavi, Noam Nisan. 1146-1155 [doi]
• Near-optimal online auctionsAvrim Blum, Jason D. Hartline. 1156-1163 [doi]
• On profit-maximizing envy-free pricingVenkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, Frank McSherry. 1164-1173 [doi]
• Improved recommendation systemsBaruch Awerbuch, Boaz Patt-Shamir, David Peleg, Mark R. Tuttle. 1174-1183 [doi]
• Selfish routing with atomic playersTim Roughgarden. 1184-1185 [doi]