4. COCOON 1998: Taipei, Taiwan

@proceedings{DBLP:conf/cocoon/1998,
  editor    = {Wen-Lian Hsu and
               Ming-Yang Kao},
  title     = {Computing and Combinatorics, 4th Annual International Conference,
               COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings},
  booktitle = {COCOON},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1449},
  year      = {1998},
  isbn      = {3-540-64824-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Presentations

• Christos H. Papadimitriou:
  Algorithmic Approaches to Information Retrieval and Data Mining (Abstract). 1
  Electronic Edition (Springer LINK) BibTeX
• Fan R. K. Chung, Ronald L. Graham:
  Combinatorial Problems Arising in Massive Data Sets (Abstract). 2
  Electronic Edition (Springer LINK) BibTeX
• Michael J. Fischer:
  Estimating Parameters of Monotone Boolean Functions (Abstract). 3
  Electronic Edition (Springer LINK) BibTeX
• S. Rao Kosaraju, Mihai Pop:
  De-amortization of Algorithms. 4-14
  Electronic Edition (Springer LINK) BibTeX

Computational Geometry

• Yang Dai, Naoki Katoh:
  On Computing New Classes of Optimal Trangulations with Angular Constraints. 15-24
  Electronic Edition (Springer LINK) BibTeX
• Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
  Maximum Weight Triangulation and Its Application on Graph Drawing. 25-34
  Electronic Edition (Springer LINK) BibTeX
• Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan:
  The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. 35-44
  Electronic Edition (Springer LINK) BibTeX
• Danny Z. Chen, Ovidiu Daescu:
  Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. 45-54
  Electronic Edition (Springer LINK) BibTeX
• Mikhail J. Atallah, Danny Z. Chen:
  Parallel Geometric Algorithms in Coarse-Grain Network Models. 55-64
  Electronic Edition (Springer LINK) BibTeX

Algorithms and Data Structures

• Rudolf Fleischer:
  On The Bahncard Problem. 65-74
  Electronic Edition (Springer LINK) BibTeX
• Alejandro López-Ortiz, Sven Schuierer:
  The Ultimate Strategy to Search on m Rays? 75-84
  Electronic Edition (Springer LINK) BibTeX
• Ming Li, Louxin Zhang:
  Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. 85-94
  Electronic Edition (Springer LINK) BibTeX
• Guoliang Xue:
  A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations. 95-104
  Electronic Edition (Springer LINK) BibTeX
• Mutsunori Yagiura, Toshihide Ibaraki:
  Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. 105-116
  Electronic Edition (Springer LINK) BibTeX
• Ömer Egecioglu, Marcus Peinado:
  Algorithms for Almost-uniform Generation with an Unbiased Binary Source. 117-126
  Electronic Edition (Springer LINK) BibTeX
• Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
  Improved Algorithms for Chemical Threshold Testing Problems. 127-136
  Electronic Edition (Springer LINK) BibTeX
• Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
  Min-Max-Boundary Domain Decomposition. 137-146
  Electronic Edition (Springer LINK) BibTeX

Computational Complexity

• Steffen Reith, Klaus W. Wagner:
  On Boolean Lowness and Boolean Highness. 147-156
  Electronic Edition (Springer LINK) BibTeX
• Ulrich Hertrampf:
  The Inherent Dimension of Bounded Counting Classes. 157-166
  Electronic Edition (Springer LINK) BibTeX
• Chi-Jen Lu:
  An Exact Characterization of Symmetric Functions in qAC⁰[2]. 167-173
  Electronic Edition (Springer LINK) BibTeX
• Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
  Robust Reductions. 174-183
  Electronic Edition (Springer LINK) BibTeX
• Vasco Brattka, Klaus Weihrauch, Xizhong Zheng:
  Approaches to Effective Semi-continuity of Real Functions. 184-193
  Electronic Edition (Springer LINK) BibTeX
• Vladimir Grebinski:
  On the Power of Additive Combinatorial Search Model. 194-203
  Electronic Edition (Springer LINK) BibTeX

Parallel and Distributed Processing, and Switching Networks

• Frank K. Hwang, Wen-Dar Lin:
  The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. 204-212
  Electronic Edition (Springer LINK) BibTeX
• Kuo-Hui Tsai, Da-Wei Wang:
  Lower Bounds for Wide-Sense Non-blocking Clos Network. 213-218
  Electronic Edition (Springer LINK) BibTeX
• Dongsoo S. Kim, Ding-Zhu Du:
  Multirate Multicast Switching Networks. 219-228
  Electronic Edition (Springer LINK) BibTeX
• Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki:
  Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. 229-240
  Electronic Edition (Springer LINK) BibTeX
• Tsan-sheng Hsu, Dian Rae Lopez:
  Executing Divisible Jobs on a Network with a Fixed Number of Processors. 241-250
  Electronic Edition (Springer LINK) BibTeX

Graph Theory

• Bernard Mans, Francesco Pappalardi, Igor Shparlinski:
  On the Ádám Conjecture on Circulant Graphs. 251-260
  Electronic Edition (Springer LINK) BibTeX
• Wenan Zang:
  Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K₄ Is 3-Colorable. 261-268
  Electronic Edition (Springer LINK) BibTeX
• Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin:
  A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. 269-278
  Electronic Edition (Springer LINK) BibTeX
• Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang:
  A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. 279-288
  Electronic Edition (Springer LINK) BibTeX
• Jie Wang, Yaorong Ge:
  A Grap Optimization Problem in Virtual Colonoscopy. 289-298
  Electronic Edition (Springer LINK) BibTeX
• Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
  Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. 299-308
  Electronic Edition (Springer LINK) BibTeX
• H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
  An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs. 309-318
  Electronic Edition (Springer LINK) BibTeX

Combinatorics and Cryptography

• Ricardo A. Baeza-Yates:
  Similarity in Two-Dimensional Strings. 319-328
  Electronic Edition (Springer LINK) BibTeX
• Jochen Alber, Rolf Niedermeier:
  On Multi-dimensional Hilbert Indexings. 329-338
  Electronic Edition (Springer LINK) BibTeX
• Anna Bernasconi:
  Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth. 339-348
  Electronic Edition (Springer LINK) BibTeX
• Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki:
  Eulerian Secret Key Exchange. 349-360
  Electronic Edition (Springer LINK) BibTeX
• Donald Beaver:
  One-Time Tables for Two-Party Computation. 361-370
  Electronic Edition (Springer LINK) BibTeX