Abstract is missing.
- Approximation algorithms for the 0-extension problemGruia Calinescu, Howard J. Karloff, Yuval Rabani. 8-16 [doi]
- A faster implementation of the Goemans-Williamson clustering algorithmRichard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat. 17-25 [doi]
- Tree packing and approximating k-cutsJoseph Naor, Yuval Rabani. 26-27 [doi]
- Generating well-shaped Delaunay meshed in 3DXiang-Yang Li, Shang-Hua Teng. 28-37 [doi]
- Approximation algorithms for TSP with neighborhoods in the planeAdrian Dumitrescu, Joseph S. B. Mitchell. 38-46 [doi]
- Dynamic skin triangulationHo-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan. 47-56 [doi]
- Reconciling simplicity and realism in parallel disk modelsPeter Sanders. 67-76 [doi]
- Distribution sort with randomizing cycleJeffrey Scott Vitter, David A. Hutchinson. 77-86 [doi]
- External memory BFS on undirected graphs with bounded degreeUlrich Meyer. 87-88 [doi]
- I/O-efficient algorithms for graphs of bounded treewidthAnil Maheshwari, Norbert Zeh. 89-90 [doi]
- Constructing worst case instances for semidefinite programming based approximation algorithmsNoga Alon, Benny Sudakov, Uri Zwick. 92-100 [doi]
- Randomizing combinatorial algorithms for linear programming when the dimension is moderately highMarco Pellegrini. 101-108 [doi]
- Approximation algorithms for the metric labeling problem via a new linear programming formulationChandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin. 109-118 [doi]
- Lattice approximation and linear discrepency of totally unimodular matricesBenjamin Doerr. 119-125 [doi]
- On polynomial approximation to the shortest lattice vector lengthRavi Kumar, D. Sivakumar. 126-127 [doi]
- Approximation for minimum triangulation of convex polyhedraFrancis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang. 128-137 [doi]
- Optimal covering tours with turn costsEsther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia. 138-147 [doi]
- Maintaining approximate extent measures of moving pointsPankaj K. Agarwal, Sariel Har-Peled. 148-157 [doi]
- Simplified kinetic connectivity for rectangles and hypercubesJohn Hershberger, Subhash Suri. 158-167 [doi]
- Static and kinetic geometric spanners with applicationsMenelaos I. Karavelas, Leonidas J. Guibas. 168-176 [doi]
- Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distanceDavid Liben-Nowell. 177-185 [doi]
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joiningKatherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter. 196-205 [doi]
- A probabilistic analysis of a greedy algorithm arising from computational biologyDaniel G. Brown. 206-207 [doi]
- Distance labeling in graphsCyril Gavoille, David Peleg, Stephane Perennes, Ran Raz. 210-219 [doi]
- Steiner points in tree metrics don t (really) helpAnupam Gupta. 220-227 [doi]
- Fast approximation of centralityDavid Eppstein, Joseph Wang. 228-229 [doi]
- K-pair delay constrained minimum cost routing in undirected networksGuangting Chen, Guoliang Xue. 230-231 [doi]
- A deterministic algorithm for the cost-distance problemChandra Chekuri, Sanjeev Khanna, Joseph Naor. 232-233 [doi]
- Shape sensitive geometric permutationsYunhong Zhou, Subhash Suri. 234-243 [doi]
- Geometric permutations of high dimensional spheresYingping Huang, Jinhui Xu, Danny Z. Chen. 244-245 [doi]
- Inserting an edge into a planar graphCarsten Gutwenger, Petra Mutzel, René Weiskircher. 246-255 [doi]
- Entropy-preserving cuttings and space-efficient planar point locationSunil Arya, Theocharis Malamatos, David M. Mount. 256-261 [doi]
- A simple entropy-based algorithm for planar point locationSunil Arya, Theocharis Malamatos, David M. Mount. 262-268 [doi]
- An experimental study of an opportunistic indexPaolo Ferragina, Giovanni Manzini. 269-278 [doi]
- Overlap matchingAmihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat. 279-288 [doi]
- Pattern matching for sets of segmentsAlon Efrat, Piotr Indyk, Suresh Venkatasubramanian. 295-304 [doi]
- Approximate subset matching with Don t CaresAmihood Amir, Ely Porat, Moshe Lewenstein. 305-306 [doi]
- On approximating the achromatic numberGuy Kortsarz, Robert Krauthgamer. 309-318 [doi]
- Coloring k-colorable graphs using smaller palettesEran Halperin, Ram Nathaniel, Uri Zwick. 319-326 [doi]
- Approximating coloring and maximum independent sets in 3-uniform hypergraphsMichael Krivelevich, Ram Nathaniel, Benny Sudakov. 327-328 [doi]
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfactionDavid Eppstein. 329-337 [doi]
- Optimal planar point locationJohn Iacono. 340-341 [doi]
- Reconstructing a collection of curves with corners and endpointsStefan Funke, Edgar A. Ramos. 344-353 [doi]
- Web caching using access statisticsAdam Meyerson, Kamesh Munagala, Serge A. Plotkin. 354-363 [doi]
- Competitive on-line stream merging algorithms for media-on-demandAmotz Bar-Noy, Richard E. Ladner. 364-373 [doi]
- On-line restricted cachingMark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner. 374-383 [doi]
- Approximate majorization and fair online load balancingAshish Goel, Adam Meyerson, Serge A. Plotkin. 384-390 [doi]
- Learning Markov networks: maximum bounded tree-width graphsDavid R. Karger, Nathan Srebro. 392-401 [doi]
- Approximately covering by cycles in planar graphsDieter Rautenbach, Bruce A. Reed. 402-406 [doi]
- Practical approximation algorithms for zero- and bounded-skew treesAlexander Zelikovsky, Ion I. Mandoiu. 407-416 [doi]
- Improved approximation algorithms for rectangle tiling and packingPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami. 427-436 [doi]
- Sublinear time approximate clusteringNina Mishra, Daniel Oblinger, Leonard Pitt. 439-447 [doi]
- Efficient oblivious transfer protocolsMoni Naor, Benny Pinkas. 448-457 [doi]
- Constructing pseudo-random permutations with a prescribed structureMoni Naor, Omer Reingold. 458-459 [doi]
- Robust algorithms for restricted domainsVijay Raghavan, Jeremy Spinrad. 460-467 [doi]
- A polynomial time recognition algorithm for probe interval graphsJulie L. Johnson, Jeremy Spinrad. 477-486 [doi]
- A new constructive root bound for algebraic expressionsChen Li 0003, Chee-Keng Yap. 496-505 [doi]
- Orderly spanning trees with applications to graph encoding and graph drawingYi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu. 506-515 [doi]
- Alternatives to splay trees with O(log n) worst-case access timesJohn Iacono. 516-522 [doi]
- Worst case constant time priority queueAndrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro. 523-528 [doi]
- Representing dynamic binary trees succinctlyJ. Ian Munro, Venkatesh Raman, Adam J. Storm. 529-536 [doi]
- Better approximation algorithms for bin coveringJános Csirik, David S. Johnson, Claire Kenyon. 557-566 [doi]
- New approaches to covering and packing problemsAravind Srinivasan. 567-576 [doi]
- Parallel processor scheduling with delay constraintsDaniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl. 577-585 [doi]
- Approximation algorithms for extensible bin packingEdward G. Coffman Jr., George S. Lueker. 586-588 [doi]
- Scheduling precedence-constrained jobs with stochastic processing times on parallel machinesMartin Skutella, Marc Uetz. 589-590 [doi]
- Loss-bounded analysis for differentiated servicesAlexander Kesselman, Yishay Mansour. 591-600 [doi]
- Stability preserving transformations: packet routing networks with edge capacities and speedsAllan Borodin, Rafail Ostrovsky, Yuval Rabani. 601-610 [doi]
- Distributed admission control, scheduling, and routing with stale informationAshish Goel, Adam Meyerson, Serge A. Plotkin. 611-619 [doi]
- On algorithms for efficient data migrationJoseph Hall, Jason D. Hartline, Anna R. Karlin, Jared Saia, John Wilkes. 620-629 [doi]
- Fast distributed graph coloring with O(Delta) colorsGianluca De Marco, Andrzej Pelc. 630-635 [doi]
- Improved algorithms for fault tolerant facility locationSudipto Guha, Adam Meyerson, Kamesh Munagala. 636-641 [doi]
- Algorithms for facility location problems with outliersMoses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan. 642-651 [doi]
- The probabilistic relationship between the assignment and asymmetric traveling salesman problemsAlan M. Frieze, Gregory B. Sorkin. 652-660 [doi]
- Approximation algorithms for data placement in arbitrary networksIvan D. Baev, Rajmohan Rajaraman. 661-670 [doi]
- Polynomial-time approximation schemes for geometric graphsThomas Erlebach, Klaus Jansen, Eike Seidel. 671-679 [doi]
- Morphing between polylinesAlon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali. 680-689 [doi]
- Fast implementation of depth contours using topological sweepKim Miller, Suneeta Ramaswami, Peter Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf. 690-699 [doi]
- Computing the depth of a flatMarshall W. Bern. 700-701 [doi]
- Which formulae shrink under random restrictions?Hana Chockler, Uri Zwick. 702-708 [doi]
- Selective families, superimposed codes, and broadcasting on unknown radio networksAndrea E. F. Clementi, Angelo Monti, Riccardo Silvestri. 709-718 [doi]
- Adversarial models in evolutionary game dynamicsGabriel Istrate, Madhav V. Marathe, S. S. Ravi. 719-720 [doi]
- The phase transition in 1-in-k SAT and NAE 3-SATDimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore. 721-722 [doi]
- Guessing secretsFan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton. 723-726 [doi]
- Can entropy characterize performance of online algorithms?Gopal Pandurangan, Eli Upfal. 727-734 [doi]
- Competitive auctions and digital goodsAndrew V. Goldberg, Jason D. Hartline, Andrew Wright. 735-744 [doi]
- Towards understanding the predictability of stock markets from the perspective of computational complexityJames Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar. 745-754 [doi]
- Performance guarentee for online deadline scheduling in the presence of overloadTak Wah Lam, Kar-Keung To. 755-764 [doi]
- The inverse nearest neighbor problem with astrophysical applicationsRichard J. Anderson, Brian Tjaden. 767-768 [doi]
- Reductions among high dimensional proximity problemsAshish Goel, Piotr Indyk, Kasturi R. Varadarajan. 769-778 [doi]
- A cell probe lower bound for dynamic nearest-neighbor searchingStephen Alstrup, Thore Husfeldt, Theis Rauhe. 779-780 [doi]
- Shape matching using edit-distance: an implementationPhilip N. Klein, Thomas B. Sebastian, Benjamin B. Kimia. 781-790 [doi]
- On validating planar worldsVida Dujmovic, Sue Whitesides. 791-792 [doi]
- Improved fast integer sorting in linear spaceYijie Han. 793-796 [doi]
- Single-source shortest-paths on arbitrary directed graphs in linear average-case timeUlrich Meyer. 797-806 [doi]
- Optimal constrained graph explorationChristian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar. 807-814 [doi]
- An efficient algorithm for the configuration problem of dominance graphsErnst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. 815-824 [doi]
- Linear reductions of maximum matchingTherese C. Biedl. 825-826 [doi]
- Internet packet filter management and rectangle geometryDavid Eppstein, S. Muthukrishnan. 827-835 [doi]
- Faster kinetic heaps and their use in broadcast schedulingHaim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis. 836-844 [doi]
- Finding least common ancestors in directed acyclic graphsMichael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin. 845-854 [doi]
- On binary searching with non-uniform costsEduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa. 855-864 [doi]
- Soft kinetic data structuresArtur Czumaj, Christian Sohler. 865-872 [doi]
- Testing graphs for colorable propertiesEldar Fischer. 873-882 [doi]
- Random lifts of graphsAlon Amit, Nathan Linial, Jirí Matousek, Eyal Rozenman. 883-894 [doi]
- IMproved results for route planning in stochastic transportationJustin A. Boyan, Michael Mitzenmacher. 895-902 [doi]
- Hill-climbing finds random planted bisectionsTed Carson, Russell Impagliazzo. 903-909 [doi]
- On universally easy classes for NP-complete problemsErik D. Demaine, Alejandro López-Ortiz, J. Ian Munro. 910-911 [doi]
- The diameter of random massive graphsLinyuan Lu. 912-921 [doi]
- Domatic partitions and the Lovász local lemmaAravind Srinivasan. 922-923 [doi]
- Equitable colorings extend Chernoff-Hoeffding boundsSriram V. Pemmaraju. 924-925 [doi]
- Universal configurations in light-flipping gamesYevgeniy Dodis, Peter Winkler. 926-927 [doi]
- On the discrete Bak-Sneppen model of self-organized criticalityJérémy Barbay, Claire Kenyon. 928-933 [doi]