Остановите войну!
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
- 2005
- Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang:
Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica 42(3-4): 203-219 (2005) - Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan:
Approximation Algorithms for a k-Line Center. Algorithmica 42(3-4): 221-230 (2005) - Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) - Georg Baier, Ekkehard Köhler, Martin Skutella:
The k-Splittable Flow Problem. Algorithmica 42(3-4): 231-248 (2005) - Markus Bläser, Bodo Manthey:
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. Algorithmica 42(2): 121-139 (2005) - Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005) - Prosenjit Bose, Pat Morin:
Guest Editors' Foreword. Algorithmica 42(1): 1-2 (2005) - Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu:
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. Algorithmica 42(3-4): 265-288 (2005) - Luc Devroye:
Universal Asymptotics for Random Tries and PATRICIA Trees. Algorithmica 42(1): 11-29 (2005) - Hiroshi Fujiwara, Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems. Algorithmica 42(1): 95-107 (2005) - Sumanta Guha, Son Dinh Tran:
Reconstructing Curves without Delaunay Computation. Algorithmica 42(1): 75-94 (2005) - Jason D. Hartline, Edwin S. Hong, Alexander E. Mohr, William R. Pentney, Emily Rocke:
Characterizing History Independent Data Structures. Algorithmica 42(1): 57-74 (2005) - Seok-Hee Hong, Peter Eades:
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica 42(2): 159-197 (2005) - John Iacono:
Key-Independent Optimality. Algorithmica 42(1): 3-10 (2005) - John Iacono, Stefan Langerman:
Queaps. Algorithmica 42(1): 49-56 (2005) - Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky:
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem. Algorithmica 42(2): 109-120 (2005) - Rolf H. Möhring, Rajeev Raman:
Preface. Algorithmica 42(3-4): 199-201 (2005) - Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama:
A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. Algorithmica 42(2): 141-158 (2005) - Kirk Pruhs, Patchrawat Uthaisombut:
A Comparison of Multicast Pull Models. Algorithmica 42(3-4): 289-307 (2005) - Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica 42(3-4): 309-334 (2005)
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-30 20:00 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