Остановите войну!
for scientists:
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 20 matches
- 1997
- Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays. Algorithmica 19(3): 291-317 (1997) - Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasibility of Design in Stereolithography. Algorithmica 19(1/2): 61-83 (1997) - Chandrajit L. Bajaj, Fausto Bernardini, Guoliang Xu:
Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data. Algorithmica 19(1/2): 243-261 (1997) - David Baraff, Raju S. Mattikalli, Pradeep K. Khosla:
Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms. Algorithmica 19(1/2): 4-39 (1997) - Therese C. Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997) - Prosenjit Bose, David Bremner, Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra. Algorithmica 19(1/2): 84-113 (1997) - Martin L. Brady, Donna J. Brown, K. D. Powers:
Hexagonal Models for Channel Routing. Algorithmica 19(3): 263-290 (1997) - Zhi-Zhong Chen, Xin He:
Parallel Algorithms for Maximal Acyclic Sets. Algorithmica 19(3): 354-368 (1997) - Boris V. Cherkassky, Andrew V. Goldberg:
On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19(4): 390-410 (1997) - Karen L. Daniels, Victor Milenkovic:
Multiple Translational Containment. Part I: An Approximate Algorithm. Algorithmica 19(1/2): 148-182 (1997) - Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid:
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19(4): 447-460 (1997) - Ioannis Z. Emiris, John F. Canny, Raimund Seidel:
Efficient Perturbations for Handling Geometric Degeneracies. Algorithmica 19(1/2): 219-242 (1997) - Robert Giegerich, Stefan Kurtz:
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction. Algorithmica 19(3): 331-353 (1997) - Michael S. Karasick, Derek Lieber, Lee R. Nackman, V. T. Rajan:
Visualization of Three-Dimensional Delaunay Meshes. Algorithmica 19(1/2): 114-128 (1997) - Shun-Shii Lin, Kwei-Jay Lin:
A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound. Algorithmica 19(4): 411-426 (1997) - Victor Milenkovic:
Multiple Translational Containment. Part II: Exact Algorithms. Algorithmica 19(1/2): 183-218 (1997) - Gary L. Miller, Shang-Hua Teng:
Tree-Based Parallel Algorithm Design. Algorithmica 19(4): 369-389 (1997) - Daniela Rus:
Coordinated Manipulation of Objects in a Plane. Algorithmica 19(1/2): 129-147 (1997) - Aaron S. Wallack, John F. Canny:
Planning for Modular and Hybrid Fixture. Algorithmica 19(1/2): 40-60 (1997) - J. F. Weng:
Expansion of Linear Steiner Trees. Algorithmica 19(3): 318-330 (1997)
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-05-18 19:23 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