Abstract is missing.
- Applications of a Numbering Scheme for Polygonal Obstacles in the PlaneMikhail J. Atallah, Danny Z. Chen. 1-24
- Incremental Convex Hull Algorithms Are Not Output SensitiveDavid Bremner. 26-35
- Separating and Shattering Long Line SegmentsAlon Efrat, Otfried Schwarzkopf. 36-44
- Optimal Line Bipartitions of Point SetsOlivier Devillers, Matthew J. Katz. 45-54
- Interval Finding and Its Application to Data MiningTakeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama. 55-64
- On the Approximability of the Steiner Tree Problem in PhylogenyDavid Fernández-Baca, Jens Lagergren. 65-74
- Approximation and Special Cases of Common Subtrees and Editing DistanceMagnús M. Halldórsson, Keisuke Tanaka. 75-84
- Two-Dimensional Dynamic Dictionary MatchingYing Choi, Tak Wah Lam. 85-94
- Discovering Unbounded Unions of Regular Pattern Languages from Positive Examples (Extended Abstract)Alvis Brazma, Esko Ukkonen, Jaak Vilo. 95-104
- Extremal Problems for Geometric HypergraphsTamal K. Dey, János Pach. 105-114
- Computing Fair and Bottleneck Matchings in Geormetric GraphsAlon Efrat, Matthew J. Katz. 115-125
- Computing the Maximum Overlap of Two Convex Polygons Under TranslationsMark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud. 126-135
- OBDDs of a Monotone Function and of Its Prime ImplicantsKazuyoshi Hayase, Hiroshi Imai. 136-145
- Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite GraphsMaw-Shang Chang. 146-155
- Graph Searching on Chordal GraphsSheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang. 156-165
- An Algorithm for Enumerating all Directed Spanning Trees in a Directed GraphTakeaki Uno. 166-173
- Vertex Ranking of Asteroidal Triple-Free GraphsTon Kloks, Haiko Müller, C. K. Wong. 174-182
- Recursively Divisible ProblemsRolf Niedermeier. 183-192
- StUSPACE(log n) <= DSPACE(log²n / log log n)Eric Allender, Klaus-Jörn Lange. 193-202
- Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract)Xiao Zhou, Syurei Tamura, Takao Nishizeki. 203-212
- Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract)Tsan-sheng Hsu, Ming-Yang Kao. 213-222
- Towards More Precise Parallel Biconnectivity ApproximationKa Wong Chong, Tak Wah Lam. 223-232
- The Complexity of Probabilistic versus Deterministic Finite AutomataAndris Ambainis. 233-238
- Bounded Length UCFG EquivalenceBruce E. Litow. 239-246
- The Steiner Minimal Tree Problem in the lambda-Geormetry PlaneD. T. Lee, C. F. Shen. 247-255
- A Study of the LMT-SkeletonSiu-Wing Cheng, Naoki Katoh, Manabu Sugai. 256-265
- A New Subgraph of Minimum Weight TriangulationsCao An Wang, Francis Y. L. Chin, Yin-Feng Xu. 266-274
- Dynamic Tree Routing under the Matching with Consumption ModelGrammati E. Pantziou, Alan Roberts, Antonios Symvonis. 275-284
- Dimension-Exchange Token Distribution on the Mesh and the TorusMichael E. Houle, Gavin Turner. 285-294
- Directed Hamiltonian Packing in ::::d::::-Dimensional Meshes and Its Application (Extended Abstract)Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa. 295-304
- ::::k::::-Pairs Non-Crossing Shortest Paths in a Simple PolygonEvanthia Papadopoulou. 305-314
- Minimum Convex Partition of a Polygon with Holes by Cuts in Given DirectionsAndrzej Lingas, V. Soltan. 315-325
- Efficient List Ranking on the Reconfigurable Mesh, with ApplicationsTatsuya Hayashi, Koji Nakano, Stephan Olariu. 326-335
- Periodic Merging NetworksMiroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff. 336-345
- Minimum Wavelength in an All-Optical Ring NetworkGordon T. Wilfong. 346-355
- Competitive Analysis of On-Line Disk SchedulingTzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen. 356-365
- Scheduling Interval Ordered Tasks with Non-Uniform DeadlinesJacques Verriet. 366-375
- Cryptographic Weaknesses in the Round Transformation Used in a Block Cipher with Provable Immunity Against Linear Cryptanalysis (Extended Abstract)Kouichi Sakurai, Yuliang Zheng. 376-385
- The Multi-variable Modular Polynomial and Its Applications to CryptographyTsuyoshi Takagi, Shozo Naito. 386-396
- Bounds and Algorithms for a Practical Task Allocation Model (Extended Abstract)Tsan-sheng Hsu, Dian Rae Lopez. 397-406
- Scheduling Algorithms for Strict Multithreaded ComputationsPanagiota Fatourou, Paul G. Spirakis. 407-416
- On Multi-threaded PagingEsteban Feuerstein, Alejandro Strejilevich de Loma. 417-426
- A Fast and Efficient Homophonic Coding AlgorithmBoris Ryabko, Andrei Fionov. 427-435
- An Improvement of the Digital Cash Protocol of Okamoto and OhtaOsamu Watanabe, Osamu Yamashita. 436-445