Journal: Algorithmica

Volume 15, Issue 6

521 -- 549Joseph Cheriyan, Kurt Mehlhorn. Algorithms for Dense Graphs and Networks on the Random Access Computer
550 -- 571Peichen Pan, Weiping Shi, C. L. Liu. Area Minimization for Hierarchical Floorplans
572 -- 599Yang Cai, M. C. Kong. Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems
600 -- 625Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel. Proportionate Progress: A Notion of Fairness in Resource Allocation
626 -- 660Pankaj K. Agarwal, Marc J. van Kreveld. Connected Component and Simple Polygon Intersection Searching

Volume 15, Issue 5

397 -- 412Egon Balas, Jue Xue. Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring
413 -- 427Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka. Strongly Adaptive Token Distribution
428 -- 447Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi. Lines in Space: Combinatorics and Algorithms
448 -- 466Greg N. Frederickson. Searching Among Intervals and Compact Routing Tables
467 -- 480Renzo Sprugnoli. Recurrence Relations on Heaps
481 -- 494Alberto Apostolico, Franco P. Preparata. Data Structures and Algorithms for the String Statistics Problem
495 -- 519Ruth Kuchem, Dorothea Wagner, Frank Wagner. Optimizing Area for Three-Layer Knock-Knee Channel Routing

Volume 15, Issue 4

287 -- 301Ronitt Rubinfeld. Designing Checkers for Programs that Run in Parallel
302 -- 318Giuseppe Di Battista, Roberto Tamassia. On-Line Maintenance of Triconnected Components with SPQR-Trees
319 -- 331Danny Krizanc, Lata Narayanan, Rajeev Raman. Fast Deterministic Selection on Mesh-Connected Processor Arrays
332 -- 350J. L. Nazareth. The Implementation of Linear Programming Algorithms Bases on Homotopies
351 -- 372J. Scott Provan, Douglas R. Shier. A Paradigm for Listing (s, t)-Cuts in Graphs
373 -- 396Konstantinos Kalpakis, Yelena Yesha. Scheduling Tree DAGs on Parallel Architectures

Volume 15, Issue 3

205 -- 222Kaizhong Zhang. A Constrained Edit Distance Between Unordered Labeled Trees
223 -- 241Herbert Edelsbrunner, Nimish R. Shah. Incremental Topological Flipping Works for Regular Triangulations
242 -- 255K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri. Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph
256 -- 286Bhubaneswar Mishra. Bidirectional Edges Problem: Part I-A Simple Algorithm

Volume 15, Issue 2

104 -- 125Richard J. Anderson, Paul Beame, Erik Brisson. Parallel Algorithms for Arrangements
126 -- 153Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright. Sweep Methods for Parallel Computational Geometry
154 -- 171Roberto Tamassia, Jeffrey Scott Vitter. Optimal Cooperative Search in Fractional Cascaded Data Structures
172 -- 192David G. Kirkpatrick, Teresa M. Przytycka. Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt
193 -- 203Björn Lisper. Preconditioning Index Set Transformations for Time-Optimal Affine Scheduling

Volume 15, Issue 1

1 -- 16F. Miller Maley. Testing Homotopic Routability Under Polygonal Wiring Rules
17 -- 49G. N. Srinivasa Prasanna, Bruce R. Musicus. The Optimal Control Approach to Generalized Multiprocessor Scheduling
50 -- 67Sun Wu, Udi Manber, Eugene W. Myers. A Subquadratic Algorithm for Approximate Limited Expression Matching
68 -- 81Shouwen Tang, Kaizhong Zhang, Xiaolin Wu. Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics
82 -- 102Michael B. Dillencourt, Hanan Samet. Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees