@article{Goel-Estrin/05,
AUTHOR = {Goel, Ashish and Estrin, Deborah},
TITLE = {Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {5-15},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1155-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chekuri-Gupta-Kumar-Naor-Raz/05,
AUTHOR = {Chekuri, Chandra and Gupta, A. and Kumar, Amit and Naor, J. and Raz, Danny},
TITLE = {Building edge-failure resilient networks},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {17-41},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1156-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Erlebach-Stefanakos/05,
AUTHOR = {Erlebach, Thomas and Stefanakos, Stamatis},
TITLE = {Wavelength conversion in all-optical networks with shortest-path routing},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {43-61},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1157-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kesselman-Mansour-van_Stee/05,
AUTHOR = {Kesselman, Alex and Mansour, Yishay and van Stee, Rob},
TITLE = {Improved competitive guarantees for QoS buffering},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {63-80},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1158-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Azar-Richter/05,
AUTHOR = {Azar, Yossi and Richter, Yossi},
TITLE = {Management of multi-queue switches in QoS networks},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {81-96},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1159-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kesselman-Mansour/05,
AUTHOR = {Kesselman, Alex and Mansour, Yishay},
TITLE = {Adaptive AIMD congestion control},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {97-111},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1160-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fong-Gilbert-Kannan-Strauss/05,
AUTHOR = {Fong, Jessica H. and Gilbert, Anna C. and Kannan, Sampath and Strauss, Martin J.},
TITLE = {Better alternatives to OSFP routing},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {113-131},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1161-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sethuraman-Teo/05,
AUTHOR = {Sethuraman, Jay and Teo, Chung-Piaw},
TITLE = {Effective routing and scheduling in adversarial queueing networks},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {1-2},
PAGES = {133-146},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1162-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Kouno/05,
AUTHOR = {Chen, Zhi-Zhong and Kouno, Mitsuharu},
TITLE = {A linear-time algorithm for 7-coloring 1-plane graphs},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {3},
PAGES = {147-177},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1134-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Efraty-Landau/05,
AUTHOR = {Efraty, Nadav and Landau, Gad M.},
TITLE = {Sparse normalized local alignment},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {3},
PAGES = {179-194},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1152-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kim-Guibas-Shin/05,
AUTHOR = {Kim, Ho Kyung and Guibas, Leonidas J. and Shin, Sung Yong},
TITLE = {Efficient collision detection among moving spheres with unknown trajectories},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {3},
PAGES = {195-210},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1153-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Milenkovic-Compton/05,
AUTHOR = {Milenkovic, Olgica and Compton, Kevin J.},
TITLE = {Average case analysis of Gosper's algorithm for a class of urn model inputs},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {3},
PAGES = {211-244},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1173-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Kanj-Xia/05,
AUTHOR = {Chen, Jianer and Kanj, Iyad A. and Xia, Ge},
TITLE = {Labeled search trees and amortized analysis: Improved upper bounds for $NP$-hard problems},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {4},
PAGES = {245-273},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1145-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Benoit-Demaine-Munro-Raman-Raman-Rao/05,
AUTHOR = {Benoit, David and Demaine, Erik D. and Munro, J. Ian and Raman, Rajeev and Raman, Venkatesh and Rao, S. Srinivasa},
TITLE = {Representing trees of higher degree},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {4},
PAGES = {275-292},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1146-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jansson-Ng-Sadakane-Sung/05,
AUTHOR = {Jansson, Jesper and Ng, Joseph H.-K. and Sadakane, Kunihiko and Sung, Wing-Kin},
TITLE = {Rooted maximum agreement supertrees},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {4},
PAGES = {293-307},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1147-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kallahalla-Varman/05,
AUTHOR = {Kallahalla, Mahesh and Varman, Peter J.},
TITLE = {Optimal read-once parallel disk scheduling},
JOURNAL = {Algorithmica},
VOLUME = {43},
NUMBER = {4},
PAGES = {309-343},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1129-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Iacono/05,
AUTHOR = {Iacono, John},
TITLE = {Key-independent optimality},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {3-10},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1136-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Devroye/05,
AUTHOR = {Devroye, Luc},
TITLE = {Universal asymptotics for random tries and PATRICIA trees},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {11-29},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1137-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bagchi-Buchsbaum-Goodrich/05,
AUTHOR = {Bagchi, Amitabha and Buchsbaum, Adam L. and Goodrich, Michael T.},
TITLE = {Biased skip lists},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {31-48},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1138-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Iacono-Langerman/05,
AUTHOR = {Iacono, John and Langerman, Stefan},
TITLE = {Queaps},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {49-56},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1139-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hartline-Hong-Mohr-Pentney-Rocke/05,
AUTHOR = {Hartline, Jason D. and Hong, Edwin S. and Mohr, Alexander E. and Pentney, William R. and Rocke, Emily C.},
TITLE = {Characterizing history independent data structures},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {57-74},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1140-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guha-Tran/05,
AUTHOR = {Guha, Sumanta and Tran, Son Dinh},
TITLE = {Reconstructing curves without Delaunay computation},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {75-94},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1141-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fujiwara-Iwama/05,
AUTHOR = {Fujiwara, Hiroshi and Iwama, Kazuo},
TITLE = {Average-case competitive analyses for ski-rental problems},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {1},
PAGES = {95-107},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1142-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karpinski-Mandoiu-Olshevsky-Zelikovsky/05,
AUTHOR = {Karpinski, Marek and M{\u{a}}ndoiu, Ion I. and Olshevsky, Alexander and Zelikovsky, Alexander},
TITLE = {Improved approximation algorithms for the quality of service multicast tree problem},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {2},
PAGES = {109-120},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1133-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Blaser-Manthey/05,
AUTHOR = {Bl{\"a}ser, Markus and Manthey, Bodo},
TITLE = {Approximating maximum weight cycle covers in directed graphs with weights zero and one},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {2},
PAGES = {121-139},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1131-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ohta-Sadakane-Shioura-Tokuyama/05,
AUTHOR = {Ohta, Ken'ichiro and Sadakane, Kunihiko and Shioura, Akiyoshi and Tokuyama, Takeshi},
TITLE = {A fast, accurate, and simple method for pricing European-Asian and Saving-Asian options},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {2},
PAGES = {141-158},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1143-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hong-Eades/05,
AUTHOR = {Hong, Seok-Hee and Eades, Peter},
TITLE = {Drawing planar graphs symmetrically, II: Biconnected planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {2},
PAGES = {159-197},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-004-1132-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Har-Peled-Mustafa-Wang/05,
AUTHOR = {Agarwal, Pankaj K. and Har-Peled, Sariel and Mustafa, Nabil H. and Wang, Yusu},
TITLE = {Near-linear time approximation algorithms for curve simplification},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {203-219},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1165-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Procopiuc-Varadarajan/05,
AUTHOR = {Agarwal, Pankaj K. and Procopiuc, Cecilia M. and Varadarajan, Kasturi R.},
TITLE = {Approximation algorithms for a $k$-line center},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {221-230},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1166-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Baier-Kohler-Skutella/05,
AUTHOR = {Baier, Georg and K{\"o}hler, Ekkehard and Skutella, Martin},
TITLE = {The $k$-splittable flow problem},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {231-248},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1167-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Gudmundsson-Smid/05,
AUTHOR = {Bose, Prosenjit and Gudmundsson, Joachim and Smid, Michiel},
TITLE = {Constructing plane spanners of bounded degree and low weight},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {249-264},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1168-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Hu-Luan-Wu-Yu/05,
AUTHOR = {Chen, Danny Z. and Hu, Xiaobo S. and Luan, Shuang and Wu, Xiadong and Yu, Cedric X.},
TITLE = {Optimal terrain construction problems and applications in intensity-modulated radiation therapy},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {265-288},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1169-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pruhs-Uthaisombut/05,
AUTHOR = {Pruhs, Kirk R. and Uthaisombut, Patchrawat},
TITLE = {A comparison of multicast pull models},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {289-307},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1170-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Shachnai-Tamir-Woeginger/05,
AUTHOR = {Shachnai, Hadas and Tamir, Tami and Woeginger, Gerhard J.},
TITLE = {Minimizing makespan and preemption costs on a system of uniform machines},
JOURNAL = {Algorithmica},
VOLUME = {42},
NUMBER = {3-4},
PAGES = {309-334},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&id=doi:10.1007/s00453-005-1171-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Finocchi-Panconesi-Silvestri/05,
AUTHOR = {Finocchi, Irene and Panconesi, Alessandro and Silvestri, Riccardo},
TITLE = {An experimental analysis of simple, distributed vertex coloring algorithms},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {1},
PAGES = {1-23},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {distributed graph algorithms, vertex coloring, algorithm engineering},
URL = {http://dx.doi.org/10.1007/s00453-004-1104-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Feigenbaum-Kannan-Zhang/05,
AUTHOR = {Feigenbaum, Joan and Kannan, Sampath and Zhang, Jian},
TITLE = {Computing diameter in the streaming and sliding-window models},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {1},
PAGES = {25-41},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {massive data streams, sliding window, diameter},
URL = {http://dx.doi.org/10.1007/s00453-004-1105-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hassin-Levin/05,
AUTHOR = {Hassin, Refael and Levin, Asaf},
TITLE = {Approximation algorithms for quickest spanning tree problems},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {1},
PAGES = {43-52},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {approximation algorithms, quickest path problem, minimum diameter spanning tree problem},
URL = {http://dx.doi.org/10.1007/s00453-004-1118-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Xue-Xiao/05,
AUTHOR = {Xue, Guoliang and Xiao, Wei},
TITLE = {A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {1},
PAGES = {53-72},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {computer communications, minimum cost delay-constrained network under a steiner topology, fully polynomial time approximation scheme, quality of service},
URL = {http://dx.doi.org/10.1007/s00453-004-1119-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fomin-Heggernes-Telle/05,
AUTHOR = {Fomin, Fedor V. and Heggernes, Pinar and Telle, Jan Arne},
TITLE = {Graph searching, elimination trees, and a generalization of bandwidth},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {2},
PAGES = {73-87},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {bandwidth, graph searching, elimination tree, tree decomposition, chordal graph},
URL = {http://dx.doi.org/10.1007/s00453-004-1117-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Navarro-Raffinot/05,
AUTHOR = {Navarro, Gonzalo and Raffinot, Mathieu},
TITLE = {New techniques for regular expression searching},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {2},
PAGES = {89-116},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {glushkov automaton, compact dfa representation, bit-parallelism, bdm, reverse factors},
URL = {http://dx.doi.org/10.1007/s00453-004-1120-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Konemann-Levin-Sinha/05,
AUTHOR = {K{\"o}nemann, Jochen and Levin, Asaf and Sinha, Amitabh},
TITLE = {Approximating the degree-bounded minimum diameter spanning tree problem},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {2},
PAGES = {117-129},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {approximation algorithms, spanning trees, bicriteria approximation, degree-bounded spanning trees},
URL = {http://dx.doi.org/10.1007/s00453-004-1121-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Duin/05,
AUTHOR = {Duin, Cees},
TITLE = {A branch-checking algorithm for all-pairs shortest paths},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {2},
PAGES = {131-145},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {dynamic programming, shortest path, shortest path tree},
URL = {http://dx.doi.org/10.1007/s00453-004-1122-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Har-Peled-Mazumdar/05,
AUTHOR = {Har-Peled, Sariel and Mazumdar, Soham},
TITLE = {Fast algorithms for computing the smallest $k$-enclosing circle},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {3},
PAGES = {147-157},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {clustering, shape fitting, outliers},
URL = {http://dx.doi.org/10.1007/s00453-004-1123-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Koltun-Wenk/05,
AUTHOR = {Koltun, Vladlen and Wenk, Carola},
TITLE = {Matching polyhedral terrains using overlays of envelopes},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {3},
PAGES = {159-183},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {arrangements, overlays of envelopes, polyhedral terrains, matching},
URL = {http://dx.doi.org/10.1007/s00453-004-1107-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Har-Peled-Sadri/05,
AUTHOR = {Har-Peled, Sariel and Sadri, Bardia},
TITLE = {How fast is the $k$-means method?},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {3},
PAGES = {185-202},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {clustering, classification, means method},
URL = {http://dx.doi.org/10.1007/s00453-004-1127-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hyyro-Navarro/05,
AUTHOR = {Hyyr{\"o}, Heikki and Navarro, Gonzalo},
TITLE = {Bit-parallel witnesses and their applications to approximate string matching},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {3},
PAGES = {203-231},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {bit-parallelism, backward dawg matching, Myer's bit-parallel algorithm, average-optimal string matching allowing errors},
URL = {http://dx.doi.org/10.1007/s00453-004-1108-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Carmi-Dolev-Har-Peled-Katz-Segal/05,
AUTHOR = {Carmi, Paz and Dolev, Shlomi and Har-Peled, Sariel and Katz, Matthew J. and Segal, Michael},
TITLE = {Geographic quorum system approximations},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {4},
PAGES = {233-244},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {geometric optimization, clustering, quorum system},
URL = {http://dx.doi.org/10.1007/s00453-004-1130-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Demaine-Hajiaghayi-Thilikos/05,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammadtaghi and Thilikos, Dimitrios M.},
TITLE = {Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {4},
PAGES = {245-267},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {subexponential algorithms, graph minors, dominating set},
URL = {http://dx.doi.org/10.1007/s00453-004-1125-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dumitrescu-Wu/05,
AUTHOR = {Dumitrescu, Sorina and Wu, Xiaolin},
TITLE = {Optimal two-description scalar quantizer design},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {4},
PAGES = {269-287},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {quantization, multiple description signal representation, multimedia communications, monge property, matrix search, link shortest path},
URL = {http://dx.doi.org/10.1007/s00453-004-1126-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gutwenger-Mutzel-Weiskircher/05,
AUTHOR = {Gutwenger, Carsten and Mutzel, Petra and Weiskircher, Ren{\'e}},
TITLE = {Inserting an edge into a planar graph},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {4},
PAGES = {289-308},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {crossing minimization, combinatorial embeddings, planarization, graph drawing},
URL = {http://dx.doi.org/10.1007/s00453-004-1128-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chiang/05,
AUTHOR = {Chiang, Yi-Jen},
TITLE = {New approximation results for the maximum scatter TSP},
JOURNAL = {Algorithmica},
VOLUME = {41},
NUMBER = {4},
PAGES = {309-341},
YEAR = {2005},
EDITOR = {Kao, Ming-Yang},
KEYWORDS = {traveling salesperson problem (tsp), maximum scatter tsp, bottleneck tsp, hamiltonian cycle/path, approximation algorithms, matching, optimization},
URL = {http://dx.doi.org/10.1007/s00453-004-1124-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}