{"entities":{"Q2577425":{"pageid":2588168,"ns":120,"title":"Item:Q2577425","lastrevid":44390835,"modified":"2025-11-22T14:44:58Z","type":"item","id":"Q2577425","labels":{"en":{"language":"en","value":"Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16--29, 2005. Proceedings."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2239885"}},"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":"Q2577425$EFFEF6DD-1F3A-4E63-8D96-5E79412BF04A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a348cf10ccd8f1a66ef2bca84ee0b0e4854d360e","datavalue":{"value":{"text":"Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16--29, 2005. Proceedings.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2577425$9379E0D5-FEEE-411D-AE3E-F9030343FC26","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"eafffbebb62ed9dc85e491738664be65c249e00a","datavalue":{"value":"1078.68006","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$49EEFA6A-A053-482E-AF05-4F27328E60F0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ca74f22ef7044abf9085a0bd7afc2c904bca5d5b","datavalue":{"value":"10.1007/11533719","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$89A3BB86-AA4F-4AD1-A57E-86730D7B53C4","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":"Q2577425$034A044C-C944-499C-945B-AA930A38E0BD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2c0f4edc9c562d4cb5a51a0a8ec34d03b3cc044d","datavalue":{"value":{"time":"+2005-12-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2577425$CCA0C0ED-9583-4771-BDBA-D81B1485CACE","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5d2d172f44942c53729d21d830930bed60f70d5a","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1053.68004).  Indexed articles:  \\textit{Valiant, Leslie G.}, Completeness for parity problems, 1-8 [Zbl 1128.68359]  \\textit{Wu, Shiquan; Gu, Xun}, Gene network: Model, dynamics and simulation, 12-21 [Zbl 1128.92322]  \\textit{Blin, Guillaume; Rizzi, Romeo}, Conserved interval distance computation between non-trivial genomes, 22-31 [Zbl 1128.92316]  \\textit{Bereg, Sergey; Zhu, Binhai}, RNA multiple structural alignment with longest common subsequences, 32-41 [Zbl 1124.68453]  \\textit{Sagot, Marie-France; Tannier, Eric}, Perfect sorting by reversals, 42-51 [Zbl 1128.68350]  \\textit{Zheng, Chunfang; Sankoff, David}, Genome rearrangements with partially ordered chromosomes, 52-62 [Zbl 1128.92323]  \\textit{Liu, Tao; Tang, Jijun; Moret, Bernard M. E.}, Quartet-based phylogeny reconstruction from gene orders, 63-73 [Zbl 1128.92324]  \\textit{Tan, Jinsong; Chua, Kok Seng; Zhang, Louxin}, Algorithmic and complexity issues of three clustering methods in microarray data analysis, 74-83 [Zbl 1124.68377]  \\textit{Nakhleh, Luay; Ruths, Derek; Wang, Li-San}, RIATA-HGT: A fast and accurate heuristic for reconstructing horizontal gene transfer, 84-93 [Zbl 1128.92321]  \\textit{Li, Hengwu; Zhu, Daming}, A new pseudoknots folding algorithm for RNA structure prediction, 94-103 [Zbl 1128.92303]  \\textit{Cs\u0171r\u00f6s, Mikl\u00f3s; Ma, Bin}, Rapid homology search with two-stage extension and daughter seeds, 104-114 [Zbl 1128.92300]  \\textit{Berry, Vincent; Guillemot, Sylvain; Nicolas, Fran\u00e7ois; Paul, Christophe}, On the approximation of computing evolutionary trees, 115-125 [Zbl 1128.68554]  \\textit{Li, Xiang-Yang; Wan, Peng-Jun}, Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks, 126-135 [Zbl 1128.68306]  \\textit{Cai, Zhipeng; Lin, Guohui; Xue, Guoliang}, Improved approximation algorithms for the capacitated multicast routing problem, 136-145 [Zbl 1128.68555]  \\textit{Zeng, Jianyang; Hsu, Wen-Jing; Zhou, Suiping}, Construction of scale-free networks with partial information, 146-155 [Zbl 1128.68311]  \\textit{Desmedt, Yvo; Wang, Yongge; Safavi-Naini, Rei; Wang, Huaxiong}, Radio networks with reliable communication, 156-166 [Zbl 1128.68300]  \\textit{Hoefer, Martin; Krysta, Piotr}, Geometric network design with selfish agents, 167-178 [Zbl 1128.68302]  \\textit{Krysta, Piotr}, Bicriteria network design via iterative rounding, 179-187 [Zbl 1128.68305]  \\textit{Kuhn, Fabian; von Rickenbach, Pascal; Wattenhofer, Roger; Welzl, Emo; Zollinger, Aaron}, Interference in cellular networks: The minimum membership set cover problem, 188-198 [Zbl 1128.90319]  \\textit{Chen, Xujin; Hu, Xiaodong; Shuai, Tianping}, Routing and coloring for maximal number of trees, 199-209 [Zbl 1128.68399]  \\textit{Wang, WeiZhao; Li, Xiang-Yang; Sun, Zheng}, Share the multicast payment fairly, 210-219 [Zbl 1128.68310]  \\textit{Li, Jianping; Li, Kang; Law, Ken C. K.; Zhao, Hao}, On packing and coloring hyperedges in a cycle, 220-229 [Zbl 1128.90576]  \\textit{Liu, Hai; Wan, Peng-Jun; Jia, Xiaohua}, Fault-tolerant relay node placement in wireless sensor networks, 230-239 [Zbl 1128.68325]  \\textit{Ono, Hirotaka; Ng, Yen Kaow}, Best fitting fixed-length substring patterns for a set of strings, 240-250 [Zbl 1128.68365]  \\textit{Caminiti, Saverio; Petreschi, Rossella}, String coding of trees with locality and heritability, 251-262 [Zbl 1128.68397]  \\textit{Liben-Nowell, David; Vee, Erik; Zhu, An}, Finding longest increasing and common subsequences in streaming data, 263-272 [Zbl 1128.68543]  \\textit{Na, Joong Chae; Giancarlo, Raffaele; Park, Kunsoo}, \\(O ( n^{2} \\log n )\\) time on-line construction of two-dimensional suffix trees, 273-282 [Zbl 1128.68347]  \\textit{Li, Minming; Liu, Becky Jie; Yao, Frances F.}, Min-energy voltage allocation for tree-structured tasks, 283-296 [Zbl 1128.68337]  \\textit{Tan, Zhiyi; He, Yong}, Semi-online problems on identical machines with inexact partial information, 297-307 [Zbl 1128.68342]  \\textit{Baille, Fabien; Bampis, Evripidis; Laforest, Christian; Thibault, Nicolas}, On-line simultaneous maximization of the size and the weight for degradable intervals schedules, 308-317 [Zbl 1128.68326]  \\textit{Chan, Wun-Tat; Chin, Francis Y. L.; Zhang, Yong; Zhu, Hong; Shen, Hong; Wong, Prudence W. H.}, Off-line algorithms for minimizing total flow time in broadcast scheduling, 318-328 [Zbl 1128.68329]  \\textit{Chung, Fan; Graham, Ron; Mao, Jia; Yao, Andrew}, Oblivious and adaptive strategies for the majority and plurality problems, 329-338 [Zbl 1124.68395]  \\textit{Cai, Jin-Yi; Chakaravarthy, Venkatesan T.}, A note on zero error algorithms having oracle access to one NP query, 339-348 [Zbl 1128.68358]  \\textit{Ko, Ker-I; Yu, Fuxiang}, On the complexity of computing the logarithm and square root functions on a complex domain, 349-358 [Zbl 1128.68364]  \\textit{Rettinger, Robert; Zheng, Xizhong}, Solovay reducibility on d-c.e. real numbers, 359-368 [Zbl 1128.03307]  \\textit{Martinez, F\u00e1bio Viduani; Coelho de Pina, Jos\u00e9; Soares, Jos\u00e9}, Algorithms for terminal Steiner trees, 369-379 [Zbl 1128.68557]  \\textit{Chalermsook, Parinya; Fakcharoenphol, Jittat}, Simple distributed algorithms for approximating minimum Steiner trees, 380-389 [Zbl 1128.68550]  \\textit{Gual\u00e0, Luciano; Proietti, Guido}, A truthful \\((2 -2/k\\))-approximation mechanism for the Steiner tree problem with \\(k\\) terminals, 390-400 [Zbl 1128.68556]  \\textit{Bachmaier, Christian; Fischer, Florian; Forster, Michael}, Radial coordinate assignment for level graphs, 401-410 [Zbl 1128.68395]  \\textit{Yang, Guowu; Song, Xiaoyu; Yang, Hannah H.; Xie, Fei}, A theoretical upper bound for IP-based floorplanning, 411-419 [Zbl 1128.68394]  \\textit{Hallgren, Sean; Russell, Alexander; Shparlinski, Igor E.}, Quantum noisy rational function reconstruction, 420-429 [Zbl 1128.68559]  \\textit{Zhang, Shengyu}, Promised and distributed quantum search, 430-439 [Zbl 1128.68352]  \\textit{Viger, Fabien; Latapy, Matthieu}, Efficient and simple generation of random simple connected graphs with prescribed degree sequence, 440-449 [Zbl 1128.05312]  \\textit{List, Beatrice; Maucher, Markus; Sch\u00f6ning, Uwe; Schuler, Rainer}, Randomized Quicksort and the entropy of the random source, 450-460 [Zbl 1128.68349]  \\textit{Sankowski, Piotr}, Subquadratic algorithm for dynamic shortest distances. Extended abstract, 461-470 [Zbl 1128.68553]  \\textit{Ding, Q.; Qian, J.; Tsang, W.; Wang, C.}, Randomly generating triangulations of a simple polygon, 471-480 [Zbl 1128.68518]  \\textit{Xu, Yinfeng; Dai, Wenqiang; Katoh, Naoki; Ohsaki, Makoto}, Triangulating a convex polygon with small number of non-standard bars. Extended abstract, 481-489 [Zbl 1128.68524]  \\textit{Chen, Zhixiang; Fu, Bin; Tang, Yong; Zhu, Binhai}, A PTAS for a disc covering problem using width-bounded separators, 490-503 [Zbl 1128.68517]  \\textit{Wu, Xiaodong}, Efficient algorithms for intensity map splitting problems in radiation therapy, 504-513 [Zbl 1128.92312]  \\textit{Lefmann, Hanno}, Distributions of points in \\(d\\) dimensions and large \\(k\\)-point simplices. Extended abstract, 514-523 [Zbl 1128.68519]  \\textit{Icking, Christian; Kamphans, Tom; Klein, Rolf; Langetepe, Elmar}, Exploring simple grid polygons, 524-533 [Zbl 1128.68504]  \\textit{Tan, Xuehou}, Approximation algorithms for cutting out polygons with lines and rays, 534-543 [Zbl 1128.68523]  \\textit{Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel}, Efficient non-intersection queries on aggregated geometric data, 544-553 [Zbl 1128.68346]  \\textit{Ackerman, Eyal; Barequet, Gill; Pinter, Ron Y.}, An upper bound on the number of rectangulations of a point set, 554-559 [Zbl 1128.68516]  \\textit{Poon, Chung Keung; Yiu, Wai Keung}, Opportunistic data structures for range queries, 560-569 [Zbl 1128.68348]  \\textit{Ruskey, Frank; Williams, Aaron}, Generating combinations by prefix shifts, 570-576 [Zbl 1128.68393]  \\textit{Braeken, An; Nikov, Ventzislav; Nikova, Svetla}, Error-set codes and related objects, 577-585 [Zbl 1128.94307]  \\textit{Deng, Xiaotie; Huang, Li-Sha; Li, Minming}, On Walrasian price of CPU time. Extended abstract, 586-595 [Zbl 1128.91331]  \\textit{Angelopoulos, Spyros; Sarma, Atish Das; Magen, Avner; Viglas, Anastasios}, On-line algorithms for market equilibria, 596-607 [Zbl 1128.91318]  \\textit{Kothari, Anshul; Suri, Subhash; Zhou, Yunhong}, Interval subset sum and uniform-price auction clearing, 608-620 [Zbl 1128.91321]  \\textit{Bae, Sung E.; Takaoka, Tadao}, Improved algorithms for the \\(k\\)-maximum subarray problem for small \\(k\\), 621-631 [Zbl 1128.68563]  \\textit{Chaudhuri, Kamalika; Kothari, Anshul; Pendavingh, Rudi; Swaminathan, Ram; Tarjan, Robert; Zhou, Yunhong}, Server allocation algorithms for tiered systems, 632-643 [Zbl 1128.68539]  \\textit{Xu, Guang; Xu, Jinhui}, An improved approximation algorithm for uncapacitated facility location problem with penalties, 644-653 [Zbl 1128.90554]  \\textit{Chrobak, Marek; Kenyon, Claire; Young, Neal E.}, The reverse greedy algorithm for the metric \\(K\\)-median problem, 654-660 [Zbl 1128.90549]  \\textit{Ma, Guoxuan; Peng, Jiming; Wei, Yu}, On approximate balanced bi-clustering, 661-670 [Zbl 1128.90564]  \\textit{Wang, Tao-Ming}, Toroidal grids are anti-magic, 671-679 [Zbl 1128.05311]  \\textit{Chen, Xiaomin; Szegedy, Mario; Wang, Lei}, Optimally balanced forward degree sequence, 680-689 [Zbl 1128.05302]  \\textit{Dubey, Chandan K.; Mehta, Shashank K.; Deogun, Jitender S.}, Conditionally critical indecomposable graphs, 690-700 [Zbl 1128.05307]  \\textit{Cardinal, Jean; Labb\u00e9, Martine; Langerman, Stefan; Levy, Eythan; M\u00e9lot, Hadrien}, A tight analysis of the maximal matching heuristic, 701-709 [Zbl 1128.68398]  \\textit{Jowhari, Hossein; Ghodsi, Mohammad}, New streaming algorithms for counting triangles in graphs, 710-716 [Zbl 1128.05317]  \\textit{Suters, W. Henry; Abu-Khzam, Faisal N.; Zhang, Yun; Symons, Christopher T.; Samatova, Nagiza F.; Langston, Michael A.}, A new approach and faster exact methods for the maximum common subgraph problem, 717-727 [Zbl 1128.05308]  \\textit{Allulli, Luca; Ausiello, Giorgio; Laura, Luigi}, On the power of lookahead in on-line vehicle routing problems, 728-736 [Zbl 1128.90574]  \\textit{Misio\u0142ek, Ewa; Chen, Danny Z.}, Efficient algorithms for simplifying flow networks, 737-746 [Zbl 1128.90578]  \\textit{Fukunaga, Takuro; Nagamochi, Hiroshi}, Approximation algorithms for the \\(b\\)-edge dominating set problem and its related problems, 747-756 [Zbl 1128.90575]  \\textit{Dom, Michael; Guo, Jiong; Niedermeier, Rolf}, Bounded degree closest \\(k\\)-tree power is NP-complete, 757-766 [Zbl 1128.68363]  \\textit{Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir}, A new algorithm for the hypergraph transversal problem, 767-776 [Zbl 1128.05306]  \\textit{G\u00f3mez, Domingo; Gutierrez, Jaime; Ibeas, \u00c1lvar; Mart\u00ednez, Carmen; Beivide, Ram\u00f3n}, On finding a shortest path in circulant graphs with two jumps, 777-786 [Zbl 1128.05305]  \\textit{Hsu, Wen-Lian}, A linear time algorithm for finding a maximal planar subgraph based on PC-trees, 787-797 [Zbl 1128.05315]  \\textit{Ito, Takehiro; Kato, Akira; Zhou, Xiao; Nishizeki, Takao}, Algorithms for finding distance-edge-Colorings of graphs, 798-807 [Zbl 1128.05316]  \\textit{Chang, Maw-Shang; Kloks, Ton; Kratsch, Dieter; Liu, Jiping; Peng, Sheng-Lung}, On the recognition of probe graphs of some self-complementary classes of perfect graphs, 808-817 [Zbl 1128.05313]  \\textit{Liao, Chung-Shou; Lee, Der-Tsai}, Power domination problem in graphs, 818-828 [Zbl 1128.90577]  \\textit{Bazgan, Cristina; Tuza, Zsolt; Vanderpooten, Daniel}, Complexity and approximation of satisfactory partition problems, 829-838 [Zbl 1128.68396]  \\textit{Grandoni, Fabrizio; K\u00f6nemann, Jochen; Panconesi, Alessandro}, Distributed weighted vertex cover via maximal matchings, 839-848 [Zbl 1128.68401]  \\textit{K\u00e1ra, Jan; Kratochv\u00edl, Jan; Wood, David R.}, On the complexity of the balanced vertex ordering problem, 849-858 [Zbl 1128.68402]  \\textit{Dehne, Frank; Fellows, Michael; Langston, Michael A.; Rosamond, Frances; Stevens, Kim}, An \\(O (2^{ O (k)}n^{3})\\) FPT algorithm for the undirected feedback vertex set problem, 859-869 [Zbl 1128.68400]  \\textit{Chen, Guantao; Gao, Zhicheng; Yu, Xingxing; Zang, Wenan}, Approximating the longest cycle problem on graphs with bounded degree, 870-884 [Zbl 1128.05303]  \\textit{He, Yong; D\u00f3sa, Gy\u00f6rgy}, Bin packing and covering problems with rejection, 885-894 [Zbl 1128.90568]  \\textit{Hemaspaandra, Lane A.; Thakur, Mayur}, Query-monotonic Turing reductions, 895-904 [Zbl 1123.68333]  \\textit{Ibarra, Oscar H.; Woodworth, Sara; Yen, Hsu-Chun; Dang, Zhe}, On sequential and 1-deterministic P systems, 905-914 [Zbl 1128.68357]  \\textit{Huang, Xiaofei}, Global optimality conditions and near-perfect optimization in coding, 915-924 [Zbl 1128.90565]  \\textit{Kutz, Martin; P\u00f3r, Attila}, Angel, devil, and king, 925-934 [Zbl 1128.91312]  \\textit{Cicalese, Ferdinando; Damaschke, Peter; Tansini, Libertad; Werth, S\u00f6ren}, Overlaps help: Improved bounds for group testing with interval queries, 935-944 [Zbl 1116.68673]  \\textit{Yoon, Eun-Jun; Yoo, Kee-Young}, New efficient simple authenticated key agreement protocol, 945-954 [Zbl 1128.94303]  \\textit{Chen, Zhixiang; Fu, Bin}, A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm, 955-964 [Zbl 1128.68354]  \\textit{B\u00f6cker, Sebastian; Lipt\u00e1k, Zsuzsanna}, The money changing problem revisited: computing the Frobenius number in time \\(O(ka_1)\\), 965-974 [Zbl 1128.11057]  \\textit{Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge}, \\(W\\)-hardness under linear FPT-reductions: Structural properties and further applications, 975-984 [Zbl 1128.68362]  \\textit{Yang, Xiao Guang; Zhang, Jian Zhong}, Some new results on inverse sorting problems, 985-992 [Zbl 1128.68351]","type":"string"},"datatype":"string"},"type":"statement","id":"Q2577425$C56B46C5-8D14-4871-92E4-E86C4F8F8B46","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$3E28CBDA-02E2-4AEE-89E5-979E343FA3EC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c2375fd4b32d2eb23df347253ca68f523c20922c","datavalue":{"value":"05-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$A69290E5-3AF3-4061-90E7-47B74AE923D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$F7F9874C-DE03-4E8E-9A6D-0244E6B591A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$0EB05C87-BC79-423E-9F46-C572369762D6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2d9dd1c9ccc57c7095b35828b66951fe3a80a882","datavalue":{"value":"2239885","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$434B7281-330F-464F-9AF5-2D15AF3AFE62","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":"Q2577425$4CD5F502-F169-4960-BD98-0BAB05D7C863","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7b603fb2ed0f83ed602e2b9538b7d109a5c7ea09","datavalue":{"value":"https://doi.org/10.1007/11533719","type":"string"},"datatype":"url"},"type":"statement","id":"Q2577425$DC455429-E40C-4573-B72A-96FDC35CD444","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"357c3dcae75b6a42efaa04a91ea31c507a54f64e","datavalue":{"value":"W4376561447","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2577425$2B510F7E-CC9E-4F1F-80CA-42C6C0B1D6DB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2577425","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2577425"}}}}}