Table of Contents

• Reaching a Goal with Directional UncertaintyMark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir. 1-10
• Constructing Degree-3 Spanners with Other Sparseness PropertiesGautam Das, Paul J. Heffernan. 11-20
• Remembering Conflicts in History Yields Dynamic AlgorithmsKatrin Dobrindt, Mariette Yvinec. 21-30
• Coloring Random Graphs in Polynomial Expected TimeMartin Fürer, C. R. Subramanian, C. E. Veni Madhavan. 31-37
• Graphical Degree Sequence Problems with Connectivity RequirementsTakao Asano. 38-47
• How to Treat Delete Requests in Semi-Online ProblemsYang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh. 48-57
• Finding the Shortest Watchman Route in a Simple PolygonSvante Carlsson, Håkan Jonsson, Bengt J. Nilsson. 58-67
• Constructing Shortest Watchman Routes by Divide-and-ConquerXuehou Tan, Tomio Hirata. 68-77
• A Graph Coloring Result and Its Consequences for Some Guarding ProblemsFrank Hoffmann, Klaus Kriegel. 78-87
• The Maximum k-Dependent and f-Dependent Set ProblemAnders Dessmark, Klaus Jansen, Andrzej Lingas. 88-98
• Finding Shortest Non-Crossing Rectilinear Paths in Plane RegionsJun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki. 98-107
• Treewidth of Circle GraphsTon Kloks. 108-117
• A Framework for Constructing Heap-Like Structures In-PlaceJingsen Chen. 118-127
• Double-Ended Binomial QueuesC. M. Khoong, H. W. Leong. 128-137
• A Simple Balanced Search Tree with O(1) Worst-Case Update TimeRudolf Fleischer. 138-146
• Mapping Dynamic Data and Algorithm Structures into Product NetworksSabine R. Öhring, Sajal K. Das. 147-156
• Permutation Routing on Reconfigurable MeshesJ. C. Cogolludo, Sanguthevar Rajasekaran. 157-166
• Adaptive and Oblivious Algorithms for D-Cube Permutation RoutingMiltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang. 167-175
• On Quadratic Lattice ApproximationsAnand Srivastav, Peter Stangier. 176-184
• A 2or3-Approximation of the Matroid Matching ProblemToshihiro Fujito. 185-190
• Using Fractal Geometry for Solving Divide-and-Conquer RecurrencesSimant Dube. 191-200
• Simple Combinatorial Gray Codes Constructed by Reversing SublistsFrank Ruskey. 201-208
• Time Space Tradeoffs (Getting Closer to the Barrier?)Allan Borodin. 209-220
• Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFAHing Leung. 221-229
• Threshold Computation and Cryptographic SecurityYenjo Han, Lane A. Hemaspaandra, Thomas Thierauf. 230-239
• On the Power of Reading and Writing Simultaneously in Parallel ComputationRolf Niedermeier, Peter Rossmanith. 240-249
• Relativizing Complexity Classes With Random OraclesRonald V. Book. 250-258
• An Introduction to Perpetual GossipingArthur L. Liestman, Dana S. Richards. 259-266
• A Probabilistic Selection Network with Butterfly NetworksTakahiro Ikeda. 267-276
• Optimal Group Gossiping in Hypercubes Under Wormhole Routing ModelSatoshi Fujita, Masafumi Yamashita, Tadashi Ae. 277-286
• Optimal Linear Broadcast Routing with Capacity LimitationsSara Bitan, Shmuel Zaks. 287-296
• Multicommodity Flows: A Survey of Recent ResearchBaruch Awerbuch, Frank Thomson Leighton. 297-302
• Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar GraphsXin He, Ming-Yang Kao. 303-312
• Number Theory Helps Line Detection in Digital ImagesTetsuo Asano, Naoki Katoh. 313-322
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple PolygonDanny Z. Chen. 323-332
• Multicommodity Flows in Even, Planar NetworksKarsten Weihe. 333-342
• Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar GraphsHeike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe. 343-352
• Robot Mapping: Foot-Prints versus TokensXiaotie Deng, Andy Mirzaian. 353-362
• Recent Developments on the Approximability of Combinatorial ProblemsMihalis Yannakakis. 363-368
• On the Relationship among Cryptographic Physical AssumptionsTatsuaki Okamoto. 369-378
• Separating Complexity Classes Related to Bounded Alternating omega-Branching ProgramsChristoph Meinel, Stephan Waack. 379-388
• The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision DiagramsSeiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima. 389-398
• On Horn Envelopes and Hypergraph TransversalsDimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri. 399-405
• Page Migration Algorithms Using Work FunctionsMarek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook. 406-415
• Memory Paging for Connectivity and Path Problems in GraphsEsteban Feuerstein, Alberto Marchetti-Spaccamela. 416-425
• Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear ListsLucas Chi Kwong Hui, Charles U. Martel. 426-435
• Randomized On-line Algorithms for the Page Replication ProblemHisashi Koga. 436-445
• New Algorithms for Minimizing the Longest Wire Length during Circuit CompactionSusanne E. Hambrusch, Hung-Yi Tu. 446-455
• Parallel Algorithms for Single-Layer Channel RoutingRonald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih. 456-465
• Consecutive Interval Query and Dynamic Programming on IntervalsAlok Aggarwal, Takeshi Tokuyama. 466-475
• An Improved Algorithm for the Traveler s ProblemAlok Aggarwal, Takeshi Tokuyama. 476-485
• Vehicle Scheduling on a Tree with Release and Handling TimesYoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki. 486-495
• Scheduling Algorithms for a Chain-like Task SystemChi-lok Chan, Gilbert H. Young. 496-505
• Weighted Independent Perfect Domination on Cocomparability GraphsGerard J. Chang, C. Pandu Rangan, Satyan R. Coorg. 506-514
• Plane Sweep Algorithms for the Polygonal Approximation Problems with ApplicationsD. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee. 515-522
• Optimal Rectilinear Steiner Tree for Extremal Point SetsSiu-Wing Cheng, Andrew Lim, Ching-Ting Wu. 523-532
• Faster Approximation Algorithms for the Rectilinear Steiner Tree ProblemUlrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky. 533-542