2. ISA 1991: Taipei, Taiwan

Wen-Lian Hsu, Richard C. T. Lee (Eds.): ISA '91 Algorithms, 2nd International Sy,posium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings. Lecture Notes in Computer Science 557 Springer 1991, ISBN 3-540-54945-5 BibTeX

@proceedings{DBLP:conf/isa/1991,
  editor    = {Wen-Lian Hsu and
               Richard C. T. Lee},
  title     = {ISA '91 Algorithms, 2nd International Sy,posium on Algorithms,
               Taipei, Republic of China, December 16-18, 1991, Proceedings},
  booktitle = {ISA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {557},
  year      = {1991},
  isbn      = {3-540-54945-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Session 1: Invited Presentation

Christos H. Papadimitriou: Decision-Making with Incomplete Information. 1 BibTeX

Session 2A

D. T. Lee, Majid Sarrafzadeh: Maximum Independent Set of a Permutation Graph in k Tracks. 2-11 BibTeX
Yaw-Ling Lin, Steven Skiena: Algorithms for Square Roots of Graphs. 12-21 BibTeX

Session 2B

Satoshi Fujita, Masafumi Yamashita, Tadashi Ae: Distributed k-Mutual Exclusion Problem and k-Coteries. 22-31 BibTeX
Arvind Raghunathan, Huzur Saran: Is the Shuffle-Exchange Better Than the Butterfly? 32-41 BibTeX

Session 3: Invited Presentation

Andrew Chi-Chih Yao: Weighted Random Assignments with Application to Hashing. 42 BibTeX

Session 4A

Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers under Port and Channel Constraints. 43-51 BibTeX
Wen-Lian Hsu, Tze-Heng Ma: Substitution Decomposition on Chordal Graphs and Applications. 52-60 BibTeX
Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani: Mixed-Searching and Proper-Path-Width. 61-71 BibTeX

Session 4B

Frank Wagner, Barbara Wolfers: Short Wire Routing in Convex Grids. 72-82 BibTeX
Dorothea Wagner: A New Approach to Knock-Knee Channel Routing. 83-93 BibTeX
Tetsuo Asano, Takeshi Tokuyama: Circuit Partitioning Algorithms: Graph Model versus Geometry Model. 94-103 BibTeX

Session 5A

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami: Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. 104-115 BibTeX
T. H. Hu, Chuan Yi Tang, Richard C. T. Lee: An Average Case Analysis of Monien and Speckenmeyer's Mechanical Theorem Proving Algorithm. 116-126 BibTeX

Session 5B

Kwong-fai Chan, Tak Wah Lam: An On-Line Algorithm for Navigating in Unknown Terrain. 127-136 BibTeX
Ravi Janardan: On Maintaining the Width and Diameter of a Planar Point-Set Online. 137-149 BibTeX

Session 6: Invited Presentation

Herbert Edelsbrunner: Optimal Triangulations by Retriangulating. 150 BibTeX

Session 7A

Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink: Approximating Polygons and Subdivisions with Minimum Link Paths. 151-162 BibTeX
Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: An Incremental Algorithm for Constructing Shortest Watchman Routes. 163-175 BibTeX
H. S. Lee, Ruei-Chuan Chang: On Hitting Grid Points in a Convex Polygon with Straight Lines. 176-189 BibTeX

Session 7B

A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad: On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. 190-198 BibTeX
Takao Asano: Dynamic Programming on Intervals. 199-207 BibTeX
Wojciech Szpankowski: Combinatorial Optimization Through Order Statistics. 208-217 BibTeX

Session 8: Invited Presentation

Leonidas J. Guibas: Combinatorics and Algorithms of Geometric Arrangements. 218 BibTeX

Session 9A

Susumu Hasegawa, Hiroshi Imai, Koji Hakata: An Analysis of Randomized Shear Sort on the Mesh Computer. 219-228 BibTeX
I-Chen Wu: Efficient Parallel Divide-and-Conquer for a Class of Interconnection Topologies. 229-240 BibTeX
Mee Yee Chan, Francis Y. L. Chin, Chung Keung Poon: Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. 241-250 BibTeX

Session 9B

Rudolf Fleischer: A Tight Lower Bound for the Worst Case of Bottom-Up Heapsort. 251-262 BibTeX
Alistair Moffat, Ola Petersson: Historical Searching and Sorting. 263-272 BibTeX
Arne Andersson, Tony W. Lai: Comparison-Efficient And Write-Optimal Searching and Sorting. 273-282 BibTeX

Session 10: Invited Presentation

F. Frances Yao: Nearest Neighbors Revisited. 283 BibTeX

Session 11 A

Vladimir Estivill-Castro, Murray Sherk: Competitiveness and Response Time in On-Line Algorithms. 284-293 BibTeX
Jan-Ming Ho: A Linear Time Optimal Via Assignment Algorithm for Three-Dimensional Channel Routing. 294-307 BibTeX
Luc Longpré, Sarah Mocas: Symmetry of Information and One-Way Functions. 308-315 BibTeX

Session 11 B

Lih-Hsing Hsu, Jeng-Yan Hwang, Tung-Yang Ho, Chang-Hsiung Tsai: A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. 316-325 BibTeX
Tsan-sheng Hsu, Vijaya Ramachandran: On Finding a Smallest Augmentation to Biconnect a Graph. 326-335 BibTeX
Michael Kaufmann, Gerhard Klär: A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs. 336-348 BibTeX

Session 12 A

Hans-Peter Lenhof, Michiel H. M. Smid: An Optimal Construction Method for Generalized Convex Layers. 349-363 BibTeX
Michiel H. M. Smid: Rectangular Point Location and the Dynamic Closest Pair Problem. 364-374 BibTeX

Session 12 B

Ip-Wang Chan, Donald K. Friesen: Parallel Algorithms for Some Dominance Problems Based on a CREW PRAM. 375-384 BibTeX
Krzysztof Diks, Oscar Garrido, Andrzej Lingas: Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. 385-395 BibTeX