Table of Contents

• epsilon-Approximate linear programs: new bounds and computationDaniel Bienstock. 1-2 [doi]
• Orthogonal graph drawing with constraintsMarkus Eiglsperger, Ulrich Fößmeier, Michael Kaufmann. 3-11 [doi]
• Commuting with delay prone busesMayur Datar, Abhiram G. Ranade. 22-29 [doi]
• On the complexity of bicoloring clique hypergraphs of graphs (extended abstract)Jan Kratochvíl, Zsolt Tuza. 40-41 [doi]
• Weakly chordal graph algorithms via handlesRyan Hayward, Jeremy Spinrad, R. Sritharan. 42-49 [doi]
• Recognizing dart-free perfect graphsVasek Chvátal, Jean Fonlupt, L. Sun, A. Zemirline. 50-53 [doi]
• An optimal algorithm for hyperplane depth in the planeStefan Langerman, William L. Steiger. 54-59 [doi]
• On Heilbronn s problem in higher dimensionHanno Lefmann. 60-64 [doi]
• Finding minimal triangulations of convex 3-polytopes is NP-hardAlexander Below, Jesús A. De Loera, Jürgen Richter-Gebert. 65-66 [doi]
• A point-placement strategy for conforming Delaunay tetrahedralizationMichael Murphy, David M. Mount, Carl W. Gable. 67-74 [doi]
• Digraph minors and algorithms (abstract only)Robin Thomas. 75 [doi]
• Improved approximation algorithms for MAX SATTakao Asano, David P. Williamson. 96-105 [doi]
• Strengthening integrality gaps for capacitated network design and covering problemsRobert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips. 106-115 [doi]
• Towards a 4/3 approximation for the asymmetric traveling salesman problemRobert D. Carr, Santosh Vempala, Jacques Mandler. 116-125 [doi]
• Typical random 3-SAT formulae and the satisfiability thresholdOlivier Dubois, Yacine Boufkhad, Jacques Mandler. 126-127 [doi]
• A lower bound for DLL algorithms for ::::k::::-SAT (preliminary version)Pavel Pudlák, Russell Impagliazzo. 128-136 [doi]
• On permutations with limited independenceToshiya Itoh, Yoshinori Takei, Jun Tarui. 137-146 [doi]
• Min-Wise versus linear independence (extended abstract)Andrei Z. Broder, Uriel Feige. 147-154 [doi]
• Hamiltonicity and colorings of arrangement graphsStefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu. 155-164 [doi]
• Testing and spot-checking of data streams (extended abstract)Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan. 165-174 [doi]
• Engineering the compression of massive tables: an experimental approachAdam L. Buchsbaum, Donald F. Caldwell, Kenneth Ward Church, Glenn S. Fowler, S. Muthukrishnan. 175-184 [doi]
• On the temporal HZY compression schemeZ. Cohen, Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv. 185-186 [doi]
• Height in a digital search tree and the longest phrase of the Lempel-Ziv schemeCharles Knessl, Wojciech Szpankowski. 187-196 [doi]
• Communication complexity of document exchangeGraham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin. 197-206 [doi]
• Scheduling a pipelined operator graphPetra Schuurman, Gerhard J. Woeginger. 207-212 [doi]
• A PTAS for the multiple knapsack problemChandra Chekuri, Sanjeev Khanna. 213-222 [doi]
• Approximation algorithms for data placement on parallel disksLeana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu. 223-232 [doi]
• Movement minimization in conveyor flow shop processingWolfgang Espelage, Egon Wanke. 233-234 [doi]
• Forcing relations for AND/OR precedence constraintsRolf H. Möhring, Martin Skutella, Frederik Stork. 235-236 [doi]
• The interlace polynomial: a new graph polynomialRichard Arratia, Béla Bollobás, Gregory B. Sorkin. 237-245 [doi]
• The complexity of counting graph homomorphisms (extended abstract)Martin E. Dyer, Catherine S. Greenhill. 246-255 [doi]
• A fast algorithm to generate unlabeled necklacesFrank Ruskey, Joe Sawada. 256-262 [doi]
• Construction of visual secret sharing schemes with almost optimal contrastChristian Kuhlmann, Hans-Ulrich Simon. 263-272 [doi]
• Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratioGiovanni Di Crescenzo. 273-274 [doi]
• Algorithmic strategies in combinatorial chemistryDeborah Goldman, Sorin Istrail, Giuseppe Lancia, Antonio Piccolboni, Brian Walenz. 275-284 [doi]
• Computing the quartet distance between evolutionary treesDavid Bryant, John Tsang, Paul E. Kearney, Ming Li. 285-286 [doi]
• A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang. 287-296 [doi]
• Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithmLaxmi Parida, Isidore Rigoutsos, Aris Floratos, Daniel E. Platt, Yuan Gao. 297-308 [doi]
• Improved bounds on the sample complexity of learningYi Li, Philip M. Long, Aravind Srinivasan. 309-318 [doi]
• On local search and placement of meters in networksSamir Khuller, Randeep Bhatia, Robert Pless. 319-328 [doi]
• Improved approximation algorithms for the vertex cover problem in graphs and hypergraphsEran Halperin. 329-337 [doi]
• An approximation algorithm for the covering Steiner problemGoran Konjevod, R. Ravi. 338-344 [doi]
• On the red-blue set cover problemRobert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe. 345-353 [doi]
• Approximate congruence in nearly linear timePiotr Indyk, Suresh Venkatasubramanian. 354-360 [doi]
• Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)Peter N. Yianilos. 361-370 [doi]
• Dimensionality reduction techniques for proximity problemsPiotr Indyk. 371-378 [doi]
• Expected-case complexity of approximate nearest neighbor searchingSunil Arya, Ho-Yam Addy Fu. 379-388 [doi]
• A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometryTing Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church. 389-398 [doi]
• Algorithms for optimizing production DNA sequencingÉva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney. 399-408 [doi]
• Estimating DNA sequence entropyJ. Kevin Lanctot, Ming Li, En-Hui Yang. 409-418 [doi]
• Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping projectDaniel G. Brown, Todd J. Vision, Steven D. Tanksley. 419-428 [doi]
• Cutting planes and the traveling salesman problem (abstract only)David Applegate, Robert E. Bixby, Vasek Chvátal, William Cook. 429 [doi]
• Instability of FIFO in session-oriented networksMatthew Andrews. 440-447 [doi]
• The effects of temporary sessions on network performanceMatthew Andrews, Lisa Zhang. 448-457 [doi]
• Randomized greedy hot-potato routingCostas Busch, Maurice Herlihy, Roger Wattenhofer. 458-466 [doi]
• On deciding stability of scheduling policies in queueing systemsDavid Gamarnik. 467-476 [doi]
• Restructuring ordered binary treesWilliam S. Evans, David G. Kirkpatrick. 477-486 [doi]
• Competitive tree-structured dictionariesMichael T. Goodrich. 494-495 [doi]
• Word encoding tree connectivity worksStephen Alstrup, Jens P. Secher, Mikkel Thorup. 498-499 [doi]
• Algorithms for minimum volume enclosing simplex in R:::3:::Yunhong Zhou, Subhash Suri. 500-509 [doi]
• Exact and approximation algorithms for minimum-width cylindrical shellsPankaj K. Agarwal, Boris Aronov, Micha Sharir. 510-517 [doi]
• Evaluating the cylindricity of a nominally cylindrical point setOlivier Devillers, Franco P. Preparata. 518-527 [doi]
• Approximation algorithms for layered manufacturingPankaj K. Agarwal, Pavan K. Desikan. 528-537 [doi]
• Approximation algorithms for projective clusteringPankaj K. Agarwal, Cecilia Magdalena Procopiuc. 538-547 [doi]
• Scheduling to minimize average stretch without migrationLuca Becchetti, Stefano Leonardi, S. Muthukrishnan. 548-557 [doi]
• Minimizing maximum response time in scheduling broadcastsYair Bartal, S. Muthukrishnan. 558-559 [doi]
• Applying extra-resource analysis to load balancingMark Brehob, Eric Torng, Patchrawat Uthaisombut. 560-561 [doi]
• Balancing Steiner trees and shortest path trees onlineAshish Goel, Kamesh Munagala. 562-563 [doi]
• Generating adversaries for request-answer gamesTodd Gormley, Nick Reingold, Eric Torng, Jeffery Westbrook. 564-565 [doi]
• Maintaining hierarchical graph viewsAdam L. Buchsbaum, Jeffery Westbrook. 566-575 [doi]
• Improved classification via connectivity informationAndrei Z. Broder, Robert Krauthgamer, Michael Mitzenmacher. 576-585 [doi]
• Efficient dynamic traitor tracingOmer Berkman, Michal Parnas, Jiri Sgall. 586-595 [doi]
• Watermarking maps: hiding information in structured dataSanjeev Khanna, Francis Zane. 596-605 [doi]
• Strictly non-blocking WDM cross-connectsApril Rasala, Gordon T. Wilfong. 606-615 [doi]
• An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract)Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher. 616-624 [doi]
• A faster method for sampling independent setsMark Huber. 625-626 [doi]
• Strong bias of group generators: an obstacle to the product replacement algorithm László Babai, Igor Pak. 627-635 [doi]
• Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilingsDana Randall, Gary D. Yngve. 636-645 [doi]
• An algebraic method to compute a shortest path of local flips between two tilingsEric Rémila. 646-653 [doi]
• Coloring powers of planar graphsGeir Agnarsson, Magnús M. Halldórsson. 654-662 [doi]
• Directed network design with orientation constraintsSanjeev Khanna, Joseph Naor, F. Bruce Shepherd. 663-671 [doi]
• TSP-based curve reconstruction in polynomial timeErnst Althaus, Kurt Mehlhorn. 686-695 [doi]
• A tree-edit-distance algorithm for comparing simple, closed shapesPhilip N. Klein, Srikanta Tirthapura, Daniel Sharvit, Benjamin B. Kimia. 696-704 [doi]
• Optimizing the sum of linear fractional functions and applicationsDanny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu. 707-716 [doi]
• Edge-disjoint paths in expander graphsAlan M. Frieze. 717-725 [doi]
• Escaping a grid by edge-disjoint pathsWun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting. 726-734 [doi]
• Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cutsMatthew S. Levine. 735-742 [doi]
• Adaptive set intersections, unions, and differencesErik D. Demaine, Alejandro López-Ortiz, J. Ian Munro. 743-752 [doi]
• The whole genome assembly of DrosophilaGene Myers. 753 [doi]
• A 2+epsilon approximation algorithm for the ::::k::::-MST problemSanjeev Arora, George Karakostas. 754-759 [doi]
• The prize collecting Steiner tree problem: theory and practiceDavid S. Johnson, Maria Minkoff, Steven Phillips. 760-769 [doi]
• The rectilinear Steiner arborescence problem is NP-completeWeiping Shi, Chen Su. 780-787 [doi]
• Improved bandwidth approximation for treesAnupam Gupta. 788-793 [doi]
• Faster algorithms for string matching with ::::k:::: mismatchesAmihood Amir, Moshe Lewenstein, Ely Porat. 794-803 [doi]
• On the shared substring alignment problemGad M. Landau, Michal Ziv-Ukelson. 804-814 [doi]
• Real scaled matchingAmihood Amir, Ayelet Butman, Moshe Lewenstein. 815-816 [doi]
• Inplace run-length 2d compressed searchAmihood Amir, Gad M. Landau, Dina Sokol. 817-818 [doi]
• Pattern matching in dynamic textsStephen Alstrup, Gerth Stølting Brodal, Theis Rauhe. 819-828 [doi]
• Towards a theory of cache-efficient algorithmsSandeep Sen, Siddhartha Chatterjee. 829-838 [doi]
• Efficient bundle sortingYossi Matias, Eran Segal, Jeffrey Scott Vitter. 839-848 [doi]
• Fast concurrent access to parallel disksPeter Sanders, Sebastian Egner, Jan H. M. Korst. 849-858 [doi]
• On external memory graph traversalAdam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery Westbrook. 859-860 [doi]
• Deterministic broadcasting in unknown radio networksBogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter. 861-870 [doi]
• New and improved algorithms for minsum shop schedulingMaurice Queyranne, Maxim Sviridenko. 871-878 [doi]
• Off-line admission control for general scheduling problemsCynthia A. Phillips, R. N. Uma, Joel Wein. 879-888 [doi]
• Approximating the maximum quadratic assignment problemEsther M. Arkin, Refael Hassin. 889-890 [doi]
• Accurate approximations for Asian optionsDonald Aingworth, Rajeev Motwani, Jeffrey D. Oldham. 891-900 [doi]
• On incremental rendering of silhouette maps of polyhedral sceneAlon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt, Li Zhang. 910-917 [doi]
• Computing contour trees in all dimensionsHamish Carr, Jack Snoeyink, Ulrike Axen. 918-926 [doi]
• Sweeping simple polygons with a chain of guardsAlon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, T. M. Murali. 927-936 [doi]
• Finding the closest lattice vector when it s unusually closePhilip N. Klein. 937-941 [doi]
• A new bound for the Carathéodory rank of the bases of a matroidJosé Coelho de Pina, José Soares. 942-943 [doi]
• Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networksS. Thomas McCormick, Akiyoshi Shioura. 944-952 [doi]
• Nearly optimal computations with structured matricesVictor Y. Pan. 953-962 [doi]