Journals in DBLP
J. Algorithms 1985, volume: 6, number: 3
Martin Farber , J. Mark Keil Domination in Permutation Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:309-321 [Journal ] Thomas G. Szymanski Hash Table Reorganization. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:322-335 [Journal ] Patricio V. Poblete , J. Ian Munro The Analysis of a Fringe Heuristic for Binary Search Trees. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:336-350 [Journal ] M. C. Er The Complexity of the Generalised Cyclic Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:351-358 [Journal ] Victor Klee , Michael C. Laskowski Finding the Smallest Triangles Containing a Given Convex Polygon. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:359-375 [Journal ] Peter B. Borwein On the Complexity of Calculating Factorials. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:376-380 [Journal ] David P. Dobkin , David G. Kirkpatrick A Linear Algorithm for Determining the Separation of Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:381-392 [Journal ] Hiroyuki Nakayama , Takao Nishizeki , Nobuji Saito Lower Bounds for Combinatorial Problems on Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:393-399 [Journal ] Kohei Noshita A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:400-408 [Journal ] Alon Itai , Michael Rodeh Scheduling Transmissions in a Network. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:409-429 [Journal ] Nimrod Megiddo Partitioning with Two Lines in the Plane. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:430-433 [Journal ] David S. Johnson The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:3, pp:434-451 [Journal ]