The papers in this volume were selected for presentation at the Fourth Annual International Computing and Combinatorics Conference (COCOON'98), held on August 12-14, 1998, in Taipei. The topics cover most aspects of theoretical computer science and combinatorics related to computing. Submissions to the conference this year was only conducted electronically. Thanks to the excellent software developed by the system team of the Institute of Information Science, we were able to make virtually all communications through the World Wide Web. A total of 69 papers was submitted in time to be considered, of which 36 papers were accepted for presentation at the conference. In addition to these contributed papers, the conference also included four invited presentations by Christo Papadimitriou, Michael Fishcher, Fan Chung Graham and Rao Kosaraju. It is expected that most of the accepted papers will appear in a more complete form in scienti?c journals. Moreover, selected papers will appear in a special issue of Theoretical Computer Science. We thank all program committee members, their support sta? and referees for excellent work within demanding time constraints. We thank all authors who submitted papers for consideration. We are especially grateful to our colleagues who worked hard and o?ered widely di?ering talents to make the conference both possible and enjoyable. August 1998 Wen-Lian Hsu and Ming-Yang Kao Program Co-chairs COCOON'98 Organization COCOON'98 is organized by the Institute of Information Science, Academia Sinica, Taipei, Taiwan, ROC and in cooperation with Institute of Information and Computing Machinery (IICM), Taiwan, ROC.

This volume presents the proceedings of the Second Annual International Symposium on Algorithms held at Academia Sinica, Taipei, Republic of China, December 16-18, 1991. The symposium was organized by the Institute of Information Science, Academia Sinica, and the National Tsing Hua University. In response to the program committee's call for papers, 90 papers were submitted, from which the committee selected 36 for presentation at the symposium. In addition to these contributed papers, the symposium included 5 invited talks. The subjects of the papers range widely in the area of discrete algorithms, over such topics as computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing and computational algebra.