@article{Damian-Pemmaraju/04,
AUTHOR = {Damian, Mirela and Pemmaraju, Sriram V.},
TITLE = {Computing optimal diameter-bounded polygon partitions},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {1},
PAGES = {1-14},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {diameter-bounded, polygon decomposition, approximation algorithm},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1092-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dujmovic-Whitesides/04,
AUTHOR = {Dujmovi{\'c}, Vida and Whitesides, Sue},
TITLE = {An efficient fixed parameter tractable algorithm for 1-sided crossing minimization},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {1},
PAGES = {15-31},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {graph drawing, fpt, fixed parameter tractability, sided crossing minimization, layer crossing minimization, $NP$-completeness, layer drawings, level drawings},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1093-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Manzini-Ferragina/04,
AUTHOR = {Manzini, Giovanni and Ferragina, Paolo},
TITLE = {Engineering a lightweight suffix array construction algorithm},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {1},
PAGES = {33-50},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {suffix array, algorithmic engineering, space-economical algorithms, full-text index, suffix tree},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1094-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berger-Gritzmann-de_Vries/04,
AUTHOR = {Berger, Franziska and Gritzmann, Peter and de Vries, Sven},
TITLE = {Minimum cycle bases for network graphs},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {1},
PAGES = {51-62},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {graph cycle, minimum cycle basis, matroid, electrical network},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1098-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Papadopoulou/04,
AUTHOR = {Papadopoulou, Evanthia},
TITLE = {The Hausdorff Voronoi diagram of point clusters in the plane},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {2},
PAGES = {63-82},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {voronoi diagram, hausdorff distance, plane sweep, vlsi yield prediction, vlsi critical area, manufacturing defects, via-blocks},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1095-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Firesen-Jia-Kanj/04,
AUTHOR = {Chen, Jianer and Firesen, Donald K. and Jia, Weijia and Kanj, Iyad A.},
TITLE = {Using nondeterminism to design efficient deterministic algorithms},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {2},
PAGES = {83-97},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {three-dimensional matching, parameterized algorithms, nondeterministic algorithms},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1096-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ban-Bereg-Mustafa/04,
AUTHOR = {Ban, Yih-En Andrew and Bereg, Sergey and Mustafa, Nabil H.},
TITLE = {A conjecture on Wiener indices in combinatorial chemistry},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {2},
PAGES = {99-117},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {wiener index, combinatorial chemistry, matrix searching, graph theory},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1097-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nardelli-Proietti-Widmayer/04,
AUTHOR = {Nardelli, Enrico and Proietti, Guido and Widmayer, Peter},
TITLE = {Nearly linear time minimum spanning tree maintenance for transient node failures},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {2},
PAGES = {119-132},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {graph algorithms, minimum spanning tree, transient node failures, fault tolerance, algorithmic mechanism design},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1099-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Peczarski/04,
AUTHOR = {Peczarski, Marcin},
TITLE = {New results in minimum-comparison sorting},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {2},
PAGES = {133-145},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {optimal sorting, the ford-johnson algorithm, counting linear extensions},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1100-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Efrat-Indyk-Venkatasubramanian/04,
AUTHOR = {Efrat, Alon and Indyk, Piotr and Venkatasubramanian, Suresh},
TITLE = {Pattern matching for sets of segments},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {3},
PAGES = {147-160},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {pattern matching, orthogonal segments, maximum coverage, computational geometry},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1089-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Qian-Wang/04,
AUTHOR = {Qian, Jianbo and Wang, Cao An},
TITLE = {A linear-time approximation scheme for maximum weight triangulation of convex polygons},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {3},
PAGES = {161-172},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {algorithm, approximation scheme, convex polygon, maximum weight triangulation},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1101-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kohayakawa-Miyazawa-Raghavan-Wakabayashi/04,
AUTHOR = {Kohayakawa, Yoshiharu and Miyazawa, Flavio Keidi and Raghavan, Prabhakar and Wakabayashi, Yoshiko},
TITLE = {Multidimensional cube packing},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {3},
PAGES = {173-187},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {approximation algorithms, multidimensional bin packing, asymptotic performance},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1102-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arora-Chang/04,
AUTHOR = {Arora, Sanjeev and Chang, Kevin},
TITLE = {Approximation schemes for degree-restricted MST and red-blue separation problems},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {3},
PAGES = {189-210},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {approximation algorithm, degree-restricted minimum spanning tree, low degree},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1103-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Demaine-Hajiaghayi/04,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Diameter and treewidth in minor-closed graph families, revisited},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {3},
PAGES = {211-215},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {apex graphs, graph minors, bounded local treewidth, graph algorithms, approximation algorithms},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1106-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Feige-Lovasz-Tetali/04,
AUTHOR = {Feige, Uriel and Lov{\'a}sz, L{\'a}szl{\'o} and Tetali, Prasad},
TITLE = {Approximating min sum set cover},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {219-234},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {greedy algorithm, randomized rounding, $NP$-hardness, threshhold},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1110-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Malafiejski-Giaro-Janczewski-Kubale/04,
AUTHOR = {Ma{\l}afiejski, Micha{\l} and Giaro, Krzysztof and Janczewski, Robert and Kubale, Marek},
TITLE = {Sum coloring of bipartite graphs with bounded degree},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {235-244},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {sum coloring, chromatic sum, bipartite graphs},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1111-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Swamy-Kumar/04,
AUTHOR = {Swamy, Chaitanya and Kumar, Amit},
TITLE = {Prima-dual algorithms for connected facility location problems},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {245-269},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {approximation algorithms, primal-dual algorithms, facility location, connected facility location, steiner trees},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1112-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Angelopoulos-Borodin/04,
AUTHOR = {Angelopoulos, Spyros and Borodin, Allan},
TITLE = {The power of priority algorithms for facility location and set cover},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {271-291},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {greedy algorithms, approximation lower bounds},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1113-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lewin-Eytan-Naor-Orda/04,
AUTHOR = {Lewin-Eytan, Liane and Naor, Joseph (Seffi) and Orda, Ariel},
TITLE = {Admission control in networks with advance reservations},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {293-304},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {line network, approximation algorithms, independent set, local ratio, axis parallel rectangles, advance reservations},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1114-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bansal-Dhamdhere-Konemann-Sinha/04,
AUTHOR = {Bansal, Nikhil and Dhamdhere, Kedar and K{\"o}nemann, Jochen and Sinha, Amitabh},
TITLE = {Non-clairvoyant scheduling for minimizing mean slowdown},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {305-318},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {scheduling, slowdown, online algorithms, non-clairvoyant algorithms, resource augmentation},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1115-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lipmann-Lu-de_Paepe-Sitters-Stougie/04,
AUTHOR = {Lipmann, Maarten and Lu, Xiwen and de Paepe, Willem E. and Sitters, Rene A. and Stougie, Leen},
TITLE = {On-line dial-a-ride problems under a restricted information model},
JOURNAL = {Algorithmica},
VOLUME = {40},
NUMBER = {4},
PAGES = {319-329},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {on-line optimization, competitive analysis, dial-a-ride},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1116-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Shibuya/04,
AUTHOR = {Shibuya, Tetsuo},
TITLE = {Generalization of a suffix tree for RNA structural pattern matching},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {1},
PAGES = {1-19},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {pattern matching, suffix tree generalization, parameterized suffix tree, computational biology, rna structure matching},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1067-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Martel-Nuckolls-Devanbu-Gertz-Kwong-Stubblebine/04,
AUTHOR = {Martel, Charles and Nuckolls, Glen and Devanbu, Premkumar and Gertz, Michael and Kwong, April and Stubblebine, Stuart G.},
TITLE = {A general model for authenticated data structures},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {1},
PAGES = {21-41},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {authentic publication, database integrity, data structures, security},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1076-8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Epstein-Sgall/04,
AUTHOR = {Epstein, Leah and Sgall, Ji{\v{r}}{\'{\i}}},
TITLE = {Approximation schemes for scheduling on uniformly related and identical parallel machines},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {1},
PAGES = {43-57},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {scheduling, approximation algorithms, parallel machines, machine completion time, polynomial time approximation scheme},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1077-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jansen/04,
AUTHOR = {Jansen, Klaus},
TITLE = {Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {1},
PAGES = {59-81},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {scheduling, malleable tasks, approximation algorithms},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1078-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yanev-Foschi-Kontoghiorghes/04,
AUTHOR = {Yanev, Petko and Foschi, Paolo and Kontoghiorghes, Erricos John},
TITLE = {Algorithms for computing the $QR$ decomposition of a set of matrices with common columns},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {1},
PAGES = {83-93},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {$QR$ decomposition, givens rotations, minimum spanning tree},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1080-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nikolopoulos-Palios/04,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas},
TITLE = {Algorithms for $P_4$-comparability graph recognition and acyclic $P_4$-transitive orientation},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {2},
PAGES = {95-126},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {perfectly orderable graph, comparability graph, $P_4$-comparability graph, $P_4$-component, recognition, $P_4$-transitive orientation},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1075-9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Reif-Sun/04,
AUTHOR = {Reif, John H. and Sun, Zheng},
TITLE = {Movement planning in the presence of flows},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {2},
PAGES = {127-153},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {robotics, path planning, optimization, shortest path},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-003-1079-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Poon-Zhang/04,
AUTHOR = {Poon, Chung Keung and Zhang, Pixing},
TITLE = {Minimizing makespan in batch machine scheduling},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {2},
PAGES = {155-174},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {scheduling, makespan, batch machine, dynamic job arrival},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1083-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Arkin-Hassin-Rubinstein-Sviridenko/04,
AUTHOR = {Arkin, Esther M. and Hassin, Refael and Rubinstein, Shlomi and Sviridenko, Maxim},
TITLE = {Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {2},
PAGES = {175-187},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {transportation problem, approximation algorithm, $NP$-complete problem},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1087-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ahuja-Hochbaum-Orlin/04,
AUTHOR = {Ahuja, Ravindra K. and Hochbaum, Dorit S. and Orlin, James B.},
TITLE = {A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {3},
PAGES = {189-208},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {nonlinear integer programming, convex integer programming, total unimodularity, minimum cut, network flow},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1085-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kolman-Scheideler/04,
AUTHOR = {Kolman, Petr and Scheideler, Christian},
TITLE = {Simple on-line algorithms for the maximum disjoint paths problem},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {3},
PAGES = {209-233},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {disjoint paths problem, approximation, greedy algorithms, randomized algorithms, unsplittable flow},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1086-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wood/04,
AUTHOR = {Wood, David R.},
TITLE = {Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {3},
PAGES = {235-253},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {graph drawing, orthogonal, dimensional, diagonal layout, vertex-ordering, book embedding},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1091-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhou-Muller/04,
AUTHOR = {Zhou, Jianjun and M{\"u}ller, Martin},
TITLE = {Solving systems of difference constraints incrementally with bidirectional search},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {3},
PAGES = {255-274},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {incremental algorithm, difference constraints, bidirectional search, shortest-path algorithm, computational complexity},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1081-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Buchsbaum-Goodrich/04,
AUTHOR = {Buchsbaum, Adam L. and Goodrich, Michael T.},
TITLE = {Three-dimensional layers of maxima},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {4},
PAGES = {275-286},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {fractional cascading, layers of maxima, planar point location},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1082-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Berry-Blair-Heggernes-Peyton/04,
AUTHOR = {Berry, Anne and Blair, Jean R.S. and Heggernes, Pinar and Peyton, Barry W.},
TITLE = {Maximum cardinality search for computing minimal triangulations of graphs},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {4},
PAGES = {287-298},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {chordal graphs, minimal triangulations, minimal elimination ordering, minimal fill},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1084-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Broden-Hammar-Nilsson/04,
AUTHOR = {Brod{\'e}n, Bj{\"o}rn and Hammar, Mikael and Nilsson, Bengt J.},
TITLE = {Online and offline algorithms for the time-dependent TSP with time zones},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {4},
PAGES = {299-319},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {online algorithms, the traveling salesman problem, time dependencies, the orienteering problem},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1088-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gramm-Guo-Huffner-Niedermeier/04,
AUTHOR = {Gramm, Jens and Guo, Jiong and H{\"u}ffner, Falk and Niedermeier, Rolf},
TITLE = {Automated generation of search tree algorithms for hard graph modification problems},
JOURNAL = {Algorithmica},
VOLUME = {39},
NUMBER = {4},
PAGES = {321-347},
YEAR = {2004},
EDITOR = {Wong, C.K.},
KEYWORDS = {$NP$-hard problems, graph modification, search tree algorithms, exact algorithms, automated development and analysis of algorithms, algorithm engineering},
URL = {http://springerlink.metapress.com/index/10.1007/s00453-004-1090-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eckhardt-Reiter/04,
AUTHOR = {Eckhardt, Ulrich and Reiter, Helene},
TITLE = {Polygonal representations of digital sets},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {5-23},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1040-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sivignon-Dupont-Chassery/04,
AUTHOR = {Sivignon, Isabelle and Dupont, Florent and Chassery, Jean-Marc},
TITLE = {Decomposition of a three-dimensional discrete object surface into discrete plane pieces},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {25-43},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1041-6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alt-Knauer-Wenk/04,
AUTHOR = {Alt, Helmut and Knauer, Christian and Wenk, Carola},
TITLE = {Comparison of distance measures for planar curves},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {45-58},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1042-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gavrilov-Indyk-Motwani-Venkatasubramanian/04,
AUTHOR = {Gavrilov, Martin and Indyk, Piotr and Motwani, Rajeev and Venkatasubramanian, Suresh},
TITLE = {Combinatorial and experimental methods for approximate point pattern matching},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {59-90},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1043-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rosenhahn-Perwass-Sommer/04,
AUTHOR = {Rosenhahn, Bodo and Perwass, Christian and Sommer, Gerald},
TITLE = {Free-form pose estimation by using twist representations},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {91-113},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1044-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chew-Kedem/04,
AUTHOR = {Chew, L. Paul and Kedem, Klara},
TITLE = {Finding the consensus shape for a protein family},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {115-129},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1045-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Daescu/04,
AUTHOR = {Daescu, Ovidiu},
TITLE = {New results on path approximation},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {131-143},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1046-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Efrat-Hoffmann-Knauer-Kriegel-Rote-Wenk/04,
AUTHOR = {Efrat, Alon and Hoffmann, Frank and Knauer, Christian and Kriegel, Klaus and Rote, G{\"u}nter and Wenk, Carola},
TITLE = {Covering with ellipses},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {145-160},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1047-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Morin/04,
AUTHOR = {Bose, Prosenjit and Morin, Pat},
TITLE = {Testing the quality of manufactured disks and balls},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {161-177},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1048-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dey-Zhao/04,
AUTHOR = {Dey, Tamal K. and Zhao, Wulue},
TITLE = {Approximating the medial axis from the Voronoi diagram with a convergence guarantee},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {179-200},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1049-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kazhdan-Chazelle-Dobkin-Funkhouser-Rusinkiewicz/04,
AUTHOR = {Kazhdan, Michael and Chazelle, Bernard and Dobkin, David and Funkhouser, Thomas and Rusinkiewicz, Szymon},
TITLE = {A reflective symmetry descriptor for 3D models},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {201-225},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1050-5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mortara-Patane-Spagnuolo-Falcidieno-Rossignac/04,
AUTHOR = {Mortara, Michela and Patan{\`e}, Giuseppe and Spagnuolo, Michela and Falcidieno, Bianca and Rossignac, Jarek},
TITLE = {Blowing bubbles for multi-scale analysis and decomposition of triangle meshes},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {227-248},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1051-4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pascucci-Cole-McLaughlin/04,
AUTHOR = {Pascucci, Valerio and Cole-McLaughlin, Kree},
TITLE = {Parallel computation of the topology of level sets},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {1},
PAGES = {249-268},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1052-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhou-Nishizeki/04,
AUTHOR = {Zhou, Xiao and Nishizeki, Takao},
TITLE = {Multicolorings of series-parallel graphs},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {271-297},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1060-3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Wu/04,
AUTHOR = {Chen, Danny Z. and Wu, Xiadong},
TITLE = {Efficient algorithms for $k$-terminal cuts on planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {299-316},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1061-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bremner-Hurtado-Ramaswami-Sacristan/04,
AUTHOR = {Bremner, David and Hurtado, Ferran and Ramaswami, Suneeta and Sacrist{\'a}n, Vera},
TITLE = {Small strictly convex quadrilateral meshes of point sets},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {317-339},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1062-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Poon-Shin-Strijk-Uno-Wolff/04,
AUTHOR = {Poon, Sheung-Hung and Shin, Chan-Su and Strijk, Tycho and Uno, Takeaki and Wolff, Alexander},
TITLE = {Labeling points with weights},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {341-362},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1063-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fleischer-Koga/04,
AUTHOR = {Fleischer, Rudolf and Koga, Hisashi},
TITLE = {Balanced scheduling toward loss-free packet queuing and delay fairness},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {363-376},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1064-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Brodal-Fagerberg-Pedersen/04,
AUTHOR = {Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Pedersen, Christian N.S.},
TITLE = {Computing the quartet distance between evolutionary trees in time $O(n \log n)$},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {377-395},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1065-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lin/04,
AUTHOR = {Lin, Xuemin},
TITLE = {Delay optimization in quorum consensus},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {2},
PAGES = {397-413},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1066-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hassin-Ravi-Salman/04,
AUTHOR = {Hassin, Refael and Ravi, R. and Salman, F. Sibel},
TITLE = {Approximation algorithms for a capacitated network design problem},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {417-431},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1069-7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jain-Vazirani/04,
AUTHOR = {Jain, Kamal and Vazirani, Vijay V.},
TITLE = {An approximation algorithm for the fault tolerant metric facility location problem},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {433-439},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1070-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Konemann-Konjevod-Parekh-Sinha/04,
AUTHOR = {K{\"o}nemann, Jochen and Konjevod, Goran and Parekh, Ojas and Sinha, Amitabh},
TITLE = {Improved approximations for tour and tree covers},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {441-449},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1071-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Guruswami/04,
AUTHOR = {Guruswami, Venkatesan},
TITLE = {Inapproximability results for set splitting and satisfiability problems with no mixed clauses},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {451-469},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1072-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dyer-Goldberg-Greenhill-Jerrum/04,
AUTHOR = {Dyer, Martin and Goldberg, Leslie Ann and Greenhill, Catherine and Jerrum, Mark},
TITLE = {The relative complexity of approximate counting problems},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {471-500},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1073-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fekete-Meijer/04,
AUTHOR = {Fekete, S{\'a}ndor P. and Meijer, Henk},
TITLE = {Maximum dispersion and geometric maximum weight cliques},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {3},
PAGES = {501-511},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1074-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Deng-Feng-Zhang-Zhang-Zhu/04,
AUTHOR = {Deng, Xiaotie and Feng, Haodi and Zhang, Pixing and Zhang, Yuzhong and Zhu, Hong},
TITLE = {Minimizing mean completion time in a batch processing system},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {4},
PAGES = {513-528},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1053-2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cai-Deng-Wang/04,
AUTHOR = {Cai, Mao-cheng and Deng, Xiaotie and Wang, Lusheng},
TITLE = {Minimum $k$ arborescences with bandwidth constraints},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {4},
PAGES = {529-537},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1054-1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-He/04,
AUTHOR = {Chen, Zhi-Zhong and He, Xin},
TITLE = {Disk embeddings of planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {4},
PAGES = {539-576},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1055-0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Spriggs-Keil-Bespamyatnikh-Segal-Snoeyink/04,
AUTHOR = {Spriggs, Michael J. and Keil, J. Mark and Bespamyatnikh, Sergei and Segal, Michael and Snoeyink, Jack},
TITLE = {Computing a $(1+\epsilon)$-approximate geometric minimum-diameter spanning tree},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {4},
PAGES = {577-589},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1056-z},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chazal-Maume-Deschamps-Vallee/04,
AUTHOR = {Chazal, Fr{\'e}deric and Maume-Deschamps, V{\'e}ronique and Vall{\'e}e, Brigitte},
TITLE = {Erratum to ''Dynamical sources in information theory: Fundamental intervals and word prefixes''},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {4},
PAGES = {591-596},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1057-y},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
NOTE = {Originally in Algorithmica, Vol. 29, 2001, 262-306},
}
@article{Gandhi-Khuller-Kim-Wan/04,
AUTHOR = {Gandhi, Rajiv and Khuller, Samir and Kim, Yoo-Ah and Wan, Yung-Chun (Justin)},
TITLE = {Algorithms for minimizing response time in broadcast scheduling},
JOURNAL = {Algorithmica},
VOLUME = {38},
NUMBER = {4},
PAGES = {597-608},
YEAR = {2004},
EDITOR = {Wong, C.K.},
URL = {DOI:10.1007/s00453-003-1058-x},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}