{"entities":{"Q5943782":{"pageid":8120584,"ns":120,"title":"Item:Q5943782","lastrevid":97653833,"modified":"2026-06-05T15:10:21Z","type":"item","id":"Q5943782","labels":{"en":{"language":"en","value":"Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8--10, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648189"}},"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":"Q5943782$E6CDA731-7E58-48F0-AC55-7746FB59F194","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c842f93912b3dd536d04c0eb2ac36d75cac70ffe","datavalue":{"value":{"text":"Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8--10, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5943782$D076835F-6E39-4DFB-ADC9-13832DB7317A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"81c9747ff7a3fc12075559ca6ae59985302fb74d","datavalue":{"value":"0969.00079","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943782$D0BCD419-89AC-4A0E-9F5A-30FCB3597311","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":"Q5943782$9D5971B3-6AF5-4302-8522-3B15B0D498FF","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":"Q5943782$BD9822B6-9038-4F60-9441-D8966D2EBBC5","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"bef3da97c00e84f35dca7f6a3776a2ca947d1f09","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. For the preceding workshop see [Zbl 1061.68501].  Indexed articles:  \\textit{Yannakakis, Mihalis}, Approximation of multiobjective optimization problems, 1 [Zbl 0997.68563]  \\textit{Hurtado, Ferran; Liotta, Giuseppe; Meijer, Henk}, Optimal, suboptimal, and robust algorithms for proximity graphs, 2-13 [Zbl 0997.68165]  \\textit{Bern, Marshall; Eppstein, David}, Optimal M\u00f6bius transformations for information visualization and meshing, 14-25 [Zbl 0997.68536]  \\textit{Long, Philip M.}, Using the pseudo-dimension to analyze approximation algorithms for integer programming, 26-37 [Zbl 1018.90027]  \\textit{Chakraborty, Samarjit; Erlebach, Thomas; Thiele, Lothar}, On the complexity of scheduling conditional real-time code, 38-49 [Zbl 0997.68507]  \\textit{Agarwal, Pankaj K.; Arge, Lars; Vahrenhold, Jan}, Time responsive external data structures for moving points, 50-61 [Zbl 0997.68522]  \\textit{Karavelas, Menelaos I.}, Voronoi diagrams for moving disks and applications, 62-74 [Zbl 0997.68539]  \\textit{Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.}, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover, 75-86 [Zbl 0998.05060]  \\textit{Espelage, Wolfgang; Gurski, Frank; Wanke, Egon}, Deciding clique-width for graphs of bounded tree-width (extended abstract), 87-98 [Zbl 0997.68530]  \\textit{Koltun, Vladlen}, Complexity bounds for vertical decompositions of linear arrangements in four dimensions, 99-110 [Zbl 0997.68145]  \\textit{Bern, Marshall; Eppstein, David}, Optimization over zonotopes and training support vector machines, 111-121 [Zbl 0997.68142]  \\textit{Agarwal, Pankaj K.; de Berg, Mark; Har-Peled, Sariel; Overmars, Mark H.; Sharir, Micha}, Reporting intersecting pairs of polytopes in two and three dimensions, 122-134 [Zbl 0997.68144]  \\textit{Bagchi, Amitabha; Chaudhary, Amitabh; Garg, Rahul; Goodrich, Michael T.; Kumar, Vijay}, Seller-focused algorithms for online auctioning, 135-147 [Zbl 0997.68629]  \\textit{Cohen, Edith; Kaplan, Haim; Zwick, Uri}, Competitive analysis of the LRFU paging algorithm, 148-154 [Zbl 0997.68572]  \\textit{Blum, Avrim; Kalai, Adam; Kleinberg, Jon}, Admission control to minimize rejections, 155-164 [Zbl 0997.68558]  \\textit{Atallah, Mikhail J.; Du, Wenliang}, Secure multi-party computational geometry, 165-179 [Zbl 0997.68537]  \\textit{Bose, Prosenjit; Maheshwari, Anil; Morin, Pat; Morrison, Jason}, The grid placement problem, 180-191 [Zbl 0997.68538]  \\textit{Arkin, Esther M.; Fekete, S\u00e1ndor P.; Hurtado, Ferran; Mitchell, Joseph S. B.; Noy, Marc}, On the reflexivity of point sets, 192-204 [Zbl 0997.68141]  \\textit{Hassin, Refael; Rubinstein, Shlomi}, A \\({7\\over 8}\\)-approximation algorithm for metric max TSP, 205-209 [Zbl 1018.90040]  \\textit{Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich}, Approximating multi-objective knapsack problems, 210-221 [Zbl 1018.90034]  \\textit{Brandes, Ulrik; Cornelsen, Sabine}, Visual ranking of link structures (extended abstract), 222-233 [Zbl 0997.68645]  \\textit{He, Xin}, A simple linear time algorithm for proper box rectangular drawings of plane graphs, 234-245 [Zbl 0997.68541]  \\textit{Kaplan, Haim; Milo, Tova}, Short and simple labels for small distances and other functions, 246-257 [Zbl 0997.68544]  \\textit{Bj\u00f6rklund, Andreas; Lingas, Andrzej}, Fast Boolean matrix multiplication for highly clustered data, 258-263 [Zbl 0997.68753]  \\textit{Dumitrescu, Adrian; Pach, J\u00e1nos}, Partitioning colored point sets into monochromatic parts, 264-275 [Zbl 0997.68143]  \\textit{Maneewongvatana, Songrit; Mount, David M.}, The analysis of a probabilistic approach to nearest neighbor searching, 276-286 [Zbl 0997.68521]  \\textit{Maheshwari, Anil; Smid, Michiel; Zeh, Norbert}, I/O-efficient shortest path queries in geometric spanners, 287-299 [Zbl 0997.68535]  \\textit{Fekete, S\u00e1ndor P.; K\u00f6hler, Ekkehard; Teich, J\u00fcrgen}, Higher-dimensional packing with order constraints, 300-312 [Zbl 1018.90035]  \\textit{Menakerman, Nir; Rom, Raphael}, Bin packing with item fragmentation, 313-324 [Zbl 0997.68526]  \\textit{Dragan, Feodor F.; Kahng, Andrew B.; M\u0103ndoiu, Ion I.; Muddu, Sudhakar; Zelikovsky, Alexander}, Practical approximation algorithms for separable packing linear programs, 325-337 [Zbl 0997.68505]  \\textit{Leighton, F. Thomson}, The challenges of delivering content on the internet, 338 [Zbl 0997.68639]  \\textit{Didimo, Walter; Pizzonia, Maurizio}, Upward embeddings and orientations of undirected planar graphs, 339-351 [Zbl 0997.68531]  \\textit{Eiglsperger, Markus; Kaufmann, Michael}, An approach for mixed upward planarization, 352-364 [Zbl 0997.68528]  \\textit{Bader, David A.; Moret, Bernard M. E.; Yan, Mi}, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study, 365-376 [Zbl 0997.68527]  \\textit{Chen, Zhi-Zhong; Jiang, Tao; Lin, Guo-Hui}, Computing phylogenetic roots with bounded degrees and errors (extended abstract), 377-388 [Zbl 0997.68529]  \\textit{Ilinkin, Ivaylo; Janardan, Ravi; Majhi, Jayanth; Schwerdt, J\u00f6rg; Smid, Michiel}, A decomposition-based approach to layered manufacturing, 389-400 [Zbl 0997.68548]  \\textit{Arkin, Esther M.; Bender, Michael A.; Demaine, Erik D.; Demaine, Martin L.; Mitchell, Joseph S. B.}, When can you fold a map?, 401-413 [Zbl 0997.68540]  \\textit{Fagerberg, Rolf; Jensen, Rune E.; Larsen, Kim S.}, Search trees with relaxed balance and near-optimal height, 414-425 [Zbl 0997.68519]  \\textit{Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa}, Succinct dynamic data structures, 426-437 [Zbl 0997.68520]  \\textit{Bhattacharya, Binay; Mukhopadhyay, Asish; Narasimhan, Giri}, Optimal algorithms for two-guard walkability of simple polygons, 438-449 [Zbl 1005.68558]  \\textit{Reif, John; Sun, Zheng}, Movement planning in the presence of flows, 450-461 [Zbl 0997.68534]  \\textit{Eppstein, David}, Small maximal independent sets and faster exact graph coloring, 462-470 [Zbl 0997.68087]  \\textit{Arge, Lars; Meyer, Ulrich; Toma, Laura; Zeh, Norbert}, On external-memory planar depth first search, 471-482 [Zbl 0997.68523]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$C4648C83-C36A-42D8-96D2-6D1B1F7B15A2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943782$9149EAE4-A156-4506-A509-69707E26056F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943782$17099D1C-7873-4A7F-A8B3-D844E367DE8F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"061a8ed54f768fab043f6185d25e3c71c09a09eb","datavalue":{"value":"1648189","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5943782$A2CAB92E-DF4F-4DE6-B373-84047E6E55EB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"63eb1befbe01830acb92a786121be863229f05a2","datavalue":{"value":"Providence, RI (USA)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$21BD1755-9761-492E-8BE4-06290BB5DE23","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$F9239C4B-F9B4-42DD-B640-108E02C6F4AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$AC64CAAF-E8A0-44B4-81A0-A410769B9B7B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6cdd4eb0b72b1cfd68278c4e35fdad592805e01b","datavalue":{"value":"WADS 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$43501B32-573C-4BE6-ADAB-B86E853A9AB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8baf804bc4c1172cd32c9cc96b06a8c070f11c0c","datavalue":{"value":"Algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$A2539F0F-1636-4B4F-A10C-B91B343EBBBF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"135a7e6e28c5e714d2a4204296bc6a14edbd680e","datavalue":{"value":"Data structures","type":"string"},"datatype":"string"},"type":"statement","id":"Q5943782$F59A9E44-7F0D-4041-9A24-BF269C729219","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":"Q5943782$ABEDAE92-FC5C-45CE-A9E5-83393762FE28","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8--10, 2001. Proceedings","badges":[]}}}}}