Abstract is missing.
- The Web as a Graph: Measurements, Models, and MethodsJon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins. 1-17 [doi]
- An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning TreeHiroshi Nagamochi, Toshihide Ibaraki. 31-40 [doi]
- Theory of 2-3 HeapsTadao Takaoka. 41-50 [doi]
- An External Memory Data Structure for Shortest Path QueriesDavid A. Hutchinson, Anil Maheshwari, Norbert Zeh. 51-60 [doi]
- Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform DegreesWing-Kai Hon, Tak Wah Lam. 61-70 [doi]
- An Approximation Algorithm for the Two-Layered Graph Drawing ProblemAtsuko Yamaguchi, Akihiro Sugimoto. 81-91 [doi]
- Area Minimization for Grid Visibility Representation of Hierarchically Planar GraphsXuemin Lin, Peter Eades. 92-102 [doi]
- Layout Problems on Lattice GraphsJosep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna. 103-112 [doi]
- A New Transference Theorem in the Geometry of NumbersJin-yi Cai. 113-122 [doi]
- On Covering and Rank Problems for Boolean Matrices and Their ApplicationsCarsten Damm, Ki Hang Kim, Fred W. Roush. 123-133 [doi]
- A Combinatorial Algorithm for PfaffiansMeena Mahajan, P. R. Subramanya, V. Vinay. 134-143 [doi]
- How to Swap a Failing Edge of a Single Source Shortest Paths TreeEnrico Nardelli, Guido Proietti, Peter Widmayer. 144-153 [doi]
- On Bounds for the k-Partitioning of GraphsSergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder. 154-163 [doi]
- Probabilities to Accept Languages by Quantum Finite AutomataAndris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts. 174-183 [doi]
- Distributionally-Hard LanguagesLance Fortnow, Aduri Pavan, Alan L. Selman. 184-193 [doi]
- Circuits and Context-Free LanguagesPierre McKenzie, Klaus Reinhardt, V. Vinay. 194-203 [doi]
- On the Negation-Limited Circuit Complexity of MergingKazuyuki Amano, Akira Maruoka, Jun Tarui. 204-209 [doi]
- Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential HierarchyPeter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe. 210-220 [doi]
- Minimizing Mean Response Time in Batch Processing SystemXiaotie Deng, Yuzhong Zhang. 231-240 [doi]
- Approximation Algorithms for Bounded Facility LocationPiotr Krysta, Roberto Solis-Oba. 241-250 [doi]
- Scheduling Trees onto Hypercubes and Grids Is NP-completeSatoshi Tayu. 251-260 [doi]
- Approximations of Weighted Independent Set and Hereditary Subset ProblemsMagnús M. Halldórsson. 261-270 [doi]
- Multi-coloring TreesMagnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle. 271-280 [doi]
- On the Complexity of Approximating Colored-Graph ProblemsAndrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi. 281-290 [doi]
- On the Average Sensitivity of Testing Square-Free NumbersAnna Bernasconi, Carsten Damm, Igor Shparlinski. 291-299 [doi]
- Binary Enumerability of Real NumbersXizhong Zheng. 300-309 [doi]
- GCD of Many IntegersGene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas. 310-317 [doi]
- Probabilistic Local Majority Voting for the Agreement Problem on Finite GraphsToshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita. 330-338 [doi]
- A Dynamic-Programming Bound for the Quadratic Assignment ProblemAmbros Marzetta, Adrian Brüngger. 339-348 [doi]
- A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid BasesTakeaki Uno. 349-359 [doi]
- On Routing in Circulant GraphsJin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski. 360-369 [doi]
- Minimum Congestion Embedding of Complete Binary Trees into ToriAkira Matsubayashi, Ryo Takasu. 370-378 [doi]
- Maximum Stabbing Line in 2D PlaneFrancis Y. L. Chin, Cao An Wang, Fu Lee Wang. 379-388 [doi]
- Generalized Shooter Location ProblemJeet Chaudhuri, Subhas C. Nandy. 389-399 [doi]
- A Competitive Online Algorithm for the Paging Problem with Shelf MemorySung-Pil Hong. 400-408 [doi]
- Using Generalized Forecasts for Online Currency ConversionKazuo Iwama, Kouki Yonezawa. 409-421 [doi]
- On S-Regular Prefix-Rewriting Systems and Automatic StructuresFriedrich Otto. 422-431 [doi]
- Tractable and Intractable Second-Order Matching ProblemsKouichi Hirata, Keizo Yamada, Masateru Harao. 432-441 [doi]
- Efficient Fixed-Size Systolic Arrays for the Modular MultiplicationSung-Woo Lee, Hyun-Sung Kim, Jung-Joon Kim, Tae-Geun Kim, Kee-Young Yoo. 442-451 [doi]
- Improving Parallel Computation with Fast Integer SortingKa Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam. 452-461 [doi]
- A Cominatorial Approach to Performance Analysis of a Shared-Memory MultiprocessorSajal K. Das, Bhabani P. Sinha, Rajarshi Chaudhuri. 462-472 [doi]
- A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue SeparationJoachim Gudmundsson, Christos Levcopoulos. 473-482 [doi]
- The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent SetH. Y. Lau, H. F. Ting. 483-492 [doi]