default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 18
Volume 18, Number 1, January 1995
- Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal Two-Connected Subgraphs. 1-49 - Richard Cole, Ofer Zajicek:
An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. 50-97 - Bonnie Berger, Lenore Cowen:
Scheduling with Concurrency-Based Constraints. 98-123 - Ulrich Schmid, Johann Blieberger
:
On Nonpreemptive LCFS Scheduling with Deadlines. 124-158 - Barun Chandra, Sundar Vishwanathan:
Constructing Reliable Communication Networks of Small Weight Online. 159-175 - Arvind Gupta, Naomi Nishimura:
The Parallel Complexity of Tree Embedding Problems. 176-200
Volume 18, Number 2, March 1995
- Martin Fürer, Balaji Raghavachari:
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. 203-220 - Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. 221-237 - Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks:
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. 238-255 - Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions. 256-277 - Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. 278-296 - Yuval Caspi, Eliezer Dekel:
Edge Coloring Series Parallel Graphs. 296-321 - Yosi Ben-Asher, Assaf Schuster:
The Complexity of Data Reduction on a Reconfigurable Linear Array. 322-357 - Ten-Hwang Lai, Shu-Shang Wei:
Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs. 358-375
Volume 18, Number 3, May 1995
- Ka Wong Chong, Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM. 378-402 - John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. 403-431 - Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. 432-479 - H. Ramesh:
On Traversing Layered Graphs On-Line. 480-512 - Adam L. Buchsbaum, Robert Endre Tarjan:
Confluently Persistent Deques via Data-Structural Bootstrapping. 513-547 - Jim Ruppert:
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation. 548-585 - Harold N. Gabow:
Centroids, Representations, and Submodular Flows. 586-628 - Torben Hagerup:
Fast Deterministic Processor Allocation. 629-649
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 2024-12-26 00:36 CET 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:
