Остановите войну!
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 23 matches
- 2001
- Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner:
The k-Client Problem. J. Algorithms 41(2): 115-173 (2001) - Jørgen Bang-Jensen, Anders Yeo:
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. J. Algorithms 41(1): 1-19 (2001) - Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2): 443-470 (2001) - Matthew Cary:
Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms. J. Algorithms 41(2): 417-428 (2001) - Timothy M. Chan, Alon Efrat:
Fly Cheaply: On the Minimum Fuel Consumption Problem. J. Algorithms 41(2): 330-337 (2001) - Amitabh Chaudhary, Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number. J. Algorithms 41(2): 404-416 (2001) - Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. J. Algorithms 41(2): 212-224 (2001) - Zhi-Zhong Chen:
Approximation Algorithms for Independent Sets in Map Graphs. J. Algorithms 41(1): 20-40 (2001) - Jianer Chen, Iyad A. Kanj, Weijia Jia:
Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001) - Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms 41(2): 360-387 (2001) - Milind Dawande, Pinar Keskinocak, Jayashankar M. Swaminathan, Sridhar R. Tayur:
On Bipartite and Multipartite Clique Problems. J. Algorithms 41(2): 388-403 (2001) - Uriel Feige, Michael Langberg:
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. J. Algorithms 41(2): 174-211 (2001) - Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement. J. Algorithms 41(2): 225-243 (2001) - Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh:
Deterministic Dictionaries. J. Algorithms 41(1): 69-85 (2001) - Refael Hassin, Samir Khuller:
z-Approximations. J. Algorithms 41(2): 429-442 (2001) - Kazuo Iwama, Eiji Miyano:
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41(2): 262-279 (2001) - Gabriela Jeronimo, Susana Puddu, Juan Sabia:
Computing Chow Forms and Some Applications. J. Algorithms 41(1): 52-68 (2001) - Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. J. Algorithms 41(1): 99-113 (2001) - Gad M. Landau, Michal Ziv-Ukelson:
On the Common Substring Alignment Problem. J. Algorithms 41(2): 338-359 (2001) - Andrzej Lingas, Hans Olsson, Anna Östlin:
Efficient Merging and Construction of Evolutionary Trees. J. Algorithms 41(1): 41-51 (2001) - Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila:
Algorithms for Leader Election by Cellular Automata. J. Algorithms 41(2): 302-329 (2001) - Peter Sanders, Roberto Solis-Oba:
How Helpers Hasten h-Relations. J. Algorithms 41(1): 86-98 (2001) - Peter Winkler:
Optimality and Greed in Dynamic Allocation. J. Algorithms 41(2): 244-261 (2001)
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-23 15:38 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