Остановите войну!
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 29 matches
- 1995
- Pankaj K. Agarwal, Jirí Matousek:
Dynamic Half-Space Range Reporting and Its Applications. Algorithmica 13(4): 325-345 (1995) - Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. Algorithmica 13(1/2): 52-76 (1995) - David S. Atkinson, Pravin M. Vaidya:
Using Geometry To Solve the Transportation Problem in the Plane. Algorithmica 13(5): 442-461 (1995) - Danilo Bruschi, F. Ravasio:
Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles. Algorithmica 13(4): 346-356 (1995) - Kun-Mao Chao, Webb Miller:
Linear-Space Algorithms that Build Local Alignments from Fragments. Algorithmica 13(1/2): 106-134 (1995) - Robert F. Cohen, Roberto Tamassia:
Dynamic Expression Trees. Algorithmica 13(3): 245-265 (1995) - Maxime Crochemore, Wojciech Rytter:
Squares, Cubes, and Time-Space Efficient String Searching. Algorithmica 13(5): 405-425 (1995) - Ding-Zhu Du:
On Greedy Heuristics for Steiner Minimum Trees. Algorithmica 13(4): 381-386 (1995) - David Eppstein:
Asymptotic Speed-Ups in Constructive Solid Geometry. Algorithmica 13(5): 462-471 (1995) - Martin Farach, Sampath Kannan, Tandy J. Warnow:
A Robust Model for Finding Optimal Evolutionary Trees. Algorithmica 13(1/2): 155-179 (1995) - Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995) - Michel Habib, Marianne Huchard, Jeremy P. Spinrad:
A Linear Algorithm To Decompose Inheritance Graphs Into Modules. Algorithmica 13(6): 573-591 (1995) - Xin He:
An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs. Algorithmica 13(6): 553-572 (1995) - Monika Rauch Henzinger:
Fully Dynamic Biconnectivity in Graphs. Algorithmica 13(6): 503-538 (1995) - Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha:
A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems. Algorithmica 13(3): 283-312 (1995) - Michael Jünger, William R. Pulleyblank:
New Primal and Dual Matching Heuristics. Algorithmica 13(4): 357-386 (1995) - John D. Kececioglu, Eugene W. Myers:
Combinatiorial Algorithms for DNA Sequence Assembly. Algorithmica 13(1/2): 7-51 (1995) - John D. Kececioglu, David Sankoff:
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. Algorithmica 13(1/2): 180-210 (1995) - James R. Knight, Eugene W. Myers:
Super-Pattern Matching. Algorithmica 13(1/2): 211-243 (1995) - Anthony Lazanas, Jean-Claude Latombe:
Landmark-Based Robot Navigation. Algorithmica 13(5): 472-501 (1995) - Hans-Peter Lenhof, Michiel H. M. Smid:
Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. Algorithmica 13(3): 301-312 (1995) - Hosam M. Mahmoud:
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. Algorithmica 13(3): 313-323 (1995) - Catherine C. McGeoch:
All-Pairs Shortest Paths and the Essential Subgraph. Algorithmica 13(5): 426-441 (1995) - Eugene W. Myers:
Guest Editor's Foreword: Special Issue on Computational Molecular Biology. Algorithmica 13(1/2): 1-6 (1995) - Pavel A. Pevzner:
DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs. Algorithmica 13(1/2): 77-105 (1995) - Pavel A. Pevzner, Michael S. Waterman:
Multiple Filtration and Approximate Pattern Matching. Algorithmica 13(1/2): 135-154 (1995) - Pedro Jussieu de Rezende, D. T. Lee:
Point Set Pattern Matching in d-Dimensions. Algorithmica 13(4): 387-404 (1995) - Achim Schweikard, Randall H. Wilson:
Assembly Sequences for Polyhedra. Algorithmica 13(6): 539-552 (1995) - Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13(6): 592-618 (1995)
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-06-01 10:48 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