Journal: J. Algorithms

Volume 24, Issue 2

223 -- 265Raffaele Giancarlo, Roberto Grossi. Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
266 -- 286Nili Guttmann-Beck, Refael Hassin. Approximation Algorithms for Min-Max Tree Partition
287 -- 309J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner. Designing Least-Cost Nonblocking Broadband Networks
310 -- 324Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young. A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
325 -- 339Amihood Amir, Alberto Apostolico, Moshe Lewenstein. Inverse Pattern Matching
340 -- 353Dany Breslauer, Tao Jiang, Zhigen Jiang. Rotations of Periodic Strings and Short Superstrings
354 -- 379Amihood Amir, Gary Benson, Martin Farach. Optimal Two-Dimensional Compressed Matching
380 -- 394R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan. Finding Scores in Tournaments
395 -- 420O. Dubios, Yacine Boufkhad. A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae

Volume 24, Issue 1

1 -- 19Shlomo Moran, Gadi Taubenfeld. A Lower Bound on Wait-Free Counting
20 -- 36S. Haldar. An All Pairs Shortest Paths Distributed Algorithm Using 2n² Messages
37 -- 65Greg N. Frederickson. A Data Structure for Dynamically Maintaining Rooted Trees
66 -- 93Susanne E. Hambrusch, Hung-Yi Tu. Edge Weight Reduction Problems in Directed Acyclic Graphs
94 -- 123Hans Leo Bodlaender, Joost Engelfriet. Domino Treewidth
124 -- 157Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook. Page Migration Algorithms Using Work Functions
158 -- 170Shimon Even, Ami Litman, Peter Winkler. Computing with Snakes in Directed Networks of Automata
171 -- 176Andrei Z. Broder, Ernst W. Mayr. Counting Minimum Weight Spanning Trees
177 -- 193David Eppstein, Daniel S. Hirschberg. Choosing Subsets with Maximum Weighted Average
194 -- 220Monika Rauch Henzinger. A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity