@article{Arkin-Hassin-Levin/06,
AUTHOR = {Arkin, Esther M. and Hassin, Refael and Levin, Asaf},
TITLE = {Approximations for minimum and min-max vehicle routing problems},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {1},
PAGES = {1-18},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {approximation algorithms, edge-routing, vehicle routing problem, min-max problems},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FSK7MK-4/2/2594758c5035cde1bf79e379b4a6f633},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Cohen-Strauss/06,
AUTHOR = {Cohen, Edith and Strauss, Martin J.},
TITLE = {Maintaining time-decaying stream aggregates},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {1},
PAGES = {19-36},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FMHST6-1/2/960bfcf0bb1b7fcba6b2f629c2f3e4b4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Mastrolilli/06,
AUTHOR = {Mastrolilli, Monaldo},
TITLE = {A linear time approximation scheme for the single machine scheduling problem with controllable processing times},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {1},
PAGES = {37-52},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {scheduling, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FN5KMT-1/2/fc2c067193cd009e8bc767016aacfc5b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Harvey-Ladner-Lovasz-Tamir/06,
AUTHOR = {Harvey, Nicholas J.A. and Ladner, Richard E. and Lov{\'a}sz, L{\'a}szl{\'o} and Tamir, Tami},
TITLE = {Semi-matchings for bipartite graphs and load balancing},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {1},
PAGES = {53-78},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {bipartite graphs, load balancing, matching algorithms, optimal algorithms, semi-matching},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FHJG9J-3/2/9a91e315c044ec7f8543aa917656bb96},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Khuller-Kim-Wan/06,
AUTHOR = {Khuller, Samir and Kim, Yoo-Ah and Wan, Yung-Chun (Justin)},
TITLE = {On generalized gossiping and broadcasting},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {2},
PAGES = {81-106},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FTWJG7-1/2/fffb17111d04756412e23a3e5a090f98},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Wang-Peng-Yu-Ku/06,
AUTHOR = {Wang, Biing-Feng and Peng, Shietung and Yu, Hong-Yi and Ku, Shan-Chyun},
TITLE = {Efficient algorithms for a constrained $k$-tree core problem in a tree network},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {2},
PAGES = {107-124},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {algorithms, trees, cores, diameters, centers},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FHJG9J-1/2/825770b4434619372ba2182d119bc4d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Chen-Tsukiji/06,
AUTHOR = {Chen, Zhi-Zhong and Tsukiji, Tatsuie},
TITLE = {Computing bounded-degree phylogenetic roots of disconnected graphs},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {2},
PAGES = {125-148},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {phylogeny, phylogenetic root, computational biology, graph power, tree power, graph algorithm},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4FHJG9J-2/2/76c257b1bb685062832c3137972aedac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}
@article{Sagan-Lee/06,
AUTHOR = {Sagan, Bruce E. and Lee, Jaejin},
TITLE = {An algorithmic sign-reversing involution for special rim-hook tableaux},
JOURNAL = {J. Algorithms},
VOLUME = {59},
NUMBER = {2},
PAGES = {149-161},
YEAR = {2006},
EDITOR = {Galil, Zvi and Johnson, David S. and Knuth, Donald E.},
KEYWORDS = {inverse kostka matrix, algorithmic sign-reversing involution, special rim-hook tableau, (3+1)-free conjecture},
URL = {http://www.sciencedirect.com/science/article/B6WH3-4CXMSCJ-2/2/a6cbcacf8e82cfd742eb129728e3f59c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Orlando-Amsterdam-Tokyo-Singapore},
}