@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},
}