Table of Contents

• Optimal parallel selectionYijie Han. 1-9 [doi]
• Selection with monotone comparison costSampath Kannan, Sanjeev Khanna. 10-17 [doi]
• Property testing of data dimensionalityRobert Krauthgamer, Ori Sasson. 18-27 [doi]
• Comparing top k listsRonald Fagin, Ravi Kumar, D. Sivakumar. 28-36 [doi]
• Algorithms for power savingsSandy Irani, Sandeep K. Shukla, Rajesh K. Gupta. 37-46 [doi]
• Dynamic TCP acknowledgement: penalizing long delaysSusanne Albers, Helge Bals. 47-55 [doi]
• Approximately optimal control of fluid networksLisa Fleischer, Jay Sethuraman. 56-65 [doi]
• Minimum cost flows over time without intermediate storageLisa Fleischer, Martin Skutella. 66-75 [doi]
• Sublogarithmic approximation for telephone multicast: path out of jungleMichael Elkin, Guy Kortsarz. 76-85 [doi]
• On the performance of user equilibria in traffic networksAndreas S. Schulz, Nicolás E. Stier Moses. 86-87 [doi]
• Faster approximation algorithms for the minimum latency problemAaron Archer, David P. Williamson. 88-96 [doi]
• Data migration to minimize the average completion timeYoo Ah Kim. 97-98 [doi]
• Browsing around a digital libraryIan H. Witten. 99-99 [doi]
• Binary space partitions for 3D subdivisionsJohn Hershberger, Subhash Suri. 100-108 [doi]
• Allocating vertex pi-guards in simple polygons via pseudo-triangulationsBettina Speckmann, Csaba D. Tóth. 109-118 [doi]
• Straight-skeleton based contour interpolationGill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner. 119-127 [doi]
• Möbius-invariant natural neighbor interpolationMarshall W. Bern, David Eppstein. 128-129 [doi]
• Improved bounds on the average length of longest common subsequencesGeorge S. Lueker. 130-131 [doi]
• Directed scale-free graphsBéla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan. 132-139 [doi]
• The cover time of sparse random graphsColin Cooper, Alan M. Frieze. 140-147 [doi]
• Perfect matchings in random graphs with prescribed minimal degreeAlan M. Frieze, Boris Pittel. 148-157 [doi]
• Certifying algorithms for recognizing interval graphs and permutation graphsDieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad. 158-167 [doi]
• Dominating sets in planar graphs: branch-width and exponential speed-upFedor V. Fomin, Dimitrios M. Thilikos. 168-177 [doi]
• Chain decompositions and independent trees in 4-connected graphsSean Curran, Orlando Lee, Xingxing Yu. 186-191 [doi]
• Optimizing misdirectionPiotr Berman, Piotr Krysta. 192-201 [doi]
• Online learning in online auctionsAvrim Blum, Vijay Kumar, Atri Rudra, Felix Wu. 202-204 [doi]
• An approximate truthful mechanism for combinatorial auctions with single parameter agentsAaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos. 205-214 [doi]
• Competitiveness via consensusAndrew V. Goldberg, Jason D. Hartline. 215-222 [doi]
• Pass efficient algorithms for approximating large matricesPetros Drineas, Ravi Kannan. 223-232 [doi]
• Rangesum histogramsS. Muthukrishnan, Martin Strauss. 233-242 [doi]
• Approximation of functions over redundant dictionaries using coherenceAnna C. Gilbert, S. Muthukrishnan, Martin Strauss. 243-252 [doi]
• Counting inversions in listsAnupam Gupta, Francis Zane. 253-254 [doi]
• Certifying and repairing solutions to large LPs how good are LP-solvers?Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber. 255-256 [doi]
• An improved approximation algorithm for the 0-extension problemJittat Fakcharoenphol, Chris Harrelson, Satish Rao, Kunal Talwar. 257-265 [doi]
• Packing Steiner treesKamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour. 266-274 [doi]
• Integrality ratio for group Steiner trees and directed steiner treesEran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang. 275-284 [doi]
• The flow complex: a data structure for geometric modelingJoachim Giesen, Matthias John. 285-294 [doi]
• Graded conforming Delaunay tetrahedralization with bounded radius-edge ratioSiu-Wing Cheng, Sheung-Hung Poon. 295-304 [doi]
• On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheresJean-Daniel Boissonnat, Menelaos I. Karavelas. 305-312 [doi]
• Root comparison techniques applied to computing the additively weighted Voronoi diagramMenelaos I. Karavelas, Ioannis Z. Emiris. 320-329 [doi]
• Random walks on the vertices of transportation polytopes with constant number of sourcesMary Cryan, Martin E. Dyer, Haiko Müller, Leen Stougie. 330-339 [doi]
• Smaller explicit superconcentratorsNoga Alon, Michael R. Capalbo. 340-346 [doi]
• A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local LemmaMohammad R. Salavatipour. 347-356 [doi]
• A spectral technique for random satisfiable 3CNF formulasAbraham Flaxman. 357-363 [doi]
• Random MAX SAT, random MAX CUT, and their phase transitionsDon Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin. 364-373 [doi]
• Space-efficient finger search on degree-balanced search treesGuy E. Blelloch, Bruce M. Maggs, Shan Leung Maverick Woo. 374-383 [doi]
• Skip graphsJames Aspnes, Gauri Shah. 384-393 [doi]
• Maintaining all-pairs approximate shortest paths under deletion of edgesSurender Baswana, Ramesh Hariharan, Sandeep Sen. 394-403 [doi]
• Sparse distance preservers and additive spannersBéla Bollobás, Don Coppersmith, Michael Elkin. 414-423 [doi]
• Multi-embedding and path approximation of metric spacesYair Bartal, Manor Mendel. 424-433 [doi]
• Approximation algorithm for embedding metrics into a two-dimensional spaceMihai Badoiu. 434-443 [doi]
• On the complexity of distance-based evolutionary tree reconstructionValerie King, Li Zhang, Yunhong Zhou. 444-453 [doi]
• Improved results for directed multicutAnupam Gupta. 454-455 [doi]
• Algorithms for k-colouring and finding maximal independent setsJesper Makholm Byskov. 456-457 [doi]
• Equitable colorings with constant number of colorsSriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka. 458-459 [doi]
• Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraphHarold N. Gabow. 460-469 [doi]
• A note on the set systems used for broadcast encryptionRavi Kumar, Alexander Russell. 470-471 [doi]
• Lower bounds for collusion-secure fingerprintingChris Peikert, Abhi Shelat, Adam Smith. 472-479 [doi]
• Quantum property testingHarry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig. 480-488 [doi]
• Quantum algorithms for some hidden shift problemsWim van Dam, Sean Hallgren, Lawrence Ip. 489-498 [doi]
• Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulkAshish Goel, Deborah Estrin. 499-505 [doi]
• Non-independent randomized roundingBenjamin Doerr. 506-507 [doi]
• Minimizing weighted flow timeNikhil Bansal, Kedar Dhamdhere. 508-516 [doi]
• A combinatorial algorithm for computing a maximum independent set in a t-perfect graphFriedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann. 517-522 [doi]
• Lower bounds for embedding edit distance into normed spacesAlexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova. 523-526 [doi]
• Embedding k-outerplanar graphs into l1Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair. 527-536 [doi]
• Embeddings and non-approximability of geometric problemsVenkatesan Guruswami, Piotr Indyk. 537-538 [doi]
• Better algorithms for high-dimensional proximity problems via asymmetric embeddingsPiotr Indyk. 539-545 [doi]
• Online paging with arbitrary associativityEnoch Peserico. 555-564 [doi]
• The set-associative cache performance of search treesJames D. Fix. 565-572 [doi]
• Computing strongly connected components in a linear number of symbolic stepsRaffaella Gentilini, Carla Piazza, Alberto Policriti. 573-582 [doi]
• On the rectilinear crossing number of complete graphsUli Wagner. 583-588 [doi]
• Matching planar mapsHelmut Alt, Alon Efrat, Günter Rote, Carola Wenk. 589-598 [doi]
• Dynamic generators of topologically embedded graphsDavid Eppstein. 599-608 [doi]
• Computing homotopic shortest paths in the planeSergei Bespamyatnikh. 609-617 [doi]
• Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic timeChristian Worm Mortensen. 618-627 [doi]
• Edge disjoint paths revisitedChandra Chekuri, Sanjeev Khanna. 628-637 [doi]
• A new approximation algorithm for the asymmetric TSP with triangle inequalityMarkus Bläser. 638-645 [doi]
• Approximating asymmetric maximum TSPMoshe Lewenstein, Maxim Sviridenko. 646-654 [doi]
• The k-traveling repairman problemJittat Fakcharoenphol, Chris Harrelson, Satish Rao. 655-664 [doi]
• Directed graphs requiring large numbers of shortcutsWilliam Hesse. 665-669 [doi]
• Implicit dictionaries supporting searches and amortized updates in O(log n log log n) timeGianni Franceschini, Roberto Grossi. 670-678 [doi]
• Compact representations of separable graphsDaniel K. Blandford, Guy E. Blelloch, Ian A. Kash. 679-688 [doi]
• Labeling schemes for small distances in treesStephen Alstrup, Philip Bille, Theis Rauhe. 689-698 [doi]
• Who cares about permanents?Persi Diaconis. 708-708 [doi]
• Between O(nm) and O(n alpha)Dieter Kratsch, Jeremy Spinrad. 709-716 [doi]
• Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletonsDevdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan. 717-724 [doi]
• A 5/4-approximation algorithm for minimum 2-edge-connectivityRaja Jothi, Balaji Raghavachari, Subramanian Varadarajan. 725-734 [doi]
• Fault-tolerant facility locationChaitanya Swamy, David B. Shmoys. 735-736 [doi]
• Efficient sequences of trialsEdith Cohen, Amos Fiat, Haim Kaplan. 737-746 [doi]
• Pursuit-evasion with imprecise target locationGünter Rote. 747-753 [doi]
• Unconditional proof of tightness of Johnson boundVenkatesan Guruswami, Igor Shparlinski. 754-755 [doi]
• Deterministic identity testing for multivariate polynomialsRichard J. Lipton, Nisheeth K. Vishnoi. 756-760 [doi]
• Competitive queueing policies for QoS switchesNir Andelman, Yishay Mansour, An Zhu. 761-770 [doi]
• Dynamic construction of Bluetooth scatternets of fixed degree and low diameterLali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny. 781-790 [doi]
• Scheduling techniques for media-on-demandAmotz Bar-Noy, Richard E. Ladner, Tami Tamir. 791-80 [doi]
• Smaller core-sets for ballsMihai Badoiu, Kenneth L. Clarkson. 801-802 [doi]
• Zonotopes as bounding volumesLeonidas J. Guibas, An Nguyen, Li Zhang. 803-812 [doi]
• Sublinear-time approximation of Euclidean minimum spanning treeArtur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler. 813-822 [doi]
• An approximation algorithm for cutting out convex polygonsAdrian Dumitrescu. 823-827 [doi]
• Inferring tree topologies using flow testsS. Muthukrishnan, Torsten Suel, Radek Vingralek. 828-829 [doi]
• Wavelength assignment and generalized interval graph coloringPeter Winkler, Lisa Zhang. 830-831 [doi]
• An improved approximation algorithm for the partial latin square extension problemCarla P. Gomes, Rommel G. Regis, David B. Shmoys. 832-833 [doi]
• Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphsHung Q. Ngo, Van H. Vu. 834-840 [doi]
• High-order entropy-compressed text indexesRoberto Grossi, Ankur Gupta, Jeffrey Scott Vitter. 841-850 [doi]
• Multidimensional matching and fast search in suffix treesRichard Cole, Moshe Lewenstein. 851-852 [doi]
• Inplace 2D matching in compressed imagesAmihood Amir, Gad M. Landau, Dina Sokol. 853-862 [doi]
• The similarity metricMing Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi. 863-872 [doi]