Остановите войну!
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 36 matches
- 2001
- Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet:
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica 30(2): 164-187 (2001) - Christoph Baur, Sándor P. Fekete:
Approximation of Geometric Dispersion Problems. Algorithmica 30(3): 451-470 (2001) - Amir M. Ben-Amram, Zvi Galil:
A Generalization of a Lower Bound Technique due to Fredman and Saks. Algorithmica 30(1): 34-66 (2001) - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec:
Circular Separability of Polygons. Algorithmica 30(1): 67-82 (2001) - Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
An Approximate Determinization Algorithm for Weighted Finite-State Automata. Algorithmica 30(4): 503-526 (2001) - Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
On Rooted Node-Connectivity Problems. Algorithmica 30(3): 353-375 (2001) - Thomas Christof, Gerhard Reinelt:
Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. Algorithmica 30(4): 597-629 (2001) - Bruno Codenotti, Mauro Leoncini, Franco P. Preparata:
The Role of Arithmetic in Fast Parallel Matrix Inversion. Algorithmica 30(4): 685-707 (2001) - Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin:
Optimal Search and One-Way Trading Online Algorithms. Algorithmica 30(1): 101-139 (2001) - Vladimir Estivill-Castro, Michael E. Houle:
Robust Distance-Based Clustering with Applications to Spatial Data Mining. Algorithmica 30(2): 216-242 (2001) - William S. Evans, David G. Kirkpatrick, G. Townsend:
Right-Triangulated Irregular Networks. Algorithmica 30(2): 264-286 (2001) - David Fernández-Baca:
On Nonlinear Parametric Search. Algorithmica 30(1): 1-11 (2001) - Christopher M. Gold, Jack Snoeyink:
A One-Step Crust and Skeleton Extraction Algorithm. Algorithmica 30(2): 144-163 (2001) - Martin Held:
FIST: Fast Industrial-Strength Triangulation of Polygons. Algorithmica 30(4): 563-596 (2001) - Giuseppe F. Italiano:
Guest Editor's Introduction. Algorithmica 30(4): 471-472 (2001) - Bram de Jager, J. Banens:
VISOR: Vast Independence System Optimization Routine. Algorithmica 30(4): 630-644 (2001) - Klaus Jansen, José D. P. Rolim:
Guest Editors' Introduction. Algorithmica 30(3): 351-352 (2001) - Marek Karpinski:
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. Algorithmica 30(3): 386-397 (2001) - Guy Kortsarz:
On the Hardness of Approximating Spanners. Algorithmica 30(3): 432-450 (2001) - Marc J. van Kreveld:
Guest Editor's Foreword. Algorithmica 30(2): 141-143 (2001) - V. Kumar:
An Approximation Algorithm for Circular Arc Colouring. Algorithmica 30(3): 406-417 (2001) - Tak Wah Lam, Fung Ling Yue:
Optimal Edge Ranking of Trees in Linear Time. Algorithmica 30(1): 12-33 (2001) - Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4): 527-562 (2001) - Myungho Lee, Wenheng Liu, Viktor K. Prasanna:
Parallel Implementation of a Class of Adaptive Signal Processing Applications. Algorithmica 30(4): 645-684 (2001) - James J. Little, Ping Shi:
Structural Lines, TINs, and DEMs. Algorithmica 30(2): 243-263 (2001) - M. Lonergan, Cliff B. Jones:
An Iterative Displacement Method for Conflict Resolution in Map Generalization. Algorithmica 30(2): 287-301 (2001) - William A. Mackaness, Ross S. Purves:
Automated Displacement for Large Numbers of Discrete Map Objects. Algorithmica 30(2): 302-311 (2001) - Gonzalo Navarro, Ricardo A. Baeza-Yates:
Improving an Algorithm for Approximate Pattern Matching. Algorithmica 30(4): 473-502 (2001) - Victor Y. Pan, Yanqiang Yu:
Certification of Numerical Computation of the Sign of the Determinant of a Matrix. Algorithmica 30(4): 708-724 (2001) - Dimitris Papadias, Nikos Mamoulis, Yannis Theodoridis:
Constraint-Based Processing of Multiway Spatial Joins. Algorithmica 30(2): 188-215 (2001)
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-07-18 07:56 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