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
- Micah Adler, Dan Rubenstein:
Pricing multicasting in more flexible network models. ACM Trans. Algorithms 1(1): 48-73 (2005) - Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2): 243-264 (2005) - Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup:
Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms 1(1): 102-106 (2005) - Marcelo Henriques de Carvalho, Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs. ACM Trans. Algorithms 1(2): 324-337 (2005) - Katarína Cechlárová, Tamás Fleiner:
On a generalization of the stable roommates problem. ACM Trans. Algorithms 1(1): 143-156 (2005) - Marek Chrobak, Petr Kolman, Jirí Sgall:
The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1(2): 350-366 (2005) - Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1): 33-47 (2005) - Jeff Edmonds, Kirk Pruhs:
A maiden analysis of longest wait first. ACM Trans. Algorithms 1(1): 14-32 (2005) - Michael Elkin:
Computing almost shortest paths. ACM Trans. Algorithms 1(2): 283-323 (2005) - Guy Even, Guy Kortsarz, Wolfgang Slany:
On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms 1(1): 74-101 (2005) - Harold N. Gabow:
Editor's foreword. ACM Trans. Algorithms 1(1): 1 (2005) - Ashish Goel, Adam Meyerson, Serge A. Plotkin:
Approximate majorization and fair online load balancing. ACM Trans. Algorithms 1(2): 338-349 (2005) - Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner:
Analysis of linear combination algorithms in cryptography. ACM Trans. Algorithms 1(1): 123-142 (2005) - Svante Janson:
Individual displacements for linear probing hashing with different insertion policies. ACM Trans. Algorithms 1(2): 177-213 (2005) - David S. Johnson:
The NP-completeness column. ACM Trans. Algorithms 1(1): 160-176 (2005) - Raja Jothi, Balaji Raghavachari:
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms 1(2): 265-282 (2005) - Samir Khuller:
Problems column. ACM Trans. Algorithms 1(1): 157-159 (2005) - Doratha E. Drake Vinkemeier, Stefan Hougardy:
A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorithms 1(1): 107-122 (2005) - Alfredo Viola:
Exact distribution of individual displacements in linear probing hashing. ACM Trans. Algorithms 1(2): 214-242 (2005) - Raphael Yuster, Uri Zwick:
Fast sparse matrix multiplication. ACM Trans. Algorithms 1(1): 2-13 (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-09-25 09:18 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