Journals in DBLP
James H. Bradford , T. A. Jenkyns On the Inadequacy of Tournament Algorithms for the N-SCS Problem. [Citation Graph (0, 0)][DBLP ] Journal ] Marek Chrobak , Lawrence L. Larmore A Note on the Server Problem and a Benevolent Adversary. [Citation Graph (0, 0)][DBLP ] Journal ] Rolf Floren A Note on ``A Faster Approximation Algorithm for the Steiner Problem in Graphs''. [Citation Graph (0, 0)][DBLP ] Journal ] Andrew V. Goldberg Processor-Efficient Implementation of a Maximum Flow Algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] Laurent Siklóssy , Eduard Tulp The Space Reduction Method: A Method to Reduce the Size of Search Spaces. [Citation Graph (0, 0)][DBLP ] Journal ] William I. Gasarch On Selecting the k Largest with Restricted Quadratic Queries. [Citation Graph (0, 0)][DBLP ] Journal ] Ernst L. Leiss , Hari N. Reddy Embedding Complete Binary Trees Into Hypercubes. [Citation Graph (0, 0)][DBLP ] Journal ] Ron Shonkwiler Computing the Hausdorff Set Distance in Linear Time for Any L_p Point Distance. [Citation Graph (0, 0)][DBLP ] Journal ] Josep M. Basart Some Upper Bounds for Minimal Trees. [Citation Graph (0, 0)][DBLP ] Journal ] Jin-yi Cai , Lane A. Hemachandra A Note on Enumarative Counting. [Citation Graph (0, 0)][DBLP ] Journal ] Markku Sakkinen Selftype is a Special Case. [Citation Graph (0, 0)][DBLP ] Journal ] 