Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 -- August 1, 2003. Proceedings (Q1416074)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 -- August 1, 2003. Proceedings |
scientific article; zbMATH DE number 2016486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 -- August 1, 2003. Proceedings |
scientific article; zbMATH DE number 2016486 |
Statements
Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 -- August 1, 2003. Proceedings (English)
0 references
11 December 2003
0 references
The articles of this volume will be reviewed individually. The preceding workshop has been reviewed (see Zbl 0969.00079). Indexed articles: \textit{Brassard, Gilles; Broadbent, Anne; Tapp, Alain}, Multi-party pseudo-telepathy., 1-11 [Zbl 1278.81037] \textit{Aichholzer, Oswin; Aurenhammer, Franz; Krasser, Hannes}, Adapting (pseudo)-triangulations with a near-linear number of edge flips., 12-24 [Zbl 1278.68304] \textit{Dey, Tamal K.; Giesen, Joachim; Goswami, Samrat}, Shape segmentation and matching with flow discretization., 25-36 [Zbl 1278.68331] \textit{Tang, Jijun; Moret, Bernard M. E.}, Phylogenetic reconstruction from gene-rearrangement data with unequal gene content., 37-46 [Zbl 1278.92033] \textit{Evans, Patricia A.; Smith, Andrew D.}, Toward optimal motif enumeration., 47-58 [Zbl 1278.68349] \textit{Esfahbod, Behdad; Ghodsi, Mohammad; Sharifi, Ali}, Common-deadline lazy bureaucrat scheduling problems., 59-66 [Zbl 1278.90153] \textit{Kothari, Anshul; Suri, Subhash; Zhou, Yunhong}, Bandwidth-constrained allocation in grid computing., 67-78 [Zbl 1278.68039] \textit{Sengupta, Sudipta}, Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection., 79-90 [Zbl 1278.90172] \textit{Shi, Qingmin; JaJa, Joseph}, Fast algorithms for a class of temporal range queries., 91-102 [Zbl 1278.68082] \textit{Elmasry, Amr}, Distribution-sensitive binomial queues., 103-113 [Zbl 1278.68077] \textit{Franceschini, Gianni; Grossi, Roberto}, Optimal worst-case operations for implicit cache-oblivious search trees., 114-126 [Zbl 1278.68078] \textit{Sharir, Micha; Smorodinsky, Shakhar}, Extremal configurations and levels in pseudoline arrangements., 127-139 [Zbl 1278.68319] \textit{Ziegler, Martin}, Fast relative approximation of potential fields., 140-149 [Zbl 1278.68338] \textit{Fekete, Sándor P.; Meijer, Henk}, The one-round Voronoi game replayed., 150-161 [Zbl 1192.91017] \textit{Albers, Susanne; Büttner, Markus}, Integrated prefetching and caching with read and write requests., 162-173 [Zbl 1278.68068] \textit{Frederiksen, Jens S.; Larsen, Kim S.}, Online seat reservations via offline seating arrangements., 174-185 [Zbl 1278.68079] \textit{Anand, R. Sai; Erlebach, Thomas}, Routing and call control algorithms for ring networks., 186-197 [Zbl 1278.68033] \textit{Wagner, Dorothea}, Algorithms and models for railway optimization., 198-206 [Zbl 1278.90068] \textit{Müller-Hannemann, Matthias; Peyer, Sven}, Approximation of rectilinear Steiner trees with length restrictions on obstacles., 207-218 [Zbl 1278.68347] \textit{Duncan, Christian A.}, Multi-way space partitioning trees., 219-230 [Zbl 1278.68075] \textit{Frikken, Keith; Atallah, Mikhail}, Cropping-resilient segmented multiple watermarking (extended abstract), 231-242 [Zbl 1278.94048] \textit{Brass, P.; Cenek, E.; Duncan, C. A.; Efrat, A.; Erten, C.; Ismailescu, D.; Kobourov, S. G.; Lubiw, A.; Mitchell, J. S. B.}, On simultaneous planar graph embeddings., 243-255 [Zbl 1278.68229] \textit{Spielman, Daniel A.; Teng, Shang-Hua}, Smoothed analysis. Motivation and discrete models, 256-270 [Zbl 1253.68378] \textit{Matichin, Rachel; Peleg, David}, Approximation algorithm for hotlink assignments in web directories., 271-280 [Zbl 1278.68346] \textit{Barequet, Gill; Goodrich, Michael T.; Riley, Chris}, Drawing graphs with large vertices and thick edges., 281-293 [Zbl 1278.68228] \textit{Harvey, Nicholas J. A.; Ladner, Richard E.; Lovász, László; Tamir, Tami}, Semi-matchings for bipartite graphs and load balancing., 294-306 [Zbl 1278.68234] \textit{Eppstein, David}, The traveling salesman problem for cubic graphs., 307-318 [Zbl 1206.68143] \textit{Solomon, Andrew; Sutcliffe, Paul; Lister, Raymond}, Sorting circular permutations by reversal., 319-328 [Zbl 1278.68227] \textit{Gąsieniec, Leszek; Lingas, Andrzej}, An improved bound on Boolean matrix multiplication for highly clustered data., 329-339 [Zbl 1278.68108] \textit{Amir, Amihood; Landau, Gad M.; Lewenstein, Moshe; Sokol, Dina}, Dynamic text and static pattern matching., 340-352 [Zbl 1278.68348] \textit{Amir, Amihood; Butman, Ayelet; Lewenstein, Moshe; Porat, Ely}, Real two dimensional scaled matching., 353-364 [Zbl 1278.68325] \textit{Kapoor, Sanjiv; Li, Xiang-Yang}, Proximity structures for geometric graphs., 365-376 [Zbl 1278.68314] \textit{Aichholzer, Oswin; Rote, Günter; Speckmann, Bettina; Streinu, Ileana}, The zigzag path of a pseudo-triangulation., 377-388 [Zbl 1278.68305] \textit{Tóth, Csaba D.}, Alternating paths along orthogonal segments., 389-400 [Zbl 1278.68321] \textit{Karpinski, Marek; Măndoiu, Ion I.; Olshevsky, Alexander; Zelikovsky, Alexander}, Improved approximation algorithms for the quality of service Steiner tree problem., 401-411 [Zbl 1278.68345] \textit{Andersson, Mattias; Gudmundsson, Joachim; Levcopoulos, Christos}, Chips on wafers (extended abstract), 412-423 [Zbl 1278.68343] \textit{Phan, Vinhthuy; Skiena, Steven; Sumazin, Pavel}, A model for analyzing black-box optimization., 424-438 [Zbl 1278.90476] \textit{Papadopoulou, Evanthia}, On the Hausdorff Voronoi diagram of point clusters in the plane., 439-450 [Zbl 1278.68315] \textit{Bremner, David; Demaine, Erik; Erickson, Jeff; Iacono, John; Langerman, Stefan; Morin, Pat; Toussaint, Godfried}, Output-sensitive algorithms for computing nearest-neighbour decision boundaries., 451-461 [Zbl 1278.68309] \textit{de Berg, Mark; Haverkort, Herman J.}, Significant-presence range queries in categorical data., 462-473 [Zbl 1278.68324] \textit{Prieto, Elena; Sloper, Christian}, Either/or: using \textsc{Vertex Cover} structure in designing FPT-algorithms -- the case of \(k\)-\textsc{Internal Spanning Tree}., 474-483 [Zbl 1278.68109] \textit{Raman, Venkatesh; Saurabh, Saket}, Parameterized complexity of directed feedback set problems in tournaments., 484-492 [Zbl 1278.68110] \textit{Zhang, Huaming; He, Xin}, Compact visibility representation and straight-line grid embedding of plane graphs., 493-504 [Zbl 1278.68322] \textit{Fellows, Michael R.}, New directions and new challenges in algorithm design and complexity, parameterized., 505-519 [Zbl 1278.68107]
0 references
Algorithms
0 references
Data structures
0 references
WADS 2003
0 references
Ottawa, Ontario (Canada)
0 references