Journals in DBLP
J. Algorithms 1991, volume: 12, number: 1
Jirí Matousek , Robin Thomas Algorithms Finding Tree-Decompositions of Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:1-22 [Journal ] Xin He An Improved Algorithm for the Planar 3-Cut Problem. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:23-37 [Journal ] Alok Aggarwal , Hiroshi Imai , Naoki Katoh , Subhash Suri Finding k Points with Minimum Diameter and Related Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:38-56 [Journal ] Siu-Wing Cheng , Ravi Janardan Efficient Maintenance of the Union of Intervals on a Line, with Applications. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:57-74 [Journal ] Subir Kumar Ghosh Computing the Visibility Polygon from a Convex Set and Related Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:75-95 [Journal ] Teresa M. Przytycka , Derek G. Corneil Parallel Algorithms for Parity Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:96-109 [Journal ] Phillip B. Gibbons , Richard M. Karp , Vijaya Ramachandran , Danny Soroker , Robert Endre Tarjan Transitive Compaction in Parallel via Branchings. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:110-125 [Journal ] Ryan Hayward , Colin McDiarmid Average Case Analysis of Heap Building by Repeated Insertion. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:126-153 [Journal ] Jimmy J. M. Tan A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:154-178 [Journal ] Herbert S. Wilf Two Algorithms for the Sieve Method. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:179-182 [Journal ] Peter van Emde Boas Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:183-185 [Journal ]