![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 16 matches
- 2004
- Noga Alon, Gregory Z. Gutin, Michael Krivelevich:
Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004) - Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004) - Matthew Andrews:
Instability of FIFO in session-oriented networks. J. Algorithms 50(2): 232-245 (2004) - László Babai
, Igor Pak:
Strong bias of group generators: an obstacle to the "product replacement algorithm". J. Algorithms 50(2): 215-231 (2004) - Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert:
The complexity of finding small triangulations of convex 3-polytopes. J. Algorithms 50(2): 134-167 (2004) - Markus Bläser:
An 8/13-approximation algorithm for the asymmetric maximum TSP. J. Algorithms 50(1): 23-48 (2004) - Lenore Cowen
, Christopher G. Wagner:
Compact roundtrip routing in directed networks. J. Algorithms 50(1): 79-95 (2004) - Sorina Dumitrescu, Xiaolin Wu:
Algorithms for optimal multi-resolution quantization. J. Algorithms 50(1): 1-22 (2004) - William S. Evans, David G. Kirkpatrick:
Restructuring ordered binary trees. J. Algorithms 50(2): 168-193 (2004) - Naveen Garg
, Vijay V. Vazirani, Mihalis Yannakakis:
Multiway cuts in node weighted graphs. J. Algorithms 50(1): 49-61 (2004) - Michel X. Goemans, Martin Skutella:
Cooperative facility location games. J. Algorithms 50(2): 194-214 (2004) - Yijie Han:
Deterministic sorting in O(nloglogn) time and linear space. J. Algorithms 50(1): 96-105 (2004) - Weijia Jia, Chuanlin Zhang, Jianer Chen:
An efficient parameterized algorithm for m-set packing. J. Algorithms 50(1): 106-117 (2004) - Md. Saidur Rahman
, Takao Nishizeki, Shubhashis Ghosh:
Rectangular drawings of planar graphs. J. Algorithms 50(1): 62-78 (2004) - David B. Shmoys
:
Foreword. J. Algorithms 50(2): 133 (2004) - Sundar Vishwanathan:
An approximation algorithm for finding long paths in Hamiltonian graphs. J. Algorithms 50(2): 246-256 (2004)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-24 22:16 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