Journal: J. Algorithms

Volume 42, Issue 2

205 -- 230Mikkel Thorup. Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
231 -- 254Brenda S. Baker, Raffaele Giancarlo. Sparse Dynamic Programming for Longest Common Subsequence from Fragments
255 -- 276Mirela Damian-Iordache, Sriram V. Pemmaraju. A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs
277 -- 303Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter. Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
304 -- 316Hatem M. Bahig, Ken Nakamula. Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
317 -- 333Nicholas Pippenger. Analysis of Carry Propagation in Addition: An Elementary Approach
334 -- 366Magnús M. Halldórsson, Guy Kortsarz. Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees

Volume 42, Issue 1

1 -- 19Ulrich Meyer, Jop F. Sibeyn. Oblivious Gossiping on Tori
20 -- 40Reuven Bar-Yehuda, Dror Rawitz. Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property
41 -- 53Matti Nykänen, Esko Ukkonen. The Exact Path Length Problem
54 -- 68Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige. Locating Sources to Meet Flow Demands in Undirected Networks
69 -- 108Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. On Graph Powers for Leaf-Labeled Trees
109 -- 134Dan Halperin, Micha Sharir, Kenneth Y. Goldberg. The 2-Center Problem with Obstacles
135 -- 152Pangfeng Liu. Broadcast Scheduling Optimization for Heterogeneous Cluster Systems
153 -- 172C. R. Subramanian, C. E. Veni Madhavan. General Partitioning on Random Graphs
173 -- 202Takao Asano, David P. Williamson. Improved Approximation Algorithms for MAX SAT