{"entities":{"Q5943779":{"pageid":8120581,"ns":120,"title":"Item:Q5943779","lastrevid":31241165,"modified":"2024-03-19T17:05:40Z","type":"item","id":"Q5943779","labels":{"en":{"language":"en","value":"Computing and combinatorics. 7th annual international conference, COCOON 2001, Guilin, China, August 20--23, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648182"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943779$572FF1B0-D180-4DC7-949E-9E20143C50CA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"15b59d2498020647d8aa335767850c43634a52ce","datavalue":{"value":{"text":"Computing and combinatorics. 7th annual international conference, COCOON 2001, Guilin, China, August 20--23, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5943779$C11FBEA4-6989-4D18-9BF6-6F3D012EB52E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f0007ac4475262ccaa8ae6309cebc62f8d7f8d02","datavalue":{"value":"0969.00080","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$1FF5522C-DA51-4BE6-ACEA-041637992181","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8a171b6baa7539474a9998deb9707e82806acc31","datavalue":{"value":"10.1007/3-540-44679-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$54490CF8-65FF-4CDE-94F9-859BE4294755","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943779$E939613B-28E3-49A2-B2D4-80D84F15AF46","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a12c476678ac830de6d391e0b3f53860587b6e09","datavalue":{"value":{"time":"+2001-09-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5943779$1262910D-0A68-4506-B1C6-D2AF70DF42C3","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9b90ac6eab0ff11ff4b55fb27da4a01a04ede471","datavalue":{"value":"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\u00e4ser, Markus}, Complete problems for Valiant's class of qp-computable families of polynomials, 1-10 [Zbl 0991.68027]  \\textit{Kouck\u00fd, 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\u011fecio\u011flu, \u00d6mer}, 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\u00e9}, 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\u00e1ndez-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\u00edaz, 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\u0105sieniec, 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\u00fchl, 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\u00f6dinger propagator, 596-599 [Zbl 0991.03055]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$B134AC22-A494-4020-B34E-3853193FE131","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$7E812D13-BCA0-452B-B790-97D79DEB481F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$E188A2B6-7D28-4ECA-8760-17CE5AF845CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c2375fd4b32d2eb23df347253ca68f523c20922c","datavalue":{"value":"05-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$834A6D6B-8734-4BD6-A813-6F971C6C53AB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"406243ce8729f38fb9f7882535ee242ef1436ad9","datavalue":{"value":"1648182","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$192FD1B3-0479-4F71-9DAE-F0621F0AEE4B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e1a71e6dc65f54d5cf5700b5deff6e2b8c1c9f85","datavalue":{"value":"Guilin (China)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$161B5139-E1B0-4C60-AB99-C2DED1B2A328","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$2C8D5A38-4B75-4520-B6A8-B038DCE9E2D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$3EA821F8-4D36-49D5-BBF5-51FD9339D112","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa3232be4f04554257b9794f8750c32f9cb4b1a1","datavalue":{"value":"COCOON 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$DF03D02F-6BFA-494D-B6FC-F1E341984CD0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"27f00569034f7cb0041aea0b2e07bb97e1a71a31","datavalue":{"value":"Computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$43C10021-7617-44D5-910A-8A2696E170C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d8c90dadb55fe2b5558cd95a256bf4488e2be4be","datavalue":{"value":"Combinatorics","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943779$D02B7832-614C-4E7F-B9A2-82C2E600D807","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5943779$928724F5-E868-46F5-A690-0E1A2A320946","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c7a5c7f45a95b9dae163765688f2c449b62f7d66","datavalue":{"value":"https://doi.org/10.1007/3-540-44679-6","type":"string"},"datatype":"url"},"type":"statement","id":"Q5943779$FC8D5651-4D93-4515-B322-E21D8ED5E59C","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"904fb4cb1e07218bcc6c809cca3e3a3ac43b36ce","datavalue":{"value":"W4301635203","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943779$68004CC4-7844-44A4-B0CF-23D629B604E2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5943779","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5943779"}}}}}