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 21 matches
- 2003
- Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel:
An efficient graph algorithm for dominance constraints. J. Algorithms 48(1): 194-219 (2003) - Amotz Bar-Noy, Richard E. Ladner:
Competitive on-line stream merging algorithms for media-on-demand. J. Algorithms 48(1): 59-90 (2003) - Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003) - Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003) - Erik D. Demaine, Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval. J. Algorithms 48(1): 2-15 (2003) - Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. J. Algorithms 48(1): 135-159 (2003) - Leah Epstein, Tamir Tassa:
Vector assignment problems: a general framework. J. Algorithms 48(2): 360-384 (2003) - Pascal Ferraro, Christophe Godin:
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems. J. Algorithms 48(2): 385-406 (2003) - Amos Fiat, Haim Kaplan:
Making data structures confluently persistent. J. Algorithms 48(1): 16-58 (2003) - Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003) - Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling data transfers in a network and the set scheduling problem. J. Algorithms 48(2): 314-332 (2003) - Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or:
Capacitated vertex covering. J. Algorithms 48(1): 257-270 (2003) - Sudipto Guha, Adam Meyerson, Kamesh Munagala:
A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48(2): 429-440 (2003) - Refael Hassin, Asaf Levin:
Minimum spanning tree with hop restrictions. J. Algorithms 48(1): 220-238 (2003) - Katherine St. John, Tandy J. Warnow, Bernard M. E. Moret, Lisa Vawter:
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. J. Algorithms 48(1): 173-193 (2003) - Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen:
Compact floor-planning via orderly spanning trees. J. Algorithms 48(2): 441-451 (2003) - Ulrich Meyer:
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48(1): 91-134 (2003) - Kirk Pruhs:
Foreword. J. Algorithms 48(1): 1 (2003) - Vijay Raghavan, Jeremy P. Spinrad:
Robust algorithms for restricted domains. J. Algorithms 48(1): 160-172 (2003) - Kunihiko Sadakane:
New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2): 294-313 (2003) - Nodari Vakhania:
A better algorithm for sequencing with release and delivery times on identical machines. J. Algorithms 48(2): 273-293 (2003)
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-10-07 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