Journals in DBLP
J. Algorithms 1996, volume: 20, number: 3
Shietung Peng , Win-Tsung Lo Efficient Algorithms for Finding a Core of a Tree with a Specified Length. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:445-458 [Journal ] Danny Z. Chen Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:459-478 [Journal ] William R. Burley Traversing Layered Graphs Using the Work Function Algorithm. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:479-511 [Journal ] Ashok Subramanian An Explanation of Splaying. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:512-525 [Journal ] Kazuo Iwama , Chuzo Iwamoto alpha-Connectivity: A Gradually Nonparallel Graph Problem. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:526-544 [Journal ] Jirí Matousek Derandomization in Computational Geometry. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:545-580 [Journal ] Pankaj K. Agarwal , Sandeep Sen Selection in Monotone Matrices and Computing k th Nearest Neighbors. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:581-601 [Journal ] Mikkel Thorup Efficient Preprocessing of Simple Binay Pattern Forests. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:602-612 [Journal ] Kazuo Iwama , Eiji Miyano , Yahiko Kambayashi Routing Problems on the Mesh of Buses. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:3, pp:613-631 [Journal ]