Journals in DBLP

J. Algorithms
1996, volume: 21, number: 3

1. John Hershberger, Subhash Suri
   Off-Line Maintenance of Planar Configurations. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:453-475 [Journal]
   
2. Colin McDiarmid, Ryan Hayward
   Large Deviations for Quicksort. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:476-507 [Journal]
   
3. Pankaj K. Agarwal, Micha Sharir
   Ray Shooting Amidst Convex Polygons in 2D. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:508-519 [Journal]
   
4. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer
   Enclosing a Set of Objects by Two Minimum Area Rectangles. [Citation Graph (1, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:520-541 [Journal]
   
5. Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
   The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:542-564 [Journal]
   
6. Michael Kaib, Claus-Peter Schnorr
   The Generalized Gauss Reduction Algorithm. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:565-578 [Journal]
   
7. Bernard Chazelle, Jirí Matousek
   On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:579-597 [Journal]
   
8. Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki
   Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:598-617 [Journal]
   
9. Michael L. Fredman, Leonid Khachiyan
   On the Complexity of Dualization of Monotone Disjunctive Normal Forms. [Citation Graph (1, 0)][DBLP]
   J. Algorithms, 1996, v:21, n:3, pp:618-628 [Journal]
   
10. Mark H. Overmars, A. Frank van der Stappen
    Range Searching and Point Location among Fat Objects. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:629-656 [Journal]
    
11. Subir Kumar Ghosh
    Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:657-662 [Journal]