Peter Eades – författare

This volume contains the proceedings of the Twelfth Annual International S- posiumonAlgorithmsandComputation(ISAAC2001),heldinChristchurch, NewZealand,19-21December2001. Inthepast,ithasbeenheldinTokyo(1990), Taipei(1991),Nagoya(1992),HongKong(1994),Cairnes(1995),Osaka(1996), Singapore(1997),Taejon,Korea(1998),Madras(1999),andTaipei(2000). Since thethirdinNagoya,theproceedingshavebeenpublishedinSpringer-Verlag's Lecture Notes in Computer Science series. AlthoughthesymposiumrotatesmainlyintheAsia/Paci?cregion,ther- ereeingprocesswasconductedinternationally,andresearchersgatheredfrom allovertheworld. Wereceived124submissionsfrom32countries,ofwhich 62 papers were accepted for presentation at the symposium. The papers of three invited speakers are also included. Submission was conducted electro- cally by CyberChair generously o?ered by the University of Twente. Each paper was reviewed by three or four referees with the assistance of external referees, whose names are listed overleaf. Discussions on how to select papers were also conducted electronically over more than a week. Due to the large number of submittedpapers,thereviewingprocesswasquitechallengingfortheprogram committee.There were many acceptable papers which we could not accom- date into the time frame of the three-day symposium. The best paper award was given to "Computing the Quartet Distance between Evolutionary Trees in Time 2 O(nlog n)"byGerthStoltingBrodal,RolfFagerberg,andChristianNorgaard Storm Pedersen. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. IntheeraoftheInternet,wetendtothinkwecanexchangeideaswith other researchers instantly without needing to meet. This way we tend to be isolatedunknowingly. BecauseoftheInternet,however,theneedformeeting otherpeoplefacetofaceiseverincreasing. Todoresearch,itisstillbestto seeourpeersdirectly,andgetideasfromtheveryinventers. WehopeISAAC 2001 made a good forum for researchers in algorithms and computation to meet, beingheldinNewZealand,abeautifulsmallnationof3. 8millionpeople. Itis roughlyatthecenterofthewaterhemisphere,meaningthatitisfarthestfrom therestoftheworld. Peoplecanescapefromtheirdailybusinesses,meetpeople, and refresh their thinking. We thank all the authors who submitted papers and contributed to the high quality of the symposium.We thank all the organizing committee members, programcommitteemembers,andexternalrefereeswhosacri?cedtheirtime for the symposium. We thank all the sponsors who made the symposium ?n- ciallyviable.

This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995.The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.

The papers in this volume were selected for presentation at the 6th Annual International Computing and Combinatorics Conference (COCOON2000), in Sydney, Australia from July 26 - 28, 2000. The topics cover many areas in t- oretical computer science and combinatorial optimization. There were 81 high quality papers submitted to COCOON2000. Each paper was reviewed by at least three program committee members, and the 44 papers were selected. It is expected that most of them will appear in a more complete form in scientic journals. In addition to the selected papers, the volume also contains the papers from two invited keynote speeches by Christos Papad- itriou and Richard Brent. This year the Hao Wang Award was given to honor the paper judged by the programcommittee to have the greatest merit. The recipient is \Approximating Uniform TriangularMeshes in Polygons"byFranz Aurenhammer, NaokiKatoh, Hiromichi Kojima, Makoto Ohsaki, and Yinfeng Xu. The rst Best Young - searcher paper award was given to William Duckworth for his paper \Maximum Induced Matchings of Random Cubic Graphs".We wish to thank all who have made this meeting possible: the authors for submitting papers, the program committee members and the external referees, sponsors, the local organizers, ACM SIGACT for handling electronic subm- sions,Springer-Verlagfor their support, and Debbie Hatherellfor her assistance.