|
|
Journals in DBLP
J. Algorithms
1986, volume: 7, number: 3
- Neil Robertson, Paul D. Seymour
Graph Minors. II. Algorithmic Aspects of Tree-Width. [Citation Graph (2, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:309-322 [Journal]
- J. L. Lewandowski, C. L. Liu, Jane W.-S. Liu
An Algorithmic Proof of a Generalization of the Birkhoff-Von Neumann Theorem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:323-330 [Journal]
- Tuvi Etzion
An Algorithm for Constructing m-ary de Bruijn Sequences. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:331-340 [Journal]
- Mai Thanh, Vangalur S. Alagar, T. D. Bui
Optimal Expected-Time Algorithms for Merging. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:341-357 [Journal]
- Nimrod Megiddo, Eitan Zemel
An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:358-368 [Journal]
- Alok Aggarwal, Robert Melville
Fast Computation of the Modality of Polygons. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:369-381 [Journal]
- Dana S. Richards
Finding Short Cycles in Planar Graphs Using Separators. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:382-394 [Journal]
- Keith Brinck
On Deletion in Threaded Binary Trees. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:395-411 [Journal]
- James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong
Faster Construction of Optimal Binary Split Trees. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:412-424 [Journal]
- J. M. Robson
Algorithms for Maximum Independent Sets. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:425-440 [Journal]
- Mike Paterson, F. Frances Yao
Point Retrieval for Polygons. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:3, pp:441-447 [Journal]
|
