Abstract is missing.
- Localized Network RepresentationsDavid Peleg. 1 [doi]
- Optimal Binary Search Trees with Costs Depending on the Access PathsJayme Luiz Szwarcfiter. 2 [doi]
- On the Generation of Extensions of a Partially Ordered SetJayme Luiz Szwarcfiter. 3 [doi]
- Error-Correcting Codes in Complexity TheoryLuca Trevisan. 4 [doi]
- Cache-Oblivious AlgorithmsCharles E. Leiserson. 5 [doi]
- Spanning Trees with Low Maximum/Average StretchDavid Peleg. 6 [doi]
- Hyper Encryption and Everlasting SecretsMichael O. Rabin. 7-10 [doi]
- Computing with Electronic NanotechnologiesJohn E. Savage. 11 [doi]
- Efficient Update Strategies for Geometric Computing with UncertaintyRichard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman. 12-23 [doi]
- Maximizing the Guarded Boundary of an Art Gallery Is APX-CompleteEuripides Markou, Stathis Zachos, Christodoulos Fragoudakis. 24-35 [doi]
- An Improved Algorithm for Point Set Pattern Matching under Rigid MotionArijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya. 36-45 [doi]
- Unlocking the Advantages of Dynamic Service Selection and PricingBala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky. 46-57 [doi]
- The Relative Worst Order Ratio for On-Line AlgorithmsJoan Boyar, Lene M. Favrholdt. 58-69 [doi]
- On-Line Stream Merging, Max Span, and Min CoverageWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong. 70-82 [doi]
- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular GraphsWilliam Duckworth, Bernard Mans. 83-95 [doi]
- Additive Spanners for k-Chordal GraphsVictor Chepoi, Feodor F. Dragan, Chenyu Yan. 96-107 [doi]
- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique GenerationJens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier. 108-119 [doi]
- Reconciling Gene Trees to a Species TreePaola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi. 120-131 [doi]
- Generating All Forest Extensions of a Partially Ordered SetJayme Luiz Szwarcfiter. 132-139 [doi]
- Indexing Structures for Approximate String MatchingAlessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino. 140-151 [doi]
- Approximation Hardness for Small Occurrence Instances of NP-Hard ProblemsMiroslav Chlebík, Janka Chlebíková. 152-164 [doi]
- Fast Approximation of Minimum Multicast Congestion - Implementation versus TheoryAndreas Baltz, Anand Srivastav. 165-177 [doi]
- Approximation of a Retrieval Problem for Parallel DisksJoep Aerts, Jan H. M. Korst, Frits C. R. Spieksma. 178-188 [doi]
- On k-Edge-Connectivity Problems with Sharpened Triangle InequalityHans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. 189-200 [doi]
- The Complexity of Detecting Fixed-Density ClustersKlaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig. 201-212 [doi]
- Nearly Bounded Error Probabilistic SetsTomoyuki Yamakami. 213-226 [doi]
- Some Properties of MOD::m:: Circuits Computing Simple FunctionsKazuyuki Amano, Akira Maruoka. 227-237 [doi]
- XOR-Based Schemes for Fast Parallel IP LookupsGian Carlo Bongiovanni, Paolo Penna. 238-250 [doi]
- The Impact of Network Structure on the Stability of Greedy ProtocolsDimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis. 251-263 [doi]
- Improving Customer Proximity to Railway StationsEvangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer. 264-276 [doi]
- Differential Approximation for Some Routing ProblemsCristina Bazgan, Refael Hassin, Jérôme Monnot. 277-288 [doi]