@article{Demaine-Lopez-Ortiz/03,
AUTHOR = {Demaine, Erik D. and L{\'o}pez-Ortiz, Alejandro},
TITLE = {A linear lower bound on index size for text retrieval},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {2-15},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00043-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Fiat-Kaplan/03,
AUTHOR = {Fiat, Amos and Kaplan, Haim},
TITLE = {Making data structures confluently persistent},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {16-58},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00044-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Bar-Noy-Ladner/03,
AUTHOR = {Bar-Noy, Amotz and Ladner, Richard E.},
TITLE = {Competitive on-line stream merging algorithms for media-on-demand},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {59-90},
YEAR = {2003},
KEYWORDS = {video-on-demand, stream merging, online algorithms, competitive analysis},
URL = {DOI:10.1016/S0196-6774(03)00045-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Meyer/03,
AUTHOR = {Meyer, Ulrich},
TITLE = {Average-case complexity of single-source shortest-paths algorithms: Lower and upper bounds},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {91-134},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00046-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Dumitrescu-Mitchell/03,
AUTHOR = {Dumitrescu, Adrian and Mitchell, Joseph S.B.},
TITLE = {Approximation algorithms for TSP with neighborhoods in the plane},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {135-159},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00047-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Raghavan-Spinrad/03,
AUTHOR = {Raghavan, Vijay and Spinrad, Jeremy},
TITLE = {Robust algorithms for restricted domains},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {160-172},
YEAR = {2003},
KEYWORDS = {algorithms, robustness, well-covered graphs, unit disk graphs},
URL = {DOI:10.1016/S0196-6774(03)00048-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{St_John-Warnow-Moret-Vawter/03,
AUTHOR = {St. John, Katherine and Warnow, Tandy and Moret, Bernard M.E. and Vawter, Lisa},
TITLE = {Performance study of phylogenetic methods: (Unweighted) quartet methods and neighbor-joining},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {173-193},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00049-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Althaus-Duchier-Koller-Mehlhorn-Niehren-Thiel/03,
AUTHOR = {Althaus, Ernst and Duchier, Denys and Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim and Thiel, Sven},
TITLE = {An efficient graph algorithm for dominance constraints},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {194-219},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00050-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Hassin-Levin/03,
AUTHOR = {Hassin, Refael and Levin, Asaf},
TITLE = {Minimum spanning tree with hop restrictions},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {220-238},
YEAR = {2003},
KEYWORDS = {minimum spanning tree, hop-restriction, approximation algorithm},
URL = {DOI:10.1016/S0196-6774(03)00051-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Caprara-Panconesi-Rizzi/03,
AUTHOR = {Caprara, Alberto and Panconesi, Alessandro and Rizzi, Romeo},
TITLE = {Packing cycles in undirected graphs},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {239-256},
YEAR = {2003},
KEYWORDS = {packing, edge-disjoint cycles, complexity, approximation, linear programming relaxation},
URL = {DOI:10.1016/S0196-6774(03)00052-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Guha-Hassin-Khuller-Or/03,
AUTHOR = {Guha, Sudipto and Hassin, Refael and Khuller, Samir and Or, Einat},
TITLE = {Capacitated vertex covering},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {1},
PAGES = {257-270},
YEAR = {2003},
KEYWORDS = {approximation algorithm, vertex cover, capacitated network design},
URL = {DOI:10.1016/S0196-6774(03)00053-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Vakhania/03,
AUTHOR = {Vakhania, Nodari},
TITLE = {A better algorithm for sequencing with release and delivery times on identical machines},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {273-293},
YEAR = {2003},
KEYWORDS = {scheduling, identical machines, release time},
URL = {DOI:10.1016/S0196-6774(03)00072-5},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Sadakane/03,
AUTHOR = {Sadakane, Kunihiko},
TITLE = {New text indexing functionalities of the compressed suffix arrays},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {294-313},
YEAR = {2003},
KEYWORDS = {text database, suffix array, compression},
URL = {DOI:10.1016/S0196-6774(03)00087-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Goel-Henzinger-Plotkin-Tardos/03,
AUTHOR = {Goel, Ashish and Henzinger, Monika R. and Plotkin, Serge and Tardos, Eva},
TITLE = {Scheduling data transfers in a network and the set scheduling problem},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {314-332},
YEAR = {2003},
KEYWORDS = {scheduling, flow time},
URL = {DOI:10.1016/S0196-6774(03)00054-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Calinescu-Fernandes-Reed/03,
AUTHOR = {C{\v{a}}linescu, Gruia and Fernandes, Cristina G. and Reed, Bruce},
TITLE = {Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {333-359},
YEAR = {2003},
KEYWORDS = {approximation algorithms, multicut, polynomial-time approximation schemes, tree-width},
URL = {DOI:10.1016/S0196-6774(03)00073-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Epstein-Tassa/03,
AUTHOR = {Epstein, Leah and Tassa, Tamir},
TITLE = {Vector assignment problems: A general framework},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {360-384},
YEAR = {2003},
KEYWORDS = {scheduling, bin packing, optimization, makespan, approximation schemes, PTAS},
URL = {DOI:10.1016/S0196-6774(03)00055-5},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Ferraro-Godin/03a,
AUTHOR = {Ferraro, Pascal and Godin, Christophe},
TITLE = {Optimal mappings with minimum number of connected components in tree-to-tree comparison problems},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {385-406},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00079-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Frederiksen-Larsen-Noga-Uthaisombut/03,
AUTHOR = {Frederiksen, Jens S. and Larsen, Kim S. and Noga, John and Uthaisombut, Patchrawat},
TITLE = {Dynamic TCP acknowledgment in the LogP model},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {407-428},
YEAR = {2003},
KEYWORDS = {dynamic TCP acknowledgment, packet bundling, online algorithms, competitive ratio, flow-time, deterministic, randomized},
URL = {DOI:10.1016/S0196-6774(03)00058-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Guha-Meyerson-Munagala/03,
AUTHOR = {Guha, Sudipto and Meyerson, Adam and Munagala, Kamesh},
TITLE = {A constant factor approximation algorithm for the fault-tolerant facility location problem},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {429-440},
YEAR = {2003},
KEYWORDS = {approximation algorithm, facility location, fault tolerance},
URL = {DOI:10.1016/S0196-6774(03)00056-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}
@article{Liao-Lu-Yen/03,
AUTHOR = {Liao, Chien-Chih and Lu, Hsueh-I and Yen, Hsu-Chun},
TITLE = {Compact floor-planning via orderly spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {48},
NUMBER = {2},
PAGES = {441-451},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00057-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
TYPE = {proceeding},
}