default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 19
Volume 19, Number 1, July 1995
- Pilar de la Torre, Clyde P. Kruskal:
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. 1-24 - Murray Sherk:
Self-Adjusting k-ary Search Trees. 25-44 - Greg N. Frederickson:
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. 45-85 - Prosenjit Bose
, Godfried T. Toussaint:
Growing a Tree from Its Branches. 86-103 - Philip N. Klein, R. Ravi:
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. 104-115 - Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. 116-143
Volume 19, Number 2, September 1995
- Wen-Lian Hsu, Jeremy P. Spinrad:
Independent Sets in Circular-Arc Graphs. 145-160 - Sandeep Sen:
Fractional Cascading Revisited. 161-172 - Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja:
NC-Algorithms for Minimum Link Path and Related Problems. J. Algorithms 19(2): 173-203 (1995) - Avrim Blum, Joel Spencer:
Coloring Random and Semi-Random k-Colorable Graphs. 204-234 - Fredrik Manne, Tor Sørevik:
Optimal Partitioning of Sequences. 235-249 - Carl Pomerance, Jonathan P. Sorenson:
Counting the Integers Factorable via Cyclotomic Methods. 250-265 - Ton Kloks, Dieter Kratsch:
Treewidth of Chordal Bipartite Graphs. 266-281 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. 282-317 - Alok Aggarwal, Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem. 318-330
Volume 19, Number 3, November 1995
- Xuding Zhu:
A Polynomial Algorithm for Homomorphisms to Oriented Cycles. 333-345 - Sun Wu, Udi Manber, Eugene W. Myers:
A Subquadratic Algorithm for Approximate Regular Expression Matching. 346-360 - Sanguthevar Rajasekaran:
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh. 361-382 - Donald B. Johnson, Panagiotis Takis Metaxas:
A Parallel Algorithm for Computing Minimum Spanning Trees. 383-401 - William F. Eddy, Mark J. Schervish:
How Many Comparisons Does Quicksort Use? 402-431 - Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. 432-440 - Konrad Engel:
An Algorithm for the Determination of the Variance of a Partially Ordered Set. 441-448 - Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Graph Sandwich Problems. 449-473 - Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid:
Static and Dynamic Algorithms for k-Point Clustering Problems. 474-503
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-04 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
