Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18--20, 2000. Proceedings
The articles of mathematical interest will be reviewed individually. The preceding conference (10th, 1999) has been reviewed (see Zbl 0933.00045). Indexed articles: \textit{Boissonnat, Jean-Daniel}, Voronoi-based systems of coordinates and surface reconstruction, 1 [Zbl 1044.68857] \textit{Cai, Jin-Yi}, Essentially every unimodular matrix defines an expander, 2-22 [Zbl 1044.05507] \textit{Bose, Prosenjit; Czyzowicz, Jurek; Gąsieniec, Leszek; Kranakis, Evangelos; Krizanc, Danny; Pelc, Andrzej; Vargas Martin, Miguel}, Strategies for hotlink assignments, 23-34 [Zbl 1044.68693] \textit{Law, Ching; Leiserson, Charles E.}, A new competitive analysis of randomized caching, 35-46 [Zbl 1044.68939] \textit{Bose, Prosenjit; Brodnik, Andrej; Carlsson, Svante; Demaine, Erik D.; Fleischer, Rudolf; López-Ortiz, Alejandro; Morin, Pat; Munro, J. Ian}, Online routing in convex subdivisions, 47-59 [Zbl 1044.68692] \textit{Huang, Jingui; Chen, Jianer; Chen, Songqiao}, A simple linear-time approximation algorithm for multi-processor job scheduling on four processors, 60-71 [Zbl 1044.68521] \textit{Osogami, Takayuki; Imai, Hiroshi}, Classification of various neighborhood operations for the nurse scheduling problem, 72-83 [Zbl 1044.90509] \textit{Chen, Yuyu; Kao, Ming-Yang; Lu, Hsueh-I.}, Optimal bid sequences for multiple-object auctions with unequal budgets, 84-95 [Zbl 1044.91514] \textit{Cicalese, Ferdinando; Vaccaro, Ugo}, Coping with delays and time-outs in binary search procedures, 96-107 [Zbl 1044.68745] \textit{Chen, Zhixiang; Zhu, Binhai}, Some formal analysis of Rocchio's similarity-based relevance feedback algorithm, 108-119 [Zbl 1044.68589] \textit{Horiyama, Takashi; Ibaraki, Toshihide}, Reasoning with ordered binary decision diagrams, 120-131 [Zbl 1044.68813] \textit{Chen, Jianer; Kanj, Iyad A.}, On approximating minimum vertex cover for graphs with perfect matching, 132-143 [Zbl 1044.68694] \textit{Deng, Xiaotie; Li, Guojun; Zang, Wenan; Zhou, Yi}, A 2-approximation algorithm for path coloring on trees of rings, 144-155 [Zbl 1044.68695] \textit{Wu, Q. S.; Lu, C. L.; Lee, R. C. T.}, An approximate algorithm for the weighted Hamiltonian path completion problem on a tree, 156-167 [Zbl 1044.68137] \textit{Zhou, Xiao; Nishizeki, Takao}, Finding independent spanning trees in partial \(k\)-trees, 168-179 [Zbl 1044.68711] \textit{Niedermeier, Rolf; Rossmanith, Peter}, On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER, 180-191 [Zbl 1044.68133] \textit{Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L.}, Constructive linear time algorithms for small cutwidth and carving-width, 192-203 [Zbl 1044.68709] \textit{Asano, Takao; Halldórsson, Magnús M.; Iwama, Kazuo; Matsuda, Takeshi}, Approximation algorithms for the maximum power consumption problem on combinatorial circuits, 204-215 [Zbl 1044.68941] \textit{Kubo, Norihiro; Muramoto, Katsuhiro; Shimozono, Shinichi}, A simple and quick approximation algorithm for traveling salesman problem in the plane, 216-227 [Zbl 1044.90527] \textit{Erlebach, Thomas; Spieksma, Frits C. R.}, Simple algorithms for a weighted interval selection problem, 228-240 [Zbl 1044.68753] \textit{Lu, Chin Lung; Peng, Sheng-Lung; Tang, Chuan Yi}, Efficient minus and signed domination in graphs, 241-253 [Zbl 1044.68706] \textit{Miura, Kazuyuki; Nakano, Shin-ichi; Nishizeki, Takao}, Convex grid drawings of four-connected plane graphs, 254-265 [Zbl 1044.68707] \textit{Hong, Seok-Hee; Eades, Peter}, An algorithm for finding three dimensional symmetry in series parallel digraphs, 266-277 [Zbl 1044.68700] \textit{Katsura, Masashi; Kobayashi, Yuji; Otto, Friedrich}, Undecidability results for monoids with linear-time decidable word problems, 278-289 [Zbl 1044.03029] \textit{Yoshikawa, Reina; Guo, Shimin; Motegi, Kazuhiro; Igarashi, Yoshihide}, Secret key exchange using random deals of cards on hierarchical structures, 290-301 [Zbl 1044.94538] \textit{Lu, Chi-Jen}, Derandomizing Arthur-Merlin games under uniform assumptions, 302-312 [Zbl 1044.68060] \textit{Jackson, Bill; Jordán, Tibor}, A near optimal algorithm for vertex connectivity augmentation, 313-325 [Zbl 1044.68126] \textit{Ishii, Toshimasa; Nagamochi, Hiroshi}, Simultaneous augmentation of two graphs to an \(\ell\)-edge-connected graph and a biconnected graph, 326-337 [Zbl 1044.68701] \textit{Ito, Hiro; Ito, Motoyasu; Itatsu, Yuichiro; Uehara, Hideyuki; Yokoyama, Mitsuo}, Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets, 338-349 [Zbl 1044.68702] \textit{Chen, Jianer; Liu, Lihua; Jia, Weijia; Chen, Songqiao}, An intuitive and effective new representation for interconnection network structures, 350-361 [Zbl 1044.68505] \textit{Nakano, Koji; Olariu, Stephan}, Randomized leader election protocols in radio networks with no collision detection, 362-373 [Zbl 1044.68509] \textit{De Marco, Gianluca; Pelc, Andrzej}, Deterministic broadcasting time with partial knowledge of the network, 374-385 [Zbl 1044.68506] \textit{Poon, Chung Keung; Zhang, Pixing}, Minimizing makespan in batch machine scheduling, 386-397 [Zbl 1044.68523] \textit{Jansen, Klaus; Porkolab, Lorant}, Preemptive parallel task scheduling in \(O(n)+\text{poly}(m)\) time, 398-409 [Zbl 1044.68522] \textit{Sadakane, Kunihiko}, Compressed text databases with efficient query algorithms based on the compressed suffix array, 410-421 [Zbl 1044.68587] \textit{Wolff, Alexander; Thon, Michael; Xu, Yinfeng}, A better lower bound for two-circle point labeling, 422-431 [Zbl 1044.68867] \textit{Kim, Deok-Soo; Kim, Donguk; Sugihara, Kokichi}, Voronoi diagram of a circle set constructed from Voronoi diagram of a point set, 432-443 [Zbl 1044.68862] \textit{Bose, Prosenjit; Morin, Pat}, An improved algorithm for subdivision traversal without extra storage, 444-455 [Zbl 1044.68858] \textit{Kristiansen, Petter; Telle, Jan Arne}, Generalized \(H\)-coloring of graphs, 456-466 [Zbl 1044.68129] \textit{Wang, Biing-Feng; Lin, Jyh-Jye}, Finding a two-core of a tree in linear time, 467-478 [Zbl 1044.68710] \textit{Kao, Ming-Yang; Lam, Tak-Wah; Sung, Wing-Kin; Ting, Hing-Fung}, Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparison, 479-490 [Zbl 1044.68703] \textit{Chen, Danny Z.; Hu, Xiaobo; Xu, Jinhui}, Optimal beam penetrations in two and three dimensions, 491-502 [Zbl 1044.68860] \textit{Tan, Xuehou}, Searching a simple polygon by a \(k\)-searcher, 503-514 [Zbl 1044.68866] \textit{Park, Sang-Min; Lee, Jae-Ha; Chwa, Kyung-Yong}, Characterization of rooms searchable by two guards, 515-526 [Zbl 1044.68865] \textit{Hon, Wing-Kai; Kao, Ming-Yang; Lam, Tak-Wah}, Improved phylogeny comparisons: Non-shared edges, nearest neighbor interchanges, and subtree transfers, 527-538 [Zbl 1044.68699] \textit{Lin, Guo-Hui; Kearney, Paul E.; Jiang, Tao}, Phylogenetic \(k\)-root and Steiner \(k\)-root, 539-551 [Zbl 1044.68704] \textit{Katz, Matthew J.; Nielsen, Frank; Segal, Michael}, Maintenance of a piercing set for intervals with applications, 552-563 [Zbl 1044.68861] \textit{Chen, Danny Z.; Hu, Xiaobo S.; Wu, Xiaodong}, Optimal polygon cover problems and applications, 564-576 [Zbl 1044.68859]
scientific article; zbMATH DE number 1542814