@article{Chan/02,
AUTHOR = {Chan, T.M.},
TITLE = {A near-linear area bound for drawing binary trees},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {1},
PAGES = {1-13},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fishburn-Lagarias/02,
AUTHOR = {Fishburn, P.C. and Lagarias, J.C.},
TITLE = {Pinwheel scheduling: Achievable densities},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {1},
PAGES = {14-38},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chazelle-Devillers-Hurtado-Mora-Sacristan-Teillaud/02,
AUTHOR = {Chazelle, B. and Devillers, O. and Hurtado, F. and Mora, M. and Sacrist{\'{a}}n, V. and Teillaud, M.},
TITLE = {Splitting a Delaunay triangulation in linear time},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {1},
PAGES = {39-46},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jansen-Wegener/02,
AUTHOR = {Jansen, T. and Wegener, I.},
TITLE = {The analysis of evolutionary algorithms --- A proof that crossover really can help},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {1},
PAGES = {47-66},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Feigenbaum-Kannan-Strauss-Viswanathan/02,
AUTHOR = {Feigenbaum, J. and Kannan, S. and Strauss, M. and Viswanathan, M.},
TITLE = {Testing and spot-checking of data streams},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {1},
PAGES = {67-80},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Berg-Katz-Stappen-Vleugels/02,
AUTHOR = {de Berg, Mark and Katz, Matthew J. and Stappen, A. Frank van der and Vleugels, Jules},
TITLE = {Realistic input models for geometric algorithms},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {1},
PAGES = {81-97},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Boissonnat-Ghosh-Kavitha-Lazard/02,
AUTHOR = {Boissonnat, J.-D. and Ghosh, S.K. and Kavitha, T. and Lazard, S.},
TITLE = {An algorithm for computing a convex and simple path of bounded curvature in a simple polygon},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {2},
PAGES = {109-156},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pisanti-Sagot/02,
AUTHOR = {Pisanti, Nadia and Sagot, Marie-France},
TITLE = {Further thoughts on the syntenic distance between genomes},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {2},
PAGES = {157-180},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Azar-Boyar-Epstein-Favrholdt-Larsen-Nielsen/02,
AUTHOR = {Azar, Yossi and Boyar, Joan and Epstein, Leah and Favrholdt, Lene M. and Larsen, Kim S. and Nielsen, Morten N.},
TITLE = {Fair versus unrestricted bin packing},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {2},
PAGES = {181-196},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Andrews-Zhang/02,
AUTHOR = {Andrews, Matthew and Zhang, Lisa},
TITLE = {Approximation algorithms for access network design},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {2},
PAGES = {197-215},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Beaumont-Boudet-Rastello-Robert/02,
AUTHOR = {Beaumont, Olivier and Boudet, Vincent and Rastello, Fabrice and Robert, Yves},
TITLE = {Partitioning a square into rectangles: $NP$-completeness and approximation algorithms},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {3},
PAGES = {217-239},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Makino-Yamashita-Kameda/02,
AUTHOR = {Makino, Kazuhisa and Yamashita, Masafumi and Kameda, Tiko},
TITLE = {Max- and min-neighborhood monopolies},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {3},
PAGES = {240-260},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Bozorgzadeh-Srivastava-Sarrafzadeh/02,
AUTHOR = {Chen, Chunhong and Bozorgzadeh, Elaheh and Srivastava, Ankur and Sarrafzadeh, Majid},
TITLE = {Budget management with applications},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {3},
PAGES = {261-275},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agbaria-Ben-Asher-Newman/02,
AUTHOR = {Agbaria, Adnan and Ben-Asher, Yosi and Newman, Ilan},
TITLE = {Communication-processor tradeoffs in a limited resources PRAM},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {3},
PAGES = {276-297},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Baswana-Sen/02,
AUTHOR = {Baswana, Surender and Sen, Sandeep},
TITLE = {Planar graph blocking for external searching},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {3},
PAGES = {298-308},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mosca-Tapp/02,
AUTHOR = {Mosca, Michele and Tapp, Alain},
TITLE = {Introduction},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {309-313},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gilbert-Hamrick/02,
AUTHOR = {Gilbert, Gerald and Hamrick, Michael},
TITLE = {Secrecy, computational loads and rates in practical quantum cryptography},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {314-339},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Inamori/02,
AUTHOR = {Inamori, Hitoshi},
TITLE = {Security of practical time-reversed EPR quantum key distribution},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {340-365},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Inamori/02a,
AUTHOR = {Inamori, Hitoshi},
TITLE = {Security of practical BB84 quantum key distribution},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {366-371},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Biham-Boyer-Brassard-Graaf-Mor/02,
AUTHOR = {Biham, Eli and Boyer, Michel and Brassard, Gilles and Graaf, Jeroen van de and Mor, Tal},
TITLE = {Security of quantum key distribution against all collective attacks},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {372-388},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gisin-Renner-Wolf/02,
AUTHOR = {Gisin, Nicolas and Renner, Renato and Wolf, Stefan},
TITLE = {Linking classical and quantum key agreement: Is there a classical analog to bound entanglement?},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {389-412},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{van_Dam/02,
AUTHOR = {van Dam, Wim},
TITLE = {Quantum algorithms for weighing matrices and quadratic residues},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {413-428},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hoyer-Neerbek-Shi/02,
AUTHOR = {H{\o}yer, Peter and Neerbek, Jan and Shi, Yaoyun},
TITLE = {Quantum complexities of ordered searching, sorting, and element distinctness},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {429-448},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Beaudrap-Cleve-Watrous/02,
AUTHOR = {de Beaudrap, J. Niel and Cleve, Richard and Watrous, John},
TITLE = {Sharp quantum versus classical query complexity separations},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {449-461},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Radhakrishnan-Sen-Venkatesh/02,
AUTHOR = {Radhakrishnan, Jaikumar and Sen, Pranab and Venkatesh, S.},
TITLE = {The quantum complexity of set membership},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {462-479},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hayes-Kutin-Melkebeek/02,
AUTHOR = {Hayes, Thomas P. and Kutin, Samuel and Melkebeek, Dieter van},
TITLE = {The quantum black-box complexity of majority},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {480-501},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brun/02,
AUTHOR = {Brun, Todd A.},
TITLE = {Remotely prepared entanglement: A quantum Web page},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {502-511},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bandyopadhyay-Boykin-Roychowdhury-Vatan/02,
AUTHOR = {Bandyopadhyay, Somshubhro and Boykin, P. Oscar and Roychowdhury, Vwani and Vatan, Farrokh},
TITLE = {A new proof for the existence of mutually unbiased bases},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {512-528},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Benioff/02,
AUTHOR = {Benioff, Paul},
TITLE = {The representation of numbers in quantum mechanics},
JOURNAL = {Algorithmica},
VOLUME = {34},
NUMBER = {4},
PAGES = {529-559},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sanchis/02,
AUTHOR = {Sanchis, L.A.},
TITLE = {Experimental analysis of heuristic algorithms for the dominating set problem},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {3-18},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nilsson-Tikkanen/02,
AUTHOR = {Nilsson, S. and Tikkanen, M.},
TITLE = {An experimental study of compression methods for dynamic tries},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {19-33},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Baev-Meleis-Eichenberger/02,
AUTHOR = {Baev, I.D. and Meleis, W.M. and Eichenberger, A.},
TITLE = {An experimental study of algorithms for weighted completion time scheduling},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {34-51},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kapoor-Kuhl-Wolff/02,
AUTHOR = {Kapoor, V. and K{\"u}hl, D. and Wolff, A.},
TITLE = {A tutorial for designing flexible geometric algorithms},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {52-70},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bertoni-Campadelli-Grossi/02,
AUTHOR = {Bertoni, A. and Campadelli, P. and Grossi, G.},
TITLE = {A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {71-88},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wright-Spalding/02,
AUTHOR = {Wright, R.N. and Spalding, S.},
TITLE = {Experimental performance of shared RSA modulus generation},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {89-103},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arge-Hinrichs-Vahrenhold-Vitter/02,
AUTHOR = {Arge, L. and Hinrichs, K.H. and Vahrenhold, J. and Vitter, J.S.},
TITLE = {Efficient bulk operations on dynamic $R$-trees},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {1},
PAGES = {104-128},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ayeb/02,
AUTHOR = {Ayeb, B.},
TITLE = {Fault identification in system-level diagnosis: A logic-based framework and an $O(n^2\sqrt{tau}/\sqrt{\log n})$ algorithm},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {129-149},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Barequet-Chen-Daescu-Goodrich-Snoeyink/02,
AUTHOR = {Barequet, G. and Chen, D.Z. and Daescu, O. and Goodrich, M.T. and Snoeyink, J.},
TITLE = {Efficiently approximating polygonal paths in three and higher dimensions},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {150-167},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Korupolu-Ramachandran/02,
AUTHOR = {Korupolu, M.R. and Ramachandran, V.},
TITLE = {Quasi-fully dynamic algorithmms for two-connectivity and cycle equivalence},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {168-182},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dehne-Ferreira-Caceres-Song-Roncato/02,
AUTHOR = {Dehne, F. and Ferreira, A. and C{\'{a}}ceres, E. and Song, S.W. and Roncato, A.},
TITLE = {Efficient parallel graph algorithms for coarse-grained multicomputers and BSP},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {183-200},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Procopiuc/02,
AUTHOR = {Agarwal, P.K. and Procopiuc, C.M.},
TITLE = {Exact and approximation algorithms for clustering},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {201-226},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Har-Peled-Karia/02,
AUTHOR = {Agarwal, P.K. and Har-Peled, S. and Karia, M.},
TITLE = {Computing approximate shortest paths on convex polytopes},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {227-242},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cheopi-Vaxes/02,
AUTHOR = {Cheopi, V. and Vaxes, Y.},
TITLE = {Augmenting trees to meet biconnectivity and diameter constraints},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {243-262},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bespamyatnikh-Segal/02,
AUTHOR = {Bespamyatnikh, S. and Segal, M.},
TITLE = {Fast algorithms for approximating distances},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {2},
PAGES = {263-269},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bartal-Farach-Colton-Yooseph-Zhang/02,
AUTHOR = {Bartal, Y. and Farach-Colton, M. and Yooseph, S. and Zhang, L.},
TITLE = {Fast, fair and frugal bandwidth allocation in ATM networks},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {272-286},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kawazoe-Shibuya-Tokuyama/02,
AUTHOR = {Kawazoe, H. and Shibuya, T. and Tokuyama, T.},
TITLE = {Optimal online algorithms for an electronic commerce money distribution system},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {287-299},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Kaplan/02a,
AUTHOR = {Cohen, E. and Kaplan, H.},
TITLE = {Exploiting regularities in web traffic patterns for cache replacement},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {300-334},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goel-Munagala/02,
AUTHOR = {Goel, A. and Munagala, K.},
TITLE = {Extending greedy multicast routing to delay sensitive applications},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {335-352},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kalyanasundaram-Noga-Pruhs-Woeginger/02,
AUTHOR = {Kalyanasundaram, B. and Noga, J. and Pruhs, K.R. and Woeginger, G.J.},
TITLE = {Caching for web searching},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {353-370},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Young/02,
AUTHOR = {Young, N.E.},
TITLE = {On-line file caching},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {371-383},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Irani/02a,
AUTHOR = {Irani, S.},
TITLE = {Page replacement with multi-size pages and applications to web caching},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {3},
PAGES = {384-409},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Hurtado-Diaz-Omana-Pulido-Snoeyink-Toussaint/02,
AUTHOR = {Bose, P. and Hurtado-Diaz, F. and Oma{\~{n}}a-Pulido, E. and Snoeyink, J. and Toussaint, G.T.},
TITLE = {Some aperture-angle optimization problems},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {4},
PAGES = {411-435},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rajasekaran-Ramaswami/02,
AUTHOR = {Rajasekaran, S. and Ramaswami, S.},
TITLE = {Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {4},
PAGES = {436-460},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alber-Bodlaender-Fernau-Kloks-Niedermeier/02,
AUTHOR = {Alber, J. and Bodlaender, H.L. and Fernau, H. and Kloks, T. and Niedermeier, R.},
TITLE = {Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {4},
PAGES = {461-493},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brodal-Makris-Sioutas-Tsakalidis-Tsichlas/02,
AUTHOR = {Brodal, G.S. and Makris, C. and Sioutas, S. and Tsakalidis, A. and Tsichlas, K.},
TITLE = {Optimal solutions for the Temporal Precedence Problem},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {4},
PAGES = {494-510},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Kaplan-Zweck/02,
AUTHOR = {Cohen, E. and Kaplan, H. and Zweck, U.},
TITLE = {Competitive analysis of the LRFU paging algorithm},
JOURNAL = {Algorithmica},
VOLUME = {33},
NUMBER = {4},
PAGES = {511-516},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Crauser-Ferragina/02,
AUTHOR = {Crauser, A. and Ferragina, P.},
TITLE = {A theoretical and experimental study on the construction of suffix arrays in external memory},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {1-35},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Feuerstein-Loma/02,
AUTHOR = {Feuerstein, E. and Loma, A. Strejilevich de},
TITLE = {On-line multi-threaded paging},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {36-60},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Del_Greco-Sekharan-Sridhar/02,
AUTHOR = {Del Greco, J.G. and Sekharan, C.N. and Sridhar, R.},
TITLE = {Fast parallel reordering and isomorphism testing of $k$-trees},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {61-72},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gusfield-Martel/02,
AUTHOR = {Gusfield, D. and Martel, C.},
TITLE = {The structure and complexity of sports elimination numbers},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {73-86},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eppstein-Bern-Hutchings/02,
AUTHOR = {Eppstein, D. and Bern, M.W. and Hutchings, B.},
TITLE = {Algorithms for coloring quadtrees},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {87-94},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Li-Smyth/02,
AUTHOR = {Li, Y. and Smyth, W.F.},
TITLE = {Computing the cover array in linear time},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {95-106},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kimbrel/02,
AUTHOR = {Kimbrel, T.},
TITLE = {Interleaved prefetching},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {107-122},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Albers-Kursawe-Schuierer/02,
AUTHOR = {Albers, S. and Kursawe, K. and Schuierer, S.},
TITLE = {Exploring unknown environments with obstacles},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {123-143},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Levcopoulos-Narasimhan-Smit/02,
AUTHOR = {Levcopoulos, C. and Narasimhan, G. and Smit, M.},
TITLE = {Improved algorithms for constructing fault-tolerant spanners},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {144-156},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bax-Franklin/02,
AUTHOR = {Bax, E. and Franklin, J.},
TITLE = {A permanent algorithm with exp$[\Omega(n^{1/3}/2lnn)]$ expected speedup for 0-1 matrices},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {1},
PAGES = {157-162},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Phillips-Stein-Torng-Wein/02,
AUTHOR = {Phillips, C.A. and Stein, C. and Torng, E. and Wein, J.},
TITLE = {Optimal time-critical scheduling via resource augmentation},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {2},
PAGES = {163-200},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bachrach-El-Yaniv-Reinstadtler/02,
AUTHOR = {Bachrach, R. and El-Yaniv, R. and Reinst{\"a}dtler, M.},
TITLE = {On the competitive theory and practice of online list accessing algorithms},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {2},
PAGES = {201-246},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amoura-Bampis-Kenyon-Manoussakis/02,
AUTHOR = {Amoura, A.K. and Bampis, E. and Kenyon, C. and Manoussakis, Y.},
TITLE = {Scheduling independent multiprocessor tasks},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {2},
PAGES = {247-261},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kamidoi-Wakabayashi-Yoshida/02,
AUTHOR = {Kamidoi, Y. and Wakabayashi, S. and Yoshida, N.},
TITLE = {A divide-and-conquer approach to the minimum $k$-way cut problem},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {2},
PAGES = {262-276},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Andrews-Bender-Zhang/02,
AUTHOR = {Andrews, M. and Bender, M.A. and Zhang, L.},
TITLE = {New algorithms for disk scheduling},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {2},
PAGES = {277-301},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goldreich-Ron/02,
AUTHOR = {Goldreich, O. and Ron, D.},
TITLE = {Property testing in bounded degree graphs},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {2},
PAGES = {302-343},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sibeyn/02,
AUTHOR = {Sibeyn, J.F.},
TITLE = {One-by-one cleaning for practical parallelist ranking},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {345-363},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ben-Amram-Galil/02,
AUTHOR = {Ben-Amram, A.M. and Galil, Z.},
TITLE = {Lower bounds for dynamaic data structures on algebraic RAMs},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {364-395},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fotakis-Spirakis/02,
AUTHOR = {Fotakis, D.A. and Spirakis, P.G.},
TITLE = {Minimum congestion redundant assignments to tolerate random faults},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {396-422},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Landau-Immerman/02,
AUTHOR = {Landau, S. and Immerman, N.},
TITLE = {Embedding linkages on an integer lattice},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {423-436},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Abello-Buchsbaum-Westbrook/02,
AUTHOR = {Abello, J. and Buchsbaum, A.L. and Westbrook, J.R.},
TITLE = {A functional approach to external graph algorithms},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {437-458},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Kaplan/02,
AUTHOR = {Cohen, E. and Kaplan, H.},
TITLE = {Caching documents with variable sizes and fetching costs: An $LP$-based approach},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {459-466},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Erlebach-Hagerup/02,
AUTHOR = {Erlebach, T. and Hagerup, T.},
TITLE = {Routing flow through a strongly connected graph},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {467-473},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bertolazzi-Battista-Didimo/02,
AUTHOR = {Bertolazzi, P. and Battista, G. Di and Didimo, W.},
TITLE = {Quasi-upward planarity},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {474-506},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jansen-Porkolab/02,
AUTHOR = {Jansen, K. and Porkolab, L.},
TITLE = {Linear-time approximation schemes for scheduling malleable parallel tasks},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {3},
PAGES = {507-520},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Bhattacharya-Sen/02,
AUTHOR = {Agarwal, P.K. and Bhattacharya, B.K. and Sen, S.},
TITLE = {Improved algorithms for uniform partitions of points},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {521-539},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Awerbuch-Singh/02,
AUTHOR = {Awerbuch, B. and Singh, T.},
TITLE = {An online algorithm for the dynamic maximal dense tree problem},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {540-553},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wang-Du/02,
AUTHOR = {Wang, L. and Du, D.-Z.},
TITLE = {Approximations for a bottleneck Steiner tree problem},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {554-561},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yeh-Kuo-Lei-Yen/02,
AUTHOR = {Yeh, Tzuoo-Hawn and Kuo, Cheng-Ming and Lei, Chin-Laung and Yen, Hsu-Chun},
TITLE = {Distributed and on-line routing on tori},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {562-593},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Broersma-Kloks-Kratsch-Muller/02,
AUTHOR = {Broersma, H.J. and Kloks, T. and Kratsch, D. and M{\"u}ller, H.},
TITLE = {A generalization of AT-free graphs and a generic algorithm for solving triangulaiton problems},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {594-610},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alon-Zaks/02,
AUTHOR = {Alon, N. and Zaks, A.},
TITLE = {Algorithmic aspects of acyclic edge colorings},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {611-614},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Schoning/02,
AUTHOR = {Sch{\"o}ning, U.},
TITLE = {A probabilistic algorithm for $k$-SAT based on limited local search and restart},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {615-623},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Irani/02,
AUTHOR = {Irani, S.},
TITLE = {Randomized weighted caching with two page weights},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {624-640},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ambainis-Bloch-Schweizer/02,
AUTHOR = {Ambainis, A. and Bloch, S.A. and Schweizer, D.L.},
TITLE = {Delayed binary search, or playing twenty questions with a procrastinator},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {641-650},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Shachnai-Tamir/02,
AUTHOR = {Shachnai, H. and Tamir, T.},
TITLE = {Multiprocessor scheduling with machine allotment and parallelism constraints},
JOURNAL = {Algorithmica},
VOLUME = {32},
NUMBER = {4},
PAGES = {651-678},
YEAR = {2002},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}