@article{Flaxman-Frieze-Upfal/04,
AUTHOR = {Flaxman, Abraham and Frieze, Alan and Upfal, Eli},
TITLE = {Efficient communication in an ad-hoc network},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.01.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Elkin-Kortsarz/04,
AUTHOR = {Elkin, Michael and Kortsarz, Guy},
TITLE = {Logarithmic inapproximability of the radio broadcast problem},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {8-25},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.11.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Alber-Fernau-Niedermeier/04,
AUTHOR = {Alber, Jochen and Fernau, Henning and Niedermeier, Rolf},
TITLE = {Parameterized complexity: Exponential speed-up for planar graph problems},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {26-56},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {planar graph problems, fixed-parameter tractability, parameterized complexity, tree decomposition, graph separators},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.005},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Andrews-Zhang/04,
AUTHOR = {Andrews, Matthew and Zhang, Lisa},
TITLE = {Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {57-81},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {packet routing, scheduling, earliest deadline first, weighted fair queueing, delay bounds},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Wang-Lin-Ku/04,
AUTHOR = {Wang, Biing-Feng and Lin, Jyh-Jye and Ku, Shan-Chyun},
TITLE = {Efficient algorithms for the scaled indexing problem},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {1},
PAGES = {82-100},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {string matching, approximate string matching, scaled matching, suffix trees, indexing},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Elmasry/04a,
AUTHOR = {Elmasry, Amr},
TITLE = {Parameterized self-adjusting heaps},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {103-119},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.03.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Azar-Epstein-Richter-Woeginger/04,
AUTHOR = {Azar, Yossi and Epstein, Leah and Richter, Yossi and Woeginger, Gerhard J.},
TITLE = {All-norm approximation algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {120-133},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.02.003},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Alber-Fiala/04,
AUTHOR = {Alber, Jochen and Fiala, Ji{\v{r}}{\'{\i}}},
TITLE = {Geometric separation and exact solutions for the parameterized independent set problem on disk graphs},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {134-151},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {disk graphs, independent set, parameterized complexity, graph separators, graph measure},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.10.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Ellis-Fan-Fellows/04,
AUTHOR = {Ellis, J. and Fan, H. and Fellows, M.},
TITLE = {The dominating set problem is fixed parameter tractable for graphs of bounded genus},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {152-168},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {graph, genus, dominating set, fixed parameter algorithm},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.02.001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Boyar-Krarup-Nielsen/04,
AUTHOR = {Boyar, Joan and Krarup, Susan and Nielsen, Morten N.},
TITLE = {Seat reservation allowing seat changes},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {169-192},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {seat reservation, on-line, accommodating sequences, restricted input sequences},
URL = {http://dx.doi.org/10.1016/j.jalgor.2004.02.002},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}
@article{Lam-Ngan-To/04,
AUTHOR = {Lam, Tak-Wah and Ngan, Tsuen-Wan Johnny and To, Kar-Keung},
TITLE = {Performance guarantee for EDF under overload},
JOURNAL = {J. Algorithms},
VOLUME = {52},
NUMBER = {2},
PAGES = {193-206},
YEAR = {2004},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {online algorithms, extra-resource analysis, firm deadline scheduling, earliest deadline first},
URL = {http://dx.doi.org/10.1016/j.jalgor.2003.10.004},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-San Diego-Orlando-Tokyo-Singapore},
}