External Links

    Journal: Algorithmica

    Volume 17, Issue 4

    331 -- 356Piotr Berman, Bhaskar DasGupta. Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems
    357 -- 379Elon Rimon. Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For?
    380 -- 398Marco Pellegrini. On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching
    399 -- 415Yijie Han, Victor Y. Pan, John H. Reif. Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs
    416 -- 425Sergio De Agostino, Rossella Petreschi, Andrea Sterbini. An O(n³) Recognition Algorithm for Bithreshold Graphs
    426 -- 448Susanne E. Hambrusch, Hung-Yi Tu. New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction
    449 -- 462Noga Alon, Aravind Srinivasan. Improved Parallel Approximation of a Class of Integer Programming Problems

    Volume 17, Issue 3

    209 -- 223Noga Alon, Raphael Yuster, Uri Zwick. Finding and Counting Given Length Cycles
    224 -- 244Michael Kaufmann, Jop F. Sibeyn. Randomized Multipacket Routing and Sorting on Meshes
    245 -- 265Bernard Chazelle, Leonidas Palios. Decomposing the Boundary of a Nonconvex Polyhedron
    266 -- 280Lin Chen. Efficient Parallel Recognition of Some Circular Arc Graphs, II
    281 -- 307S. Guha, I. Suzuki. Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles
    308 -- 321Rida A. Bazzi, Gil Neiger. The Complexity of Almost-Optimal Simultaneous Coordination
    322 -- 329Rephael Wenger. Randomized Quickhull

    Volume 17, Issue 2

    89 -- 99Ronald I. Greenberg, Jau-Der Shih. Minimizing Channel Density with Movable Terminals
    100 -- 110Frieda Granot, Jadranka Skorin-Kapov, Amir Tamir. Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines
    111 -- 132Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec. Evaluating Signs of Determinants Using Single-Precision Arithmetic
    133 -- 161Jay N. Bhuyan, Jitender S. Deogun, Vijay V. Raghavan. Algorithms for the Boundary Selection Problem
    162 -- 183Laurent Alonso, Jean-Luc Remy, René Schott. A Linear-Time Algorithm for the Generation of Trees
    183 -- 198Kurt Mehlhorn, R. Sundar, Christian Uhrig. Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
    199 -- 208Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey. Three-Dimensional Graph Drawing

    Volume 17, Issue 1

    1 -- 10Theodore H. Romer, Louis E. Rosier. An Algorithm Reminiscent of Euclidean-gcd Computing a Function Related to Pinwheel Scheduling
    11 -- 18Brandon Dixon, Robert Endre Tarjan. Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time
    19 -- 32Frank K. H. A. Dehne, Rolf Klein. The Big Sweep : On the Power of the Wavefront Approach to Voronoi Diagrams
    33 -- 54Sunil Arya, Michiel H. M. Smid. Efficient Construction of a Bounded-Degree Spanner with Low Weight
    55 -- 66Torben Hagerup, Miroslaw Kutylowski. Fast Integer Merging on the EREW PRAM
    67 -- 87Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka. Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs
    runs on