Abstract is missing.
- Algorithmic Problems Arising from Genome Informatics (Abstract)Satoru Miyano. 1
- An Approximation Algorithm for Alphabet Indexing ProblemShinichi Shimozono. 2-11
- A Fast and Space - Economical Algorithm for Length - Limited CodingJyrki Katajainen, Alistair Moffat, Andrew Turpin. 12-21
- Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally VisibleBinay K. Bhattacharya, Asish Mukhopadhyay. 22-31
- Competitive Searching in Polygons - Beyond Generalised StreetsAmitava Datta, Christoph A. Hipke, Sven Schuierer. 32-41
- Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing AreasYoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki. 42-51
- Logspace Verifiers, NC, and NPSatyanarayana V. Lokam, Meena Mahajan, V. Vinay. 52-61
- Structure in Average Case ComplexityChristoph Karg, Rainer Schuler. 62-71
- Some Geometric Lower BoundsHank Chien, William L. Steiger. 72-81
- The I/O - Complexity of Ordered Binary - Decision Diagram ManipulationLars Arge. 82-91
- Two Arc Disjoint Paths in Eulerian DiagraphsAndrás Frank, Toshihide Ibaraki, Hiroshi Nagamochi. 92-101
- Finding Dense SubgraphsYuichi Asahiro, Kazuo Iwama. 102-111
- finding Smallest SupertreesArvind Gupta, Naomi Nishimura. 112-121
- Weighted Domination on Cocomparability GraphsMaw-Shang Chang. 122-131
- The Parallel Complexity of Approximating the High Degree Subgraph ProblemAlexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim. 132-141
- Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected GraphsVineet Bafna, Piotr Berman, Toshihiro Fujito. 142-151
- Greedy Approximations of Independent Sets in Low Degree GraphsMagnús M. Halldórsson, Kiyohito Yoshihara. 152-161
- Practical Logic (Abstract)John N. Crossley. 162
- An Approximation Algorithm for MAX 3-SATTakao Ono, Tomio Hirata, Takao Asano. 163-170
- Learning of Restricted RNLC Graph LanguagesSei ichi Tani, Koichi Yamazaki. 171-180
- Optimal Information DeliveryChristos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan. 181-187
- On the Complexity of Testing for Catastrophic FaultsNicola Santoro, J. Ren, Amiya Nayak. 188-197
- Scheduling Parallel Tasks with Individual DeadlinesOh-Heum Kwon, Kyung-Yong Chwa. 198-207
- Orders of Gauss Periods in Finite FieldsJoachim von zur Gathen, Igor Shparlinski. 208-215
- A Hard Problem That is Almost Always EasyGeorge Havas, Bohdan S. Majewski. 216-223
- Computing the Tutte Polynomial of a Graph of Moderate SizeKyoko Sekine, Hiroshi Imai, Seiichiro Tani. 224-233
- More Efficient Parallel Flow AlgorithmsJürgen Dedorath, Jordan Gergov, Torben Hagerup. 234-243
- Linear-time In-place Selection in Less than 3n ComparisonsSvante Carlsson, Mikael Sundström. 244-253
- Heap Construction: Optimal in Both Worst and Average Cases?Svante Carlsson, Jingsen Chen. 254-263
- Fast Approximate Dictionary MatchingFei Shi. 264-273
- Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity AugmentationTsan-sheng Hsu. 274-283
- Searching for a Monotone Function by Independent Threshold QueriesPeter Damaschke. 284-290
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean FunctionsKazuhisa Makino, Toshihide Ibaraki. 291-300
- Deciding Bisimulation and Trace Equivalences for Systems with Many Identical ProcessesHsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao. 301-310
- Should Amdahl s Law Be Repealed? (Abstract)Franco P. Preparata. 311
- Embeddings of Hyper-Rings in HypercubesYukihiro Hamada, Aohan Mei, Yasuaki Nishitani, Yoshihide Igarashi. 312-321
- A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point SetsSiu-Wing Cheng, Chi-Keung Tang. 322-331
- Algorithms for Finding f-Colorings of Partial k-TreesXiao Zhou, Takao Nishizeki. 332-341
- Spanning Closed Trail and Hamiltonian Cycle in Grid GraphsCho Hwan-Gue, Alexander Zelikovsky. 342-351
- A Linear Time Algorithm For Finding Maximal Planar SubgraphsWen-Lian Hsu. 352-361
- Illumination with Orthogonal FloodlightsJames Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia. 362-371
- No Quadrangulation is Extremely OddProsenjit Bose, Godfried T. Toussaint. 372-381
- Finding the Medial Axis of a Simple Polygon in Linear TimeFrancis Y. L. Chin, Jack Snoeyink, Cao An Wang. 382-391
- The First Subquadratic Algorithm for Complete Linkage ClusteringDrago Krznaric, Christos Levcopoulos. 392-401
- Matching Nuts and Bolts FasterPhillip G. Bradford, Rudolf Fleischer. 402-408
- Linear matching-time algorithm for the directed graph isomorphism problemJames Jianghai Fu. 409-417
- A Resource Assignment Problem on GraphsSatoshi Fujita, Tiko Kameda, Masafumi Yamashita. 418-427
- NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an ApplicationZhi-Zhong Chen. 428-437