External Links

    Journal: Algorithmica

    Volume 39, Issue 4

    275 -- 286Adam L. Buchsbaum, Michael T. Goodrich. Three-Dimensional Layers of Maxima
    287 -- 298Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton. Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
    299 -- 319Björn Brodén, Mikael Hammar, Bengt J. Nilsson. Online and Offline Algorithms for the Time-Dependent TSP with Time Zones
    321 -- 347Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier. Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

    Volume 39, Issue 3

    189 -- 208Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin. A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem
    209 -- 233Petr Kolman, Christian Scheideler. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
    235 -- 253David R. Wood. Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout
    255 -- 274Jianjun Zhou, Martin Müller 0003. Solving Systems of Difference Constraints Incrementally with Bidirectional Search

    Volume 39, Issue 2

    95 -- 126Stavros D. Nikolopoulos, Leonidas Palios. Algorithms for P::4::-Comparability Graph Recognition and Acyclic P::4::-Transitive Orientation
    127 -- 153John H. Reif, Zheng Sun. Movement Planning in the Presence of Flows
    155 -- 174Chung Keung Poon, Pixing Zhang. Minimizing Makespan in Batch Machine Scheduling
    175 -- 187Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko. Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems

    Volume 39, Issue 1

    1 -- 19Tetsuo Shibuya. Generalization of a Suffix Tree for RNA Structural Pattern Matching
    21 -- 41Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz, April Kwong, Stuart G. Stubblebine. A General Model for Authenticated Data Structures
    43 -- 57Leah Epstein, Jiri Sgall. Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
    59 -- 81Klaus Jansen. Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme
    83 -- 93Petko Yanev, Paolo Foschi, Erricos John Kontoghiorghes. Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns
    runs on