default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 1992
- Alok Aggarwal:
Editor's Foreword. Algorithmica 7(1): 1-2 (1992) - R. S. Booth, J. F. Weng:
Steiner Minimal Trees for a Class of Zigzag Lines. Algorithmica 7(2&3): 231-246 (1992) - Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Automatic Generation of Linear-Time Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families. Algorithmica 7(5&6): 555-581 (1992) - Sharat Chandran, Sung Kwon Kim, David M. Mount:
Parallel Computational Geometry of Rectangles. Algorithmica 7(1): 25-49 (1992) - Ernest J. Cockayne, Denton E. Hewgill:
Improved Computation of Plane Steiner Minimal Trees. Algorithmica 7(2&3): 219-229 (1992) - Ed Cohen, Russ Miller, Elias M. Sarraf, Quentin F. Stout:
Efficient Convexity and Domination Algorithms for Fine-and Medium-Grain Hypercube Computers. Algorithmica 7(1): 51-75 (1992) - Charles J. Colbourn:
A Note on Bounding k-Terminal Reliability. Algorithmica 7(2&3): 303-307 (1992) - Richard Cole, Michael T. Goodrich:
Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica 7(1): 3-23 (1992) - Ding-Zhu Du, Frank K. Hwang:
A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio. Algorithmica 7(2&3): 121-135 (1992) - Greg N. Frederickson:
Editor's Foreword Special Issue on Graph Algorithms. Algorithmica 7(5&6): 429-431 (1992) - Harold N. Gabow, Herbert H. Westermann:
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications. Algorithmica 7(5&6): 465-497 (1992) - Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica 7(4): 381-413 (1992) - Dan Gusfield, Charles U. Martel:
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. Algorithmica 7(5&6): 499-519 (1992) - John E. Hopcroft, Peter J. Kahn:
A Paradigm for Robust Geometric Algorithms. Algorithmica 7(4): 339-380 (1992) - Frank K. Hwang:
Foreword. Algorithmica 7(2&3): 119-120 (1992) - Andrew M. Liao:
Three Priority Queue Applications Revisited. Algorithmica 7(4): 415-427 (1992) - Zicheng Liu, Ding-Zhu Du:
On Steiner Minimal Trees with L_p Distance. Algorithmica 7(2&3): 179-191 (1992) - Joan M. Lucas, Marian Gunsher Sackrowitz:
Efficient Parallel Algorithms for Path Problems in Directed Graphs. Algorithmica 7(5&6): 631-648 (1992) - Bhubaneswar Mishra, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding an Ambitus. Algorithmica 7(5&6): 521-554 (1992) - Hiroshi Nagamochi, Toshihide Ibaraki:
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica 7(5&6): 583-596 (1992) - J. Scott Provan:
Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems. Algorithmica 7(2&3): 289-302 (1992) - Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor:
The Rectilinear Steiner Arborescence Problem. Algorithmica 7(2&3): 277-288 (1992) - John H. Reif, Sandeep Sen:
Optimal Randomized Parallel Algorithms for Computational Geometry. Algorithmica 7(1): 91-117 (1992) - John H. Reif, Paul G. Spirakis:
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems. Algorithmica 7(5&6): 597-630 (1992) - Dana S. Richards, Jeffrey S. Salowe:
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets. Algorithmica 7(2&3): 247-276 (1992) - J. Hyam Rubinstein, Doreen A. Thomas:
Graham's Problem on Shortest Networks for Points on a Circle. Algorithmica 7(2&3): 193-218 (1992) - Jorge L. C. Sanz, Robert Cypher:
Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Message-Passing Parallel Computers. Algorithmica 7(1): 77-89 (1992) - Otfried Schwarzkopf:
Parallel Computation of Distance Transforms - Erratum. Algorithmica 7(2&3): 337 (1992) - Warren D. Smith:
How To Find Steiner Minimal Trees in Euclidean d-Space. Algorithmica 7(2&3): 137-177 (1992) - Warren D. Smith, Peter W. Shor:
Steiner Tree Problems. Algorithmica 7(2&3): 329-332 (1992)
skipping 3 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-06 05:55 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint