{"entities":{"Q1589871":{"pageid":1600611,"ns":120,"title":"Item:Q1589871","lastrevid":67935744,"modified":"2026-04-12T20:20:29Z","type":"item","id":"Q1589871","labels":{"en":{"language":"en","value":"Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18--20, 2000. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1542814"}},"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":"Q1589871$D2AABBF4-800D-4CF2-B0D4-D6EA5E8C6ED7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"09bab879bd483c7ca5a21fb06f50714e6f22f5e5","datavalue":{"value":{"text":"Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18--20, 2000. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1589871$05F54C72-27D1-4756-ADF0-DD1C35163E67","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a4a630e19393fe768ce75fd8894b9214d9d9cca3","datavalue":{"value":"0952.00049","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589871$DCD4DDAA-0FFD-4B20-BC9C-2B9797618FF0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"efce60b437c8fbc166d80ddd987dfa5317e978c6","datavalue":{"value":"10.1007/3-540-40996-3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589871$563C4EF7-4327-4AED-94BA-55847602A439","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":"Q1589871$325829B3-6CA6-42FA-B1A2-9E12430D9D8F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f48ba751fa96ccf6bfdbc02f9034cc7445f12315","datavalue":{"value":{"time":"+2000-12-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1589871$B1952D80-FD3F-4A4C-B232-8E9192D0F889","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"88a1cdda302e35283d27281dd1553330fd5808c1","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. The preceding conference (10th, 1999) has been reviewed (see Zbl 0933.00045).  Indexed articles:  \\textit{Boissonnat, Jean-Daniel}, Voronoi-based systems of coordinates and surface reconstruction, 1 [Zbl 1044.68857]  \\textit{Cai, Jin-Yi}, Essentially every unimodular matrix defines an expander, 2-22 [Zbl 1044.05507]  \\textit{Bose, Prosenjit; Czyzowicz, Jurek; G\u0105sieniec, Leszek; Kranakis, Evangelos; Krizanc, Danny; Pelc, Andrzej; Vargas Martin, Miguel}, Strategies for hotlink assignments, 23-34 [Zbl 1044.68693]  \\textit{Law, Ching; Leiserson, Charles E.}, A new competitive analysis of randomized caching, 35-46 [Zbl 1044.68939]  \\textit{Bose, Prosenjit; Brodnik, Andrej; Carlsson, Svante; Demaine, Erik D.; Fleischer, Rudolf; L\u00f3pez-Ortiz, Alejandro; Morin, Pat; Munro, J. Ian}, Online routing in convex subdivisions, 47-59 [Zbl 1044.68692]  \\textit{Huang, Jingui; Chen, Jianer; Chen, Songqiao}, A simple linear-time approximation algorithm for multi-processor job scheduling on four processors, 60-71 [Zbl 1044.68521]  \\textit{Osogami, Takayuki; Imai, Hiroshi}, Classification of various neighborhood operations for the nurse scheduling problem, 72-83 [Zbl 1044.90509]  \\textit{Chen, Yuyu; Kao, Ming-Yang; Lu, Hsueh-I.}, Optimal bid sequences for multiple-object auctions with unequal budgets, 84-95 [Zbl 1044.91514]  \\textit{Cicalese, Ferdinando; Vaccaro, Ugo}, Coping with delays and time-outs in binary search procedures, 96-107 [Zbl 1044.68745]  \\textit{Chen, Zhixiang; Zhu, Binhai}, Some formal analysis of Rocchio's similarity-based relevance feedback algorithm, 108-119 [Zbl 1044.68589]  \\textit{Horiyama, Takashi; Ibaraki, Toshihide}, Reasoning with ordered binary decision diagrams, 120-131 [Zbl 1044.68813]  \\textit{Chen, Jianer; Kanj, Iyad A.}, On approximating minimum vertex cover for graphs with perfect matching, 132-143 [Zbl 1044.68694]  \\textit{Deng, Xiaotie; Li, Guojun; Zang, Wenan; Zhou, Yi}, A 2-approximation algorithm for path coloring on trees of rings, 144-155 [Zbl 1044.68695]  \\textit{Wu, Q. S.; Lu, C. L.; Lee, R. C. T.}, An approximate algorithm for the weighted Hamiltonian path completion problem on a tree, 156-167 [Zbl 1044.68137]  \\textit{Zhou, Xiao; Nishizeki, Takao}, Finding independent spanning trees in partial \\(k\\)-trees, 168-179 [Zbl 1044.68711]  \\textit{Niedermeier, Rolf; Rossmanith, Peter}, On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER, 180-191 [Zbl 1044.68133]  \\textit{Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L.}, Constructive linear time algorithms for small cutwidth and carving-width, 192-203 [Zbl 1044.68709]  \\textit{Asano, Takao; Halld\u00f3rsson, Magn\u00fas M.; Iwama, Kazuo; Matsuda, Takeshi}, Approximation algorithms for the maximum power consumption problem on combinatorial circuits, 204-215 [Zbl 1044.68941]  \\textit{Kubo, Norihiro; Muramoto, Katsuhiro; Shimozono, Shinichi}, A simple and quick approximation algorithm for traveling salesman problem in the plane, 216-227 [Zbl 1044.90527]  \\textit{Erlebach, Thomas; Spieksma, Frits C. R.}, Simple algorithms for a weighted interval selection problem, 228-240 [Zbl 1044.68753]  \\textit{Lu, Chin Lung; Peng, Sheng-Lung; Tang, Chuan Yi}, Efficient minus and signed domination in graphs, 241-253 [Zbl 1044.68706]  \\textit{Miura, Kazuyuki; Nakano, Shin-ichi; Nishizeki, Takao}, Convex grid drawings of four-connected plane graphs, 254-265 [Zbl 1044.68707]  \\textit{Hong, Seok-Hee; Eades, Peter}, An algorithm for finding three dimensional symmetry in series parallel digraphs, 266-277 [Zbl 1044.68700]  \\textit{Katsura, Masashi; Kobayashi, Yuji; Otto, Friedrich}, Undecidability results for monoids with linear-time decidable word problems, 278-289 [Zbl 1044.03029]  \\textit{Yoshikawa, Reina; Guo, Shimin; Motegi, Kazuhiro; Igarashi, Yoshihide}, Secret key exchange using random deals of cards on hierarchical structures, 290-301 [Zbl 1044.94538]  \\textit{Lu, Chi-Jen}, Derandomizing Arthur-Merlin games under uniform assumptions, 302-312 [Zbl 1044.68060]  \\textit{Jackson, Bill; Jord\u00e1n, Tibor}, A near optimal algorithm for vertex connectivity augmentation, 313-325 [Zbl 1044.68126]  \\textit{Ishii, Toshimasa; Nagamochi, Hiroshi}, Simultaneous augmentation of two graphs to an \\(\\ell\\)-edge-connected graph and a biconnected graph, 326-337 [Zbl 1044.68701]  \\textit{Ito, Hiro; Ito, Motoyasu; Itatsu, Yuichiro; Uehara, Hideyuki; Yokoyama, Mitsuo}, Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets, 338-349 [Zbl 1044.68702]  \\textit{Chen, Jianer; Liu, Lihua; Jia, Weijia; Chen, Songqiao}, An intuitive and effective new representation for interconnection network structures, 350-361 [Zbl 1044.68505]  \\textit{Nakano, Koji; Olariu, Stephan}, Randomized leader election protocols in radio networks with no collision detection, 362-373 [Zbl 1044.68509]  \\textit{De Marco, Gianluca; Pelc, Andrzej}, Deterministic broadcasting time with partial knowledge of the network, 374-385 [Zbl 1044.68506]  \\textit{Poon, Chung Keung; Zhang, Pixing}, Minimizing makespan in batch machine scheduling, 386-397 [Zbl 1044.68523]  \\textit{Jansen, Klaus; Porkolab, Lorant}, Preemptive parallel task scheduling in \\(O(n)+\\text{poly}(m)\\) time, 398-409 [Zbl 1044.68522]  \\textit{Sadakane, Kunihiko}, Compressed text databases with efficient query algorithms based on the compressed suffix array, 410-421 [Zbl 1044.68587]  \\textit{Wolff, Alexander; Thon, Michael; Xu, Yinfeng}, A better lower bound for two-circle point labeling, 422-431 [Zbl 1044.68867]  \\textit{Kim, Deok-Soo; Kim, Donguk; Sugihara, Kokichi}, Voronoi diagram of a circle set constructed from Voronoi diagram of a point set, 432-443 [Zbl 1044.68862]  \\textit{Bose, Prosenjit; Morin, Pat}, An improved algorithm for subdivision traversal without extra storage, 444-455 [Zbl 1044.68858]  \\textit{Kristiansen, Petter; Telle, Jan Arne}, Generalized \\(H\\)-coloring of graphs, 456-466 [Zbl 1044.68129]  \\textit{Wang, Biing-Feng; Lin, Jyh-Jye}, Finding a two-core of a tree in linear time, 467-478 [Zbl 1044.68710]  \\textit{Kao, Ming-Yang; Lam, Tak-Wah; Sung, Wing-Kin; Ting, Hing-Fung}, Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparison, 479-490 [Zbl 1044.68703]  \\textit{Chen, Danny Z.; Hu, Xiaobo; Xu, Jinhui}, Optimal beam penetrations in two and three dimensions, 491-502 [Zbl 1044.68860]  \\textit{Tan, Xuehou}, Searching a simple polygon by a \\(k\\)-searcher, 503-514 [Zbl 1044.68866]  \\textit{Park, Sang-Min; Lee, Jae-Ha; Chwa, Kyung-Yong}, Characterization of rooms searchable by two guards, 515-526 [Zbl 1044.68865]  \\textit{Hon, Wing-Kai; Kao, Ming-Yang; Lam, Tak-Wah}, Improved phylogeny comparisons: Non-shared edges, nearest neighbor interchanges, and subtree transfers, 527-538 [Zbl 1044.68699]  \\textit{Lin, Guo-Hui; Kearney, Paul E.; Jiang, Tao}, Phylogenetic \\(k\\)-root and Steiner \\(k\\)-root, 539-551 [Zbl 1044.68704]  \\textit{Katz, Matthew J.; Nielsen, Frank; Segal, Michael}, Maintenance of a piercing set for intervals with applications, 552-563 [Zbl 1044.68861]  \\textit{Chen, Danny Z.; Hu, Xiaobo S.; Wu, Xiaodong}, Optimal polygon cover problems and applications, 564-576 [Zbl 1044.68859]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$D06F90BF-702A-418D-8E5F-E7012CDE4561","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589871$7E44151C-4BBB-42E5-BF7B-953D9A0F4992","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589871$9AF9F8C5-037D-43EC-BEB8-33C228C342DB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7b9ea8b144f1d0e9f162ad281bd8aaa6917b5e5d","datavalue":{"value":"1542814","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589871$BF0AA869-D60C-4122-AA06-B5A1B8419D06","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b8f68195e2a15c181d7e94b4304ab1dea09808c9","datavalue":{"value":"Taipei (Taiwan)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$76451A31-36A5-4B89-AC16-D1D161CFDDEE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1f316424967ba2f89d766232104a565814dea592","datavalue":{"value":"Procedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$2E3EC211-0B15-45E4-92B7-2BC95EB6255F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$45658F9A-9EC0-45AF-9D25-142E97DF0793","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bdca560cdabe20b079d4e3d9be063909e51fd669","datavalue":{"value":"ISAAC 2000","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$4317DE79-82E9-45CA-90CB-6C0FF5F1B5E0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8baf804bc4c1172cd32c9cc96b06a8c070f11c0c","datavalue":{"value":"Algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$AD52A2F8-4691-4F18-9F3E-F3AB0E4CA546","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a7733f4707cd6367a6ff84835298a3aa55a9016e","datavalue":{"value":"Computation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1589871$2E3AFE61-3F21-43AA-869A-D265CC4409FC","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":"Q1589871$CB681EA9-4913-4745-8357-FA3B5C005D19","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"5ca6a1db122be74550105b49ccc46d8e126dbd1b","datavalue":{"value":"https://doi.org/10.1007/3-540-40996-3","type":"string"},"datatype":"url"},"type":"statement","id":"Q1589871$3142B0B0-D12A-4282-9D66-069E696FFA16","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"8c174740e4e3e90a6d6e326746ba0219ed35027c","datavalue":{"value":"W4301783278","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589871$8AB17835-5F3A-48B3-8B69-2AFB77F89D00","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18--20, 2000. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Algorithms_and_computation._11th_international_conference,_ISAAC_2000,_Taipei,_Taiwan,_December_18--20,_2000._Proceedings"}}}}}