Algorithms and computation. 10th international symposium, ISAAC' 99, Chennai, India, December 16--18, 1999. Proceedings (Q1966845)

The articles of mathematical interest will be reviewed individually. The preceding conference (9th, 1998) has been indicated (see Zbl 0903.00074). Indexed articles: \textit{Mehlhorn, Kurt}, The engineering of some bipartite matching programs, 1-3 [Zbl 0970.68686] \textit{Georgakopoulos, G. F.; McClurkin, D. J.}, General splay: A basic theory and calculus, 4-17 [Zbl 0964.68032] \textit{Raman, Venkatesh; Srinivasa Rao, S.}, Static dictionaries supporting rank, 18-26 [Zbl 0964.68033] \textit{Damaschke, Peter}, Multiple spin-block decisions, 27-36 [Zbl 0970.68652] \textit{Sanders, Peter}, Asynchronous random polling dynamic load balancing, 37-48 [Zbl 0970.68620] \textit{Gaur, Daya Ram; Krishnamurti, Ramesh}, Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability, 49-55 [Zbl 0955.05099] \textit{Damian-Iordache, Mirela; Pemmaraju, Sriram V.}, Hardness of approximating independent domination in circle graphs, 56-69 [Zbl 0971.68068] \textit{Damian-Iordache, Mirela; Pemmaraju, Sriram V.}, Constant-factor approximation algorithms for domination problems on circle graphs, 70-82 [Zbl 0964.05050] \textit{Horiyama, Takashi; Ibaraki, Toshihide}, Ordered binary decision diagrams as knowledge-bases, 83-92 [Zbl 0964.68130] \textit{Flocchini, Paola; Prencipe, Giuseppe; Santoro, Nicola; Widmayer, Peter}, Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots, 93-102 [Zbl 0970.68700] \textit{To, Kar-Keung; Wong, Wai-Ha}, On-line load balancing of temporary tasks revisited, 103-112 [Zbl 0970.68660] \textit{Bose, Prosenjit; Morin, Pat}, Online routing in triangulations, 113-122 [Zbl 0964.68138] \textit{Arvind, V.; Subrahmanyam, K. V.; Vinodchandran, N. V.}, The query complexity of program checking by constant-depth circuits, 123-132 [Zbl 0971.68029] \textit{Iwama, Kazuo; Miyazaki, Shuichi}, Tree-like resolution is superpolynomially slower than DAG-like resolution for the pigeonhole principle, 133-142 [Zbl 0956.03050] \textit{Zhu, Binhai; Poon, C. K.}, Efficient approximation algorithms for multi-label map labeling, 143-152 [Zbl 0970.68630] \textit{Deng, Xiaotie; Poon, Chung Keung; Zhang, Yuzhong}, Approximation algorithms in batch processing, 153-162 [Zbl 0970.68619] \textit{Chang, Jou-Ming; Ho, Chin-Wen; Ko, Ming-Tat}, LexBFS-ordering in asteroidal triple-free graphs, 163-172 [Zbl 0966.05074] \textit{Hsu, F. R.; Lin, Yaw-Ling; Tsai, Yin-Te}, Parallel algorithms for shortest paths and related problems on trapezoid graphs, 173-182 [Zbl 0955.05098] \textit{Tardos, Eva}, Approximation algorithms for some clustering and classification problems, 183 [Zbl 0970.68618] \textit{Eidenbenz, Stephan}, How many people can hide in a terrain?, 184-194 [Zbl 0964.68139] \textit{Lee, Jae-Ha; Park, Chong-Dae; Chwa, Kyung-Yong}, Carrying umbrellas: An online relocation problem on graphs, 195-204 [Zbl 0964.68109] \textit{Cicerone, Serafino; Di Stefano, Gabriele; Handke, Dagmar}, Survivable networks with bounded delay: The edge failure case. (Extended abstract), 205-214 [Zbl 0964.68110] \textit{Bordim, J. L.; Cui, J.; Hayashi, Tatsuya; Nakano, K.; Olariu, S.}, Energy-efficient initialization protocols for ad-hoc radio networks, 215-224 [Zbl 0970.68631] \textit{Shibuya, Tetsuo}, Constructing the suffix tree of a tree with a large alphabet, 225-236 [Zbl 0964.68034] \textit{Takaoka, Tadao}, An \(O(1)\) time algorithm for generating multiset permutations, 237-246 [Zbl 0964.68035] \textit{Bansal, Nikhil; Raman, Venkatesh}, Upper bounds for MaxSat: Further improved, 247-258 [Zbl 0971.68069] \textit{Makino, Kazuhisa}, A linear time algorithm for recognizing regular Boolean functions, 259-268 [Zbl 0956.06005] \textit{Bose, Prosenjit; Kaklamanis, Christos; Kirousis, Lefteris M.; Kranakis, Evangelos; Krizanc, Danny; Peleg, David}, Station layouts in the presence of location constraints. (Extended abstract), 269-278 [Zbl 0970.68683] \textit{Zhang, Jianzhong; Yang, Xiaoguang; Cai, Mao-cheng}, Reverse center location problem, 279-294 [Zbl 0968.90048] \textit{Das, Abhijit; Veni Madhavan, C. E.}, Performance comparison of linear sieve and cubic sieve algorithms for discrete logarithms over prime fields, 295-306 [Zbl 1007.11081] \textit{Maheshwari, Anil; Zeh, Norbert}, External memory algorithms for outerplanar graphs, 307-316 [Zbl 0964.68111] \textit{Asano, Tetsuo; Katoh, Naoki; Kawashima, Kazuhiro}, A new approximation algorithm for the capacitated vehicle routing problem on a tree, 317-326 [Zbl 0973.90016] \textit{Janssen, Jeannette; Narayanan, Lata}, Approximation algorithms for channel assignment with constraints, 327-336 [Zbl 0963.68156] \textit{Kusakari, Yoshiyuki; Masubuchi, Daisuke; Nishizeki, Takao}, Algorithms for finding noncrossing Steiner forests in plane graphs, 337-346 [Zbl 0963.68157] \textit{Isobe, Shuji; Zhou, Xiao; Nishizeki, Takao}, A linear algorithm for finding total colorings of partial \(k\)-trees, 347-356 [Zbl 0955.05096] \textit{Sugihara, Kokichi}, Topology-oriented approach to robust geometric computation, 357-366 [Zbl 0970.68690] \textit{Vempala, Santosh; Vöcking, Berthold}, Approximating multicast congestion, 367-372 [Zbl 0973.90086] \textit{Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide}, Approximating the minimum \(k\)-way cut in a graph via minimum 3-way cuts, 373-382 [Zbl 0964.68112] \textit{Lee, Jae-Ha; Chwa, Kyung-Yong}, Online scheduling of parallel communications with individual deadlines, 383-392 [Zbl 0970.68661] \textit{Chan, Wun-Tat; Chin, Francis Y. L.; Ting, Hing-Fung}, A faster algorithm for finding disjoint paths in grids, 393-402 [Zbl 0970.68602] \textit{Agarwal, Pankaj K.; Bhattacharya, Binay K.; Sen, Sandeep}, Output-sensitive algorithms for uniform partitions of points, 403-414 [Zbl 0971.68180] \textit{Biedl, Therese C.; Demaine, Erik D.; Lazard, Sylvain; Robbins, Steven M.; Soss, Michael A.}, Convexifying monotone polygons, 415-424 [Zbl 0964.68140] \textit{Nagamochi, Hiroshi; Jordán, Tibor; Nakao, Yoshitaka; Ibaraki, Toshihide}, Bisecting two subsets in 3-connected graphs, 425-434 [Zbl 0973.05070] \textit{Bhattacharya, B. K.; Houle, M. E.}, Generalized maximum independent sets for trees in subquadratic time, 435-445 [Zbl 0966.05073]