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 36 matches
- 1989
- Boris Aronov:
On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. Algorithmica 4(1): 109-140 (1989) - Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Algorithm for Maxdominance, with Applications. Algorithmica 4(2): 221-236 (1989) - Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks:
Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989) - Chandrajit L. Bajaj, Myung-Soo Kim:
Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves. Algorithmica 4(2): 157-172 (1989) - L. Paul Chew:
Constrained Delaunay Triangulations. Algorithmica 4(1): 97-108 (1989) - Shang-Ching Chou, Jin-Gen Yang:
On the Algebraic Formulation of Certain Geometry Statements and Mechanical Geometry Theorem Proving. Algorithmica 4(2): 237-262 (1989) - Israel Cidon, Inder S. Gopal:
Editor's Foreword: Special Issue on Algorithmic Aspects of Communications. Algorithmica 4(3): 301-302 (1989) - Kenneth L. Clarkson:
An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. Algorithmica 4(4): 461-469 (1989) - David P. Dobkin, Michael J. Laszlo:
Primitives for the Manipulation of Three-Dimensional Subdivisions. Algorithmica 4(1): 3-32 (1989) - Robert L. (Scot) Drysdale III, Robert B. Jerard, Barry Schaudt, Kenneth E. Hauck:
Discrete Simulation of NC Machining. Algorithmica 4(1): 33-60 (1989) - Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano:
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. Algorithmica 4(1): 61-76 (1989) - David Fernández-Baca, Charles U. Martel:
On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities. Algorithmica 4(2): 173-189 (1989) - Yaron I. Gold, Shlomo Moran:
A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks. Algorithmica 4(3): 329-341 (1989) - John Hershberger:
An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. Algorithmica 4(1): 141-155 (1989) - Daniel S. Hirschberg, Lawrence L. Larmore:
The Set-Set LCS Problem. Algorithmica 4(4): 503-510 (1989) - Hiroshi Imai, Kenji Kato, Peter Yamamoto:
A Linear-Time Algorithm for Linear L_1 Approximation of Points. Algorithmica 4(1): 77-96 (1989) - Jeffrey M. Jaffe, Zvi Rosberg:
Maximal Selection in Tandem Networks with Symmetric Hearing Range. Algorithmica 4(3): 343-364 (1989) - Jeffrey M. Jaffe, Moshe Sidi:
Distributed Deadlock Resolution in Store-and-Forward Networks. Algorithmica 4(3): 417-436 (1989) - Sanjiv Kapoor, Prakash V. Ramanan:
Lower Bounds for Maximal and Convex Layers Problems. Algorithmica 4(4): 447-459 (1989) - Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989) - Joseph Y.-T. Leung:
A New Algorithm for Scheduling Periodic Real-Time Tasks. Algorithmica 4(2): 209-219 (1989) - Elena Lodi, Fabrizio Luccio, Linda Pagli:
A Preliminary Study of a Diagonal Channel-Routing Model. Algorithmica 4(4): 585-597 (1989) - Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. Algorithmica 4(4): 551-567 (1989) - Nimrod Megiddo:
Extending NC and RNC Algorithms. Algorithmica 4(4): 501-517 (1989) - Michael Paterakis, Leonidas Georgiadis, P. Papantoni-Kazakos:
A Full Sensing Window Random-Access Algorithm for Messages with Strict Delay Constraints. Algorithmica 4(3): 313-328 (1989) - Michael J. Post, Aaron Kershenbaum, Philip E. Sarachik:
Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts. Algorithmica 4(3): 365-393 (1989) - Prakash V. Ramanan, Kazuhiro Tsuga:
Average-Case Analysis of the Modified Harmonic Algorithm. Algorithmica 4(4): 519-533 (1989) - Dana S. Richards:
Fast Heuristic Algorithms for Rectilinear Steiner Trees. Algorithmica 4(2): 191-207 (1989) - Steven Skiena:
Problems in Geometric Probing. Algorithmica 4(4): 599-605 (1989) - Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito:
Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989)
skipping 6 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-09-20 22:53 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