Остановите войну!
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
- 2010
- Evripidis Bampis, Klaus Jansen:
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers. Lecture Notes in Computer Science 5893, Springer 2010, ISBN 978-3-642-12449-5 [contents] - 2009
- Spyros Angelopoulos:
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. WAOA 2009: 1-12 - Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24 - Marcin Bienkowski:
Price Fluctuations: To Buy or to Rent. WAOA 2009: 25-36 - Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximation Algorithms for Multiple Strip Packing. WAOA 2009: 37-48 - Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. WAOA 2009: 49-61 - Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA 2009: 62-74 - Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov:
The Routing Open Shop Problem: New Approximation Algorithms. WAOA 2009: 75-85 - George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee:
On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97 - Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms. WAOA 2009: 104-115 - Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online Scheduling of Bounded Length Jobs to Maximize Throughput. WAOA 2009: 116-127 - Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-Server Work Function Algorithm. WAOA 2009: 128-134 - Thomas Erlebach, Matús Mihalák:
A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA 2009: 135-146 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Guard Games on Graphs: Keep the Intruder Out! WAOA 2009: 147-158 - Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
Between a Rock and a Hard Place: The Two-to-One Assignment Problem. WAOA 2009: 159-169 - Elisabeth Günther, Felix G. König, Nicole Megow:
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. WAOA 2009: 170-181 - Xin Han, Kazuhisa Makino:
Online Minimization Knapsack Problem. WAOA 2009: 182-193 - Danny Hermelin, Dror Rawitz:
Optimization Problems in Multiple Subtree Graphs. WAOA 2009: 194-204 - Bodo Manthey:
Multi-Criteria TSP: Min and Max Combined. WAOA 2009: 205-216 - Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing: Complexity and Algorithms. WAOA 2009: 217-228 - Atish Das Sarma, Amit Deshpande, Ravi Kannan:
Finding Dense Subgraphs in G(n, 1/2). WAOA 2009: 98-103 - Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA 2009: 229-241 - Prudence W. H. Wong, Fencol C. C. Yung:
Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing. WAOA 2009: 242-254
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-07-15 07:08 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