{"entities":{"Q1572747":{"pageid":1583487,"ns":120,"title":"Item:Q1572747","lastrevid":71327058,"modified":"2026-04-13T21:28:59Z","type":"item","id":"Q1572747","labels":{"en":{"language":"en","value":"Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26--28, 2000. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1482091"}},"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":"Q1572747$26D859AB-9231-49CC-8388-9059C40E7A32","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b341836f46748608f9b148669218b2b3cb9b0263","datavalue":{"value":{"text":"Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26--28, 2000. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1572747$BB96351F-E08B-4199-B380-68BEEE92D843","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b55880f70b25f86d754c85aa5eea6bbe4d1401d2","datavalue":{"value":"0941.00031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1572747$3F8E901B-717C-48C0-8DF2-6D3D67067CD8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"abb85f45a6e93e9175e6d1063fc18e4ed1e4968b","datavalue":{"value":"10.1007/3-540-44968-X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1572747$90D3D98F-D248-404E-8A59-1138EF6D5E8E","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":"Q1572747$9A44CCE2-F870-4B89-B82C-90FECAC30267","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ff549de5c6ce5b4225ab7822aed4075af58e4092","datavalue":{"value":{"time":"+2000-07-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1572747$CCF552A3-FCAE-4C76-8E38-AE677301241E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"bf0ce2939d99f47a1eafedfb1652b248cccf7156","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. The preceding conference (5th, 1999) has been indicated (see Zbl 0918.00033).  Indexed articles:  \\textit{Papadimitriou, Christos H.}, Theoretical problems related to the Internet (extended abstract), 1-2 [Zbl 0988.68750]  \\textit{Brent, Richard P.}, Recent progress and prospects for integer factorisation algorithms, 3-22 [Zbl 0988.11056]  \\textit{Aurenhammer, Franz; Katoh, Naoki; Kojima, Hiromichi; Ohsaki, Makoto; Xu, Yinfeng}, Approximating uniform triangular meshes in polygons, 23-33 [Zbl 0988.68198]  \\textit{Duckworth, William; Wormald, Nicholas C.; Zito, Michele}, Maximum induced matchings of random cubic graphs, 34-43 [Zbl 0989.05114]  \\textit{Barequet, Gill}, A duality between small-face problems in arrangements of lines and Heilbronn-type problems, 44-53 [Zbl 0988.68201]  \\textit{Hernando, Carmen; Houle, Michael E.; Hurtado, Ferran}, On local transformation of polygons with visibility properties, 54-63 [Zbl 0988.68200]  \\textit{Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue}, Embedding problems for paths with direction constrained edges, 64-73 [Zbl 0988.68633]  \\textit{Healy, Patrick; Kuusik, Ago; Leipert, Sebastian}, Characterization of level non-planar graphs by minimal patterns, 74-84 [Zbl 0988.68631]  \\textit{Rahman, Md. Saidur; Nakano, Shin-ichi; Nishizeki, Takao}, Rectangular drawings of plane graphs without designated corners (extended abstract), 85-94 [Zbl 0988.68638]  \\textit{Mutzel, Petra; Weiskircher, Ren\u00e9}, Computing optimal embeddings for planar graphs, 95-104 [Zbl 0988.68632]  \\textit{Chen, Zhi-Zhong}, Approximation algorithms for independent sets in map graphs, 105-114 [Zbl 0989.05110]  \\textit{Chen, Zhi-Zhong; He, Xin}, Hierarchical topological inference on planar disc maps, 115-125 [Zbl 0988.68199]  \\textit{Lin, Yaw-Ling; Hsu, Fang Rong; Tsai, Yin-Te}, Efficient algorithms for the minimum connected domination of trapezoid graphs, 126-136 [Zbl 0989.05112]  \\textit{Khot, Subhash; Raman, Venkatesh}, Parameterized complexity of finding subgraphs with hereditary properties, 137-147 [Zbl 0988.68081]  \\textit{Reznik, Yuriy A.}, Some results on tries with adaptive branching, 148-158 [Zbl 0988.68056]  \\textit{Cicalese, Ferdinando; Mundici, Daniele}, Optimal coding with one asymmetric error: Below the sphere packing bound, 159-169 [Zbl 0996.94054]  \\textit{Zheng, Xizhong}, Closure properties of real number classes under limits and computable operators, 170-179 [Zbl 0988.03064]  \\textit{Dinneen, Michael J.; Xiong, Liu}, A characterization of graphs with vertex cover six, 180-192 [Zbl 0989.05109]  \\textit{Miller, Mirka; Slamin}, On the monotonicity of minimum diameter with respect to order and maximum out-degree, 193-201 [Zbl 0988.68134]  \\textit{Halld\u00f3rsson, Magn\u00fas M.; Iwama, Kazuo; Miyazaki, Shuichi; Taketomi, Shiro}, Online independent sets, 202-209 [Zbl 0988.68568]  \\textit{Fujita, Satoshi; Hada, Takeshi}, Two-dimensional on-line bin packing problem with rotatable items, 210-220 [Zbl 0988.68836]  \\textit{Bach, Eric; Boyar, Joan; Jiang, Tao; Larsen, Kim S.; Lin, Guo-Hui}, Better bounds on the accomodating ratio for the seat reservation problem (extended abstract), 221-231 [Zbl 0988.68837]  \\textit{Tan, Zhiyi; He, Yong}, Ordinal on-line scheduling on two uniform machines, 232-241 [Zbl 0988.68017]  \\textit{Ghosh, Sukumar}, Agents, distributed algorithms, and stabilization, 242-251 [Zbl 0988.68664]  \\textit{Shiau, Shyue-Horng; Yang, Chang-Biau}, A fast sorting algorithm and its generalization on broadcast communications, 252-261 [Zbl 0988.68548]  \\textit{Kim, Sung-Ryul; Park, Kunsoo}, Efficient list ranking algorithms on reconfigurable mesh, 262-271 [Zbl 0988.68692]  \\textit{Tiskin, Alexandre}, Tripoids do not pack densely, 272-280 [Zbl 0988.68636]  \\textit{Nandy, Subhas C.}, An efficient \\(k\\) nearest neighbor searching algorithm for a query line, 281-290 [Zbl 0988.68549]  \\textit{Wang, Cao An; Yang, Boting}, Tetrahedralization of two nested convex polyhedra, 291-298 [Zbl 0988.68635]  \\textit{Kim, Sung Kwon; Shin, Chan-Su}, Efficient algorithms for two-center problems for a convex polygon (extended abstract), 299-309 [Zbl 0988.68637]  \\textit{Deng, Xiaotie; Li, Zhongfei; Wang, Shouyang}, On computation of arbitrage for markets with friction, 310-319 [Zbl 1087.91508]  \\textit{Qin, Zhongping; Xu, Yinfeng; Zhu, Binhai}, On some optimization problems in obnoxious facility location, 320-329 [Zbl 1039.90037]  \\textit{Ruskey, Frank; Sawada, Joe}, Generating necklaces and strings with forbidden substrings, 330-339 [Zbl 0988.68570]  \\textit{Klau, Gunnar W.; Mutzel, Petra}, Optimal labelling of point features in the slider model (extended abstract), 340-350 [Zbl 0988.68634]  \\textit{Bertossi, Alan A.; Pinotti, M. Cristina}, Mappings for conflict-free access of paths in elementary data structures, 351-361 [Zbl 0988.68546]  \\textit{Takaoka, Tadao}, Theory of trinomial heaps, 362-372 [Zbl 0988.68547]  \\textit{Oswald, Marcus; Reinelt, Gerhard}, Polyhedral aspects of the consecutive ones problem, 373-382 [Zbl 1039.90041]  \\textit{Weis, Stephan; Reischuk, R\u00fcdiger}, The complexity of physical mapping with strict chimerism, 383-395 [Zbl 0994.68072]  \\textit{Ono, Hirotaka; Makino, Kazuhisa; Ibaraki, Toshihide}, Logical analysis of data with decomposable structures, 396-406 [Zbl 0988.68545]  \\textit{Cheung H. C., Shirley}, Learning from approximate data, 407-415 [Zbl 0988.68553]  \\textit{Safavi-Naini, Reihaneh; Wang, Yejing}, A combinatorial approach to asymmetric traitor tracing, 416-425 [Zbl 0995.94526]  \\textit{Di Crescenzo, Giovanni}, Removing complexity assumptions from concurrent zero-knowledge proofs (extended abstract), 426-435 [Zbl 0994.94520]  \\textit{Yamasaki, Tomohiro; Kobayashi, Hirotada; Tokunaga, Yuuki; Imai, Hiroshi}, One-way probabilistic reversible and quantum one-counter automata, 436-446 [Zbl 0988.68098]  \\textit{Jiang, Zhuhan; Litow, Bruce; de Vel, Olivier}, Similarity enrichment in image compression through weighted finite automata, 447-456 [Zbl 0988.68639]  \\textit{Yamamoto, Hiroaki}, On the power of input-synchronized alternating finite automata, 457-466 [Zbl 0988.68097]  \\textit{Nakanishi, Masaki; Hamaguchi, Kiyoharu; Kashiwabara, Toshinobu}, Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction, 467-476 [Zbl 0988.68071]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$B609F291-0433-4159-95C4-1F53F7FE874C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1572747$10DB3CF1-69DE-4901-B01A-6197FD2938FD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1572747$5058BC47-D766-46DA-9751-CBFB5848F157","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c2375fd4b32d2eb23df347253ca68f523c20922c","datavalue":{"value":"05-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1572747$837B7EEB-20C4-4A5E-9E59-829785E768E8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d44dc5ff61138c2187d35419b6188653d030c26b","datavalue":{"value":"1482091","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1572747$DA7A02DC-7212-43CB-8E33-FC9BD47DDC42","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6983dc3dbb00fd2cd8b6843aa10b943ad864f576","datavalue":{"value":"Sydney (Australia)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$6E03DD2C-AF6C-4221-8191-EEBE933AE108","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$8C676CA7-9041-46A4-82DA-5D00E9E3F845","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$14C51E52-BB5C-4C76-98BF-75C10F26A2C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cf06df5e976118a640d51dc53e659aae49056ad6","datavalue":{"value":"COCOON 2000","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$09972C64-88A7-4145-BE48-F31AA90946B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"27f00569034f7cb0041aea0b2e07bb97e1a71a31","datavalue":{"value":"Computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$DB605D63-20BF-4FAC-97C4-1E2F6D8D5F1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d8c90dadb55fe2b5558cd95a256bf4488e2be4be","datavalue":{"value":"Combinatorics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1572747$355303C6-1E7D-4B55-85C2-BA20FCE867D2","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":"Q1572747$DBB507AC-A0D0-462F-98FB-357F98DAB657","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26--28, 2000. Proceedings","badges":[]}}}}}