Algorithms and Computation: 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, Proceedings
Springer Science & Business Media, Nov 23, 1998 - Computers - 478 pages
The papers in this volume were selected for presentation at the Ninth Annual International Symposium on Algorithms and Computation (ISAAC'98), heldonDecember14-16,1998inTaejon, Korea.P- viousmeetingswereheldinTokyo(1990), Taipei(1991), Nagoya (1992), HongKong(1993), Beijing(1994), Cairns(1995), Osaka (1996), andSingapore(1997). The symposium was jointly sponsored by Korea Advanced - stitute of Science and Technology (KAIST) and Korea Information Science Society (KISS) to commemorate its 25th anniversary in - operationwithMinistryofInformationandCommunication, Korea InformationSocietyDevelopmentInstitute, andKoreaScienceand Engineering Foundation. Inresponsetothecallforpapers,102extendedabstractswere submitted from 21 countries. Each submitted paper was reported on byatleastfourprogramcommitteemembers, withtheassistance ofreferees, asindicatedbytherefereelistfoundintheseproce- ings. There were many more acceptable papers than there was space availableinthesymposiumschedule, andtheprogramcommittee's task was extremely di?cult. The 47 papers selected for presentation hadatotalof105authors, residentasfollows: Japan24, Germany 17, UnitedStateofAmerica15, Taiwan10, HongKongandKorea 6each, Spain5, SwitzerlandandAustralia4each, Austria, Canada, andFrance3each, ItalyandNetherlands2each, andGreece1. We thank all program committee members and their referees fortheirexcellentwork, especiallygiventhedemandingtimec- straints; they gave the symposium its distinctive character. We thank all who submitted papers for consideration: they all contributed to the high quality of the symposium. Finally, wethankallthepeoplewhoworkedhardtoputinplace the logistical arrangements of the symposium - our colleagues and our graduate students. It is their hard work that made the sym- sium possible and enjoyable.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
approximation algorithm assume called cell color complexity Computer Science configuration constant constraints construct convex corresponding curve data structure decomposition defined denote distance-hereditary graph dominating set edge edge-connectivity efficient embedding function given Graph Drawing graph G hamiltonian hamiltonian cycle Horn core Horn theories input integer intersection Kd-tree Lemma length linear logn lower bound matching matrix maximal maximum median minimum multigraph node NP-complete NP-hard number of vertices obtained on-line optimal orthogonal orthogonal drawing pair pallet paper pattern planar graphs polyhedron polynomial polytope probability problem Proc processors proof system protocol query random ratio recursive resp result result-correctness root satisfies schedule Section semidefinite program sequence shortest path solution solved source points spanning tree spike stack-up Steiner points sub-cut subgraph subset subtree terminal Theorem trapezoid graphs triangulation two-layer planar variable vector vertex visibility polygon Voronoi diagram zero-knowledge zero-knowledge proof