|
|
Journals in DBLP
J. Algorithms
1987, volume: 8, number: 3
- Dorit S. Hochbaum, Wolfgang Maass
Fast Approximation Algorithms for a Nonconvex Covering Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:305-323 [Journal]
- Shih Ping Tung
Computational Complexities of Diophantine Equations with Parameters. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:324-336 [Journal]
- Noga Alon, Zvi Galil, V. D. Milman
Better Expanders and Superconcentrators. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:337-347 [Journal]
- David P. Dobkin, Herbert Edelsbrunner
Space Searching for Intersecting Objects. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:348-361 [Journal]
- Donald W. Loveland
Finding Critical Sets. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:362-371 [Journal]
- Ten-Hwang Lai, Alan P. Sprague
On the Routability of a Convex Grid. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:372-384 [Journal]
- Stephen A. Cook, Pierre McKenzie
Problems Complete for Deterministic Logarithmic Space. [Citation Graph (1, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:385-394 [Journal]
- Michael F. Bridgland
Universal Traversal Sequences for Paths and Cycles. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:395-404 [Journal]
- David A. Plaisted, Jiarong Hong
A Heuristic Triangulation Algorithm. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:405-437 [Journal]
- David S. Johnson
The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1987, v:8, n:3, pp:438-448 [Journal]
|
