Research Article2210.1016/s0196-6774(03)00044-0Making data structures confluently persistentJul 08, 2003Journal of AlgorithmsAmos Fiat + 1 more +1CiteListenSave
Research Article7110.1016/s0196-6774(03)00073-7Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-widthJul 04, 2003Journal of AlgorithmsGruia Călinescu + 2 more +2CiteListenSave
Research Article3310.1016/s0196-6774(03)00074-9Maximizing job completions onlineJun 28, 2003Journal of AlgorithmsBala Kalyanasundaram + 1 more +1CiteListenSave
Research Article710.1016/s0196-6774(03)00054-3Scheduling data transfers in a network and the set scheduling problemMay 22, 2003Journal of AlgorithmsAshish Goel + 3 more +3CiteListenSave
Research Article4110.1016/s0196-6774(03)00050-6An efficient graph algorithm for dominance constraintsMay 22, 2003Journal of AlgorithmsErnst Althaus + 5 more +5CiteListenSave
Supplementary Content10.1016/s0196-6774(03)00064-6Author index for volume 47May 21, 2003Journal of AlgorithmsCiteListenSave
Research Article710.1016/s0196-6774(03)00017-8Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutationApr 02, 2003Journal of AlgorithmsBoaz TsabanCiteListenSave
Addendum10.1016/s0196-6774(03)00016-6Erratum to “Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true”: [J. Algorithms 42 (2002) 304–316Apr 01, 2003Journal of AlgorithmsHatem M Bahig + 1 more +1CiteListenSave
Supplementary Content10.1016/s0196-6774(03)00024-5Papers to appear in forthcoming issuesFeb 01, 2003Journal of AlgorithmsCiteListenSave
Supplementary Content10.1016/s0196-6774(03)00007-5Editorial BoardJan 01, 2003Journal of AlgorithmsCiteListenSave