@article{Krivelevich-Sudakov/03,
AUTHOR = {Krivelevich, Michael and Sudakov, Benny},
TITLE = {Approximate coloring of uniform hypergraphs},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {2-12},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00077-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chen-Daescu-Hu-Xu/03,
AUTHOR = {Chen, Danny Z. and Daescu, Ovidiu and Hu, Xiaobo (Sharon) and Xu, Jinhui},
TITLE = {Finding an optimal path without growing the tree},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {13-41},
YEAR = {2003},
KEYWORDS = {Computational geometry, Optimal paths, Arrangements, Dynamic programming, Space-efficient algorithms},
URL = {DOI:10.1016/S0196-6774(03)00080-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hastad-Ivansson-Lagergren/03,
AUTHOR = {H{\aa}stad, Johan and Ivansson, Lars and Lagergren, Jens},
TITLE = {Fitting points on the real line and its application to RH mapping},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {42-62},
YEAR = {2003},
KEYWORDS = {Line fitting, RH mapping, Approximation, Lower bounds},
URL = {DOI:10.1016/S0196-6774(03)00083-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kalyanasundaram-Pruhs/03a,
AUTHOR = {Kalyanasundaram, Bala and Pruhs, Kirk R.},
TITLE = {Maximizing job completions online},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {63-85},
YEAR = {2003},
KEYWORDS = {Scheduling, Online scheduling, Real-time scheduling, Randomized algorithms, Competitive analysis, Resource augmentation analysis},
URL = {DOI:10.1016/S0196-6774(03)00074-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Frigioni-Marchetti-Spaccamela-Nanni/03,
AUTHOR = {Frigioni, Daniele and Marchetti-Spaccamela, Alberto and Nanni, Umberto},
TITLE = {Fully dynamic shortest paths in digraphs with arbitrary arc weights},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {86-113},
YEAR = {2003},
KEYWORDS = {Shortest paths, Dynamic algorithms, Output complexity, Zero-length cycles},
URL = {DOI:10.1016/S0196-6774(03)00082-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Meyer-Sanders/03,
AUTHOR = {Meyer, U. and Sanders, P.},
TITLE = {$\Delta$-stepping: A parallelizable shortest path algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {114-152},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00076-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Helvig-Robins-Zelikovsky/03,
AUTHOR = {Helvig, C.S. and Robins, Gabriel and Zelikovsky, Alex},
TITLE = {The moving-target Traveling Salesman problem},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {153-174},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00075-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Engels-Karger-Kolliopoulos-Sengupta-Uma-Wein/03,
AUTHOR = {Engels, Daniel W. and Karger, David R. and Kolliopoulos, Stavros G. and Sengupta, Sudipta and Uma, R.N. and Wein, Joel},
TITLE = {Techniques for scheduling with rejection},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {175-191},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00078-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Fellows-Hallett-Stege/03,
AUTHOR = {Fellows, Michael and Hallett, Michael and Stege, Ulrike},
TITLE = {Analogs \& duals of the MAST problem for sequences \& trees},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {1},
PAGES = {192-216},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00081-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Brakerski-Dreizin-Patt-Shamir/03,
AUTHOR = {Brakerski, Zvika and Dreizin, Vladimir and Patt-Shamir, Boaz},
TITLE = {Dispatching in perfectly-periodic schedules},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {2},
PAGES = {219-239},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00089-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Amir-Landau-Sokol/03,
AUTHOR = {Amir, Amihood and Landau, Gad M. and Sokol, Dina},
TITLE = {Inplace 2D matching in compressed images},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {2},
PAGES = {240-261},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00088-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Alt-Efrat-Rote-Wenk/03,
AUTHOR = {Alt, Helmut and Efrat, Alon and Rote, G{\"u}nter and Wenk, Carola},
TITLE = {Matching planar maps},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {2},
PAGES = {262-283},
YEAR = {2003},
URL = {DOI:10.1016/S0196-6774(03)00085-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bespamyatnikh/03,
AUTHOR = {Bespamyatnikh, Sergei},
TITLE = {Computing homotopic shortest paths in the plane},
JOURNAL = {J. Algorithms},
VOLUME = {49},
NUMBER = {2},
PAGES = {284-303},
YEAR = {2003},
KEYWORDS = {Shortest path, Homotopy, Output-sensitive algorithm},
URL = {DOI:10.1016/S0196-6774(03)00090-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}