|
|
Journals in DBLP
BIT
1992, volume: 32, number: 2
- Ravi B. Boppana, Magnús M. Halldórsson
Approximating Maximum Independent Sets by Excluding Subgraphs. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:180-196 [Journal]
- Stefan Arnborg, Andrzej Proskurowski
Canonical Representations of Partial 2- and 3-Trees. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:197-214 [Journal]
- Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:215-236 [Journal]
- David Eppstein
Finding the k Smallest Spanning Trees. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:237-248 [Journal]
- John Hershberger, Subhash Suri
Applications of a Semi-Dynamic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:249-267 [Journal]
- Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
Intersection Queries in Sets of Disks. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:268-279 [Journal]
- Christos Levcopoulos, Andrzej Lingas
Fast Algorithms for Greedy Triangulation. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:280-296 [Journal]
- Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani
Improved Bounds for the Expected Behaviour of AVL Trees. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:297-315 [Journal]
- Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
Average Search and Update Costs in Skip Lists. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:2, pp:316-332 [Journal]
|
