Computing and combinatorics. 7th annual international conference, COCOON 2001, Guilin, China, August 20--23, 2001. Proceedings (Q5943779)

The articles of mathematical interest will be reviewed individually. The preceding conference (6th, 2000) has been reviewed (see Zbl 0941.00031). Indexed articles: \textit{Bläser, Markus}, Complete problems for Valiant's class of qp-computable families of polynomials, 1-10 [Zbl 0991.68027] \textit{Koucký, Michal}, Log-space constructible universal traversal sequences for cycles of length \(O(n^{4. 03})\). (Extended abstract), 11-20 [Zbl 0991.68524] \textit{Tran, Nicholas}, On universally polynomial context-free languages, 21-27 [Zbl 0991.68038] \textit{Iwama, Kazuo; Okabe, Yasuo; Takase, Toshiro}, Separating oblivious and non-oblivious BPs, 28-38 [Zbl 0991.68029] \textit{Stewart, Iain A.}, Program schemes, queues, the recursive spectrum and zero-one laws, 39-48 [Zbl 0991.68030] \textit{Hemaspaandra, Lane A.; Hempel, Harald; Nickelsen, Arfst}, Algebraic properties for P-selectivity, 49-58 [Zbl 0991.68026] \textit{Castanho, Carla Denise; Chen, Wei; Wada, Koichi; Fujiwara, Akihiro}, Parallelizability of some P-complete geometric problems in the EREW-PRAM, 59-63 [Zbl 0991.68031] \textit{Heath, Samuel A.; Preparata, Franco P.}, Enhanced sequence reconstruction with DNA microarray application. (Extended abstract), 64-74 [Zbl 0993.92016] \textit{Siebert, Bodo}, Non-approximability of weighted multiple sequence alignment, 75-85 [Zbl 0991.68028] \textit{Wu, Shiquan; Gu, Xun}, A greedy algorithm for optimal recombination, 86-90 [Zbl 1003.68119] \textit{Li, Xiang-Yang}, Generating well-shaped \(d\)-dimensional Delaunay meshes, 91-100 [Zbl 0991.68113] \textit{Aichholzer, Oswin; Aurenhammer, Franz; Krasser, Hannes; Hurtado, Ferran}, Towards compatible triangulations, 101-110 [Zbl 0991.68115] \textit{Arslan, Abdullah N.; Eğecioğlu, Ömer}, An improved upper bound on the size of planar convex-hulls, 111-120 [Zbl 0991.68110] \textit{Bespamyatnikh, Sergei; Chen, Zhixiang; Wang, Kanliang; Zhu, Binhai}, On the planar two-watchtower problem, 121-130 [Zbl 0991.68114] \textit{Nakano, Shin-ichi}, Efficient generation of triconnected plane triangulations, 131-141 [Zbl 0991.68586] \textit{Bose, Prosenjit; Morin, Pat; Vigneron, Antoine}, Packing two disks into a polygonal environment, 142-149 [Zbl 0991.68587] \textit{Chen, Danny Z.; Hu, Xiaobo; Wu, Xiaodong}, Maximum red/blue interval matching with applications, 150-158 [Zbl 0996.68864] \textit{Cheong, Otfried; Shin, Chan-Su; Vigneron, Antoine}, Computing farthest neighbors on a convex polytope, 159-169 [Zbl 0991.68111] \textit{Tan, Xuehou}, Finding an optimal bridge between two polygons, 170-180 [Zbl 0991.68112] \textit{Li, Xiang-Yang; Wang, Yu}, How good is sink insertion?, 181-190 [Zbl 0996.68552] \textit{Duncan, Rob; Qian, Jianbo; Zhu, Binhai}, Polynomial time algorithms for three-label point labeling, 191-200 [Zbl 0991.68588] \textit{Tan, Xuehou}, Approximation algorithms for the watchman route and zookeeper's problems, 201-206 [Zbl 0991.68585] \textit{Hsu, Wen-Lian}, \(PC\)-trees vs. \(PQ\)-trees, 207-217 [Zbl 0996.68507] \textit{Petersen, Holger}, Stacks versus deques, 218-227 [Zbl 0991.68514] \textit{Dai, H. K.}, Optimizing a computational method for length lower bounds for reflecting sequences, 228-236 [Zbl 0991.68515] \textit{Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Golin, Mordecai; van Oostrum, René}, Competitive facility location along a highway, 237-246 [Zbl 0998.91009] \textit{Fang, Qizhi; Zhu, Shanfeng; Cai, Maocheng; Deng, Xiaotie}, Membership for core of LP games and other games, 247-256 [Zbl 1007.91007] \textit{Caballero-Gil, Pino; Hernández-Goya, Candelaria}, Strong solutions to the identification problem, 257-261 [Zbl 1004.94545] \textit{Kim, Hyun-Sung; Yoo, Kee-Young}, Area efficient exponentiation using modular multiplier/squarer in \(\text{GF}(2^m)\), 262-267 [Zbl 1005.94543] \textit{King, Valerie; Thorup, Mikkel}, A space saving trick for directed dynamic transitive closure and shortest path algorithms, 268-277 [Zbl 0996.68526] \textit{Nardelli, Enrico; Proietti, Guido; Widmayer, Peter}, Finding the most vital node of a shortest path, 278-287 [Zbl 0993.05093] \textit{Zhou, Xiao; Nishizeki, Takao}, Algorithm for the cost edge-coloring of trees, 288-297 [Zbl 0993.05134] \textit{Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M.}, Counting \(H\)-colorings of partial \(k\)-trees, 298-307 [Zbl 0993.05135] \textit{Chandran, L. Sunil}, A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph, 308-317 [Zbl 0993.05136] \textit{Alber, Jochen; Fernau, Henning; Niedermeier, Rolf}, Graph separators: A parameterized view, 318-327 [Zbl 0991.68053] \textit{Narayanaswamy, N. S.; Madhavan, C. E. Veni}, On assigning prefix free codes to the vertices of a graph, 328-337 [Zbl 0991.68054] \textit{Lu, Chin Lung; Su, Zheng-Yao; Tang, Chuan Yi}, A new measure of edit distance between labeled trees, 338-348 [Zbl 0993.92014] \textit{Lou, Dingjun; Zhong, Ning}, A highly efficient algorithm to determine bicritical graphs, 349-356 [Zbl 0993.05133] \textit{Finocchi, Irene}, Layered drawings of graphs with crossing constraints, 357-367 [Zbl 0991.68558] \textit{Finocchi, Irene; Petreschi, Rossella}, On the validity of hierarchical decompositions, 368-374 [Zbl 0991.68055] \textit{Kang, Liying; Qiao, Hong; Shan, Erfang; Du, Ding-Zhu}, Lower bounds on the minus domination and \(k\)-subdomination numbers, 375-383 [Zbl 0993.05107] \textit{Chandran, L. Sunil}, Edge connectivity vs vertex connectivity in chordal graphs, 384-389 [Zbl 0993.05095] \textit{Sung, Ting-Yi; Wang, Jeng-Jung}, Changing the diameter of graph products, 390-394 [Zbl 0993.05062] \textit{Xu, Baogang}, Plane graphs with acyclic complex, 395-399 [Zbl 0997.05070] \textit{Kikuchi, Yosuke; Shibata, Yukio}, On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (extended abstract), 400-408 [Zbl 0997.05071] \textit{Dawande, Milind}, A notion of cross-perfect bipartite graphs, 409-413 [Zbl 0993.05110] \textit{Feng, Haodi}, Some results on orthogonal factorizations, 414-419 [Zbl 0997.05079] \textit{Cohen, Myra B.; Colbourn, Charles J.; Froncek, Dalibor}, Cluttered orderings for the complete graph, 420-431 [Zbl 0991.68557] \textit{Chan, Wun-Tat; Lam, Tak-Wah; Ting, Hing-Fung; Wong, Wai-Ha}, Improved on-line stream merging: From a restricted to a general setting, 432-442 [Zbl 0996.68502] \textit{Kim, Jae-Hoon; Chwa, Kyung-Yong}, On-line deadline scheduling on multiple resources, 443-452 [Zbl 0991.68008] \textit{Chang, Ee-Chien; Yap, Chee}, Competitive online scheduling with level of service. (Extended abstract), 453-462 [Zbl 0991.68506] \textit{Epstein, Leah}, On-line variable sized covering, 463-472 [Zbl 0996.68865] \textit{Cai, Jin-Yi; Bach, Eric}, On testing for zero polynomials by a set of points with bounded precision, 473-482 [Zbl 0991.68156] \textit{Chrobak, Marek; Gąsieniec, Leszek; Rytter, Wojciech}, A randomized algorithm for gossiping in radio networks, 483-492 [Zbl 0991.68740] \textit{Okamoto, Kyoichi; Watanabe, Osamu}, Deterministic application of Grover's quantum search algorithm, 493-501 [Zbl 0991.68516] \textit{Motoki, Mitsuo}, Random instance generation for MAX 3SAT. (Extended abstract), 502-508 [Zbl 0991.68741] \textit{Du, Dingzhu; Wang, Lusheng; Xu, Baogang}, The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points, 509-518 [Zbl 0991.68157] \textit{Chen, Guangting; Xue, Guoliang}, An FPTAS for weight-constrained Steiner trees in series-parallel graphs, 519-528 [Zbl 0991.68743] \textit{Dang, Zhe; Ibarra, Oscar H.; Kemmerer, Richard A.}, Decidable approximations on generalized and parameterized discrete timed automata, 529-539 [Zbl 0996.68088] \textit{Chen, Zhixiang}, Multiplicative adaptive algorithms for user preference retrieval, 540-549 [Zbl 0991.68518] \textit{Subramani, K.}, Parametric scheduling for network constraints, 550-560 [Zbl 0996.68503] \textit{Su, Kaile; Luo, Xudong; Wang, Huaiqing; Zhang, Chengqi; Zhang, Shichao}, A logical framework for knowledge sharing in multi-agent systems, 561-570 [Zbl 0991.68090] \textit{Obokata, Kumiko; Omori, Michiko; Motegi, Kazuhiro; Igarashi, Yoshihide}, A lockout avoidance algorithm without using time-stamps for the \(k\)-exclusion problem, 571-575 [Zbl 0991.68512] \textit{Wu, Guohua}, Prefix-free languages and initial segments of computably enumerable degrees, 576-585 [Zbl 0991.03042] \textit{Rettinger, Robert; Zheng, Xizhong; Gengler, Romain; von Braunmühl, Burchard}, Weakly computable real numbers and total computable real functions. (Extended abstract), 586-595 [Zbl 0991.03520] \textit{Weihrauch, Klaus; Zhong, Ning}, Turing computability of a nonlinear Schrödinger propagator, 596-599 [Zbl 0991.03055]