@article{Goel-Henzinger-Plotkin/05,
AUTHOR = {Goel, Ashish and Henzinger, Monika R. and Plotkin, Serge},
TITLE = {An online throughput-competitive algorithm for multicast routing and admission control},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {1-20},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {multicast, routing, admission control, online},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.11.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Filaseta-Meade/05,
AUTHOR = {Filaseta, Michael and Meade, Douglas B.},
TITLE = {Irreducibility testing of lacunary 0,1-polynomials},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {21-28},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {irreducibility, lacunary, sparse, 0-1-polynomial, non-reciprocal part},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.10.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Sparl-Zerovnik/05,
AUTHOR = {{\v{S}}parl, Petra and {\v{Z}}erovnik, Janez},
TITLE = {2-local 4/3-competitive algorithm for multicoloring hexagonal graphs},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {29-41},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {graph coloring, frequency planning, cellular networks, 2-local distributed algorithm},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.09.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Kim/05a,
AUTHOR = {Kim, Yoo-Ah},
TITLE = {Data migration to minimize the total completion time},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {42-57},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {data migration, scheduling, approximation algorithms, linear programming},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.07.009},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Cormode-Muthukrishnan/05,
AUTHOR = {Cormode, Graham and Muthukrishnan, S.},
TITLE = {An improved data stream summary: The count-min sketch and its aplications},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {58-75},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.12.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Bar-Yehuda-Even-Shahar/05,
AUTHOR = {Bar-Yehuda, Reuven and Even, Guy and Shahar, Shimon (Moni)},
TITLE = {On approximating a geometric prize-collecting Traveling Salesman problem with time windows},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {76-92},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.11.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Naor/05,
AUTHOR = {Naor, Moni},
TITLE = {On fairness in the carpool problem},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {1},
PAGES = {93-98},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.05.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Adler-Rosen/05,
AUTHOR = {Adler, Micah and Ros{\'e}n, Adi},
TITLE = {Tight bounds for the performance of Longest In System on DAGs},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {2},
PAGES = {101-112},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Aiello-Mansour-Rajagopolan-Rosen/05,
AUTHOR = {Aiello, William A. and Mansour, Yishay and Rajagopolan, S. and Ros{\'e}n, Adi},
TITLE = {Competitive queue policies for differentiated services},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {2},
PAGES = {113-141},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Del_Lungo-Louchard-Marini-Montagna/05,
AUTHOR = {Del Lungo, Alberto and Louchard, Guy and Marini, Claudio and Montagna, Franco},
TITLE = {The Guessing Secrets problem: A probabilistic approach},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {2},
PAGES = {142-176},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Larose-Loten-Zadori/05,
AUTHOR = {Larose, Benoit and Loten, Cynthia and Z{\'a}dori, L{\'a}szl{\'o}},
TITLE = {A polynomial-time algorithm for near-unanimity graphs},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {2},
PAGES = {177-191},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {near-unanimity operation, reflexive graph, polynomial-time algorithm},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.04.011},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Bartal-Mendel/05,
AUTHOR = {Bartal, Yair and Mendel, Manor},
TITLE = {Randomized $k$-server algorithms for growth-rate bounded graphs},
JOURNAL = {J. Algorithms},
VOLUME = {55},
NUMBER = {2},
PAGES = {192-202},
YEAR = {2005},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {$k$-server problem, randomized algorithms, metric embedding},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.06.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}