@article{Fotakis/08,
AUTHOR = {Fotakis, Dimitris},
TITLE = {On the competitive ratio for online facility location},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {1},
PAGES = {1-57},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9049-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sun-Yi-Yang-Lai/08,
AUTHOR = {Sun, Min-Te and Yi, Chih-Wei and Yang, Chuan-Kai and Lai, Ten-Hwang},
TITLE = {An optimal algorithm for the minimum disc cover problem},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {1},
PAGES = {58-71},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9043-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Naaman-Rom/08,
AUTHOR = {Naaman, Nir and Rom, Raphael},
TITLE = {Average case analysis of bounded space bin packing algorithms},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {1},
PAGES = {72-97},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9073-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gupta-Srinivasan-Tardos/08,
AUTHOR = {Gupta, Anupam and Srinivasan, Aravind and Tardos, {\'E}va},
TITLE = {Cost-sharing mechanisms for network design},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {1},
PAGES = {98-119},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9065-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gentilini-Piazza-Policriti/08,
AUTHOR = {Gentilini, Raffaella and Piazza, Carla and Policriti, Alberto},
TITLE = {Symbolic graphs: Linear solutions to connectivity related problems},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {1},
PAGES = {120-158},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9079-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Khachiyan-Boros-Elbassioni-Gurvich/08,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
TITLE = {On enumerating minimal dicuts and strongly connected subgraphs},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {1},
PAGES = {159-172},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9074-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dehne-Sack/08,
AUTHOR = {Dehne, Frank and Sack, J{\"o}rg-R{\"u}diger},
TITLE = {Introduction to special issue},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {173-174},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9038-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cho-Mount/08,
AUTHOR = {Cho, Minkyoung and Mount, David M.},
TITLE = {Improved approximation bounds for planar point pattern matching},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {175-207},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9059-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Douieb-Langerman/08,
AUTHOR = {Dou{\"{i}}eb, Karim and Langerman, Stefan},
TITLE = {Dynamic hotlinks},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {208-222},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9060-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Iwama-Lingas-Okita/08,
AUTHOR = {Iwama, Kazuo and Lingas, Andrzej and Okita, Masaki},
TITLE = {Max-stretch reduction for tree spanners},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {223-235},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9058-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chan/08,
AUTHOR = {Chan, Timothy M.},
TITLE = {All-pairs shortest paths with real weights in $O(n^3 /\log n)$ time},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {236-243},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9062-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berger-Parekh/08,
AUTHOR = {Berger, Andr{\'e} and Parekh, Ojas},
TITLE = {Linear time algorithms for generalized edge dominating set problems},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {244-254},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9057-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {see Erratum in Algorithmica, Vol. 62, 2012, No. 1-2, 633-634},
}
@article{Baran-Demaine-Katz/08,
AUTHOR = {Baran, Ilya and Demaine, Erik D. and Katz, Dmitriy A.},
TITLE = {Optimally adaptive integration of univariate Lipschitz functions},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {255-278},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9093-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bender-Bunde-Demaine-Fekete-Leung-Meijer-Phillips/08,
AUTHOR = {Bender, Michael A. and Bunde, David P. and Demaine, Erik D. and Fekete, S{\'a}ndor P. and Leung, Vitus J. and Meijer, Henk and Phillips, Cynthia A.},
TITLE = {Communication-aware processor allocation for supercomputers: Finding point sets of small average distance},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {2},
PAGES = {279-298},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9037-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wu-Hsiao-Chao/08,
AUTHOR = {Wu, Bang Ye and Hsiao, Chih-Yuan and Chao, Kun-Mao},
TITLE = {The swap edges of a multiple-sources routing tree},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {3},
PAGES = {299-311},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9080-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Uthaisombut/08,
AUTHOR = {Uthaisombut, Patchrawat ``Patch''},
TITLE = {Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {3},
PAGES = {312-328},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9083-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berenbrink-Friedetzky-Martin/08,
AUTHOR = {Berenbrink, Petra and Friedetzky, Tom and Martin, Russell},
TITLE = {On the stability of dynamic diffusion load balancing},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {3},
PAGES = {329-350},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9081-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cole-Kowalik/08,
AUTHOR = {Cole, Richard and Kowalik, {\L}ukasz},
TITLE = {New linear-time algorithms for edge-coloring planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {3},
PAGES = {351-368},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9044-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berry-Peng-Ting/08,
AUTHOR = {Berry, V. and Peng, Z.S. and Ting, H.F.},
TITLE = {From constrained to unconstrained maximum agreement subtree in linear time},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {3},
PAGES = {369-385},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9084-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reinbacher-Benkert-van_Kreveld-Mitchell-Snoeyink-Wolff/08,
AUTHOR = {Reinbacher, Iris and Benkert, Marc and van Kreveld, Marc and Mitchell, Joseph S.B. and Snoeyink, Jack and Wolff, Alexander},
TITLE = {Delineating boundaries for imprecise regions},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {3},
PAGES = {386-414},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9042-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bhatnagar-Randall-Vazirani-Vigoda/08,
AUTHOR = {Bhatnagar, Nayantara and Randall, Dana and Vazirani, Vijay V. and Vigoda, Eric},
TITLE = {Random bichromatic matchings},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {418-445},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9096-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bollobas-Kindler-Leader-ODonnell/08,
AUTHOR = {Bollob{\'a}s, B{\'e}la and Kindler, Guy and Leader, Imre and O'Donnell, Ryan},
TITLE = {Eliminating cycles in the discrete torus},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {446-454},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9095-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chrobak-Kenyon-Noga-Young/08,
AUTHOR = {Chrobak, Marek and Kenyon, Claire and Noga, John and Young, Neal E.},
TITLE = {Incremental medians via online bidding},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {455-478},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9005-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gopalan-Guruswami-Lipton/08,
AUTHOR = {Gopalan, Parikshit and Guruswami, Venkatesan and Lipton, Richard J.},
TITLE = {Algorithms for modular counting of roots of multivariate polynomials},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {479-496},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9097-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lhote-Vallee/08,
AUTHOR = {Lhote, Lo{\"{i}}ck and Vall{\'e}e, Brigitte},
TITLE = {Gaussian laws for the main parameters of the Euclid algorithms},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {497-554},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9009-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sakashita-Makino-Fujishige/08,
AUTHOR = {Sakashita, Mariko and Makino, Kazuhisa and Fujishige, Satoru},
TITLE = {Minimum cost source location problems with flow requirements},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {555-583},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9012-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Baran-Demaine-Patrascu/08,
AUTHOR = {Baran, Ilya and Demaine, Erik D. and P{\v{a}}tra{\c{s}}cu, Mihai},
TITLE = {Subquadratic algorithms for 3SUM},
JOURNAL = {Algorithmica},
VOLUME = {50},
NUMBER = {4},
PAGES = {584-596},
YEAR = {2008},
EDITOR = {Kao, Ming-Yang},
URL = {http://dx.doi.org/10.1007/s00453-007-9036-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}