Остановите войну!
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 24 matches
- 2011
- Klaus Jansen, Roberto Solis-Oba:
Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers. Lecture Notes in Computer Science 6534, Springer 2011, ISBN 978-3-642-18317-1 [contents] - 2010
- Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. WAOA 2010: 1-12 - Spyridon Antonakopoulos:
Approximating Directed Buy-at-Bulk Network Design. WAOA 2010: 13-24 - János Balogh, József Békési, Gábor Galambos:
New Lower Bounds for Certain Classes of Bin Packing Algorithms. WAOA 2010: 25-36 - Magnus Bordewich:
On the Approximation Complexity Hierarchy. WAOA 2010: 37-46 - Patrick Briest, Heiko Röglin:
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. WAOA 2010: 47-58 - Ho-Leung Chan, Tak Wah Lam, Rongbin Li:
Tradeoff between Energy and Throughput for Online Deadline Scheduling. WAOA 2010: 59-70 - Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid:
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 - Danny Z. Chen, Rudolf Fleischer, Jian Li:
Densest k-Subgraph Approximation on Intersection Graphs. WAOA 2010: 83-93 - Aparna Das, Claire Mathieu, Shay Mozes:
The Train Delivery Problem - Vehicle Routing Meets Bin Packing. WAOA 2010: 94-105 - Daniel Dressler, Martin Skutella:
An FPTAS for Flows over Time with Aggregate Arc Capacities. WAOA 2010: 106-117 - Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. WAOA 2010: 118-129 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Approximation Algorithms for Domination Search. WAOA 2010: 130-141 - Caroline J. Jagtenberg, Uwe Schwiegelshohn, Marc Uetz:
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling. WAOA 2010: 142-153 - Lior Kamma, Zeev Nutov:
Approximating Survivable Networks with Minimum Number of Steiner Points. WAOA 2010: 154-165 - Andreas Karrenbauer, Thomas Rothvoß:
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks. WAOA 2010: 166-177 - Tak Wah Lam, Chi-Man Liu, Hing-Fung Ting:
Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data. WAOA 2010: 178-189 - Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games on Expanders. WAOA 2010: 190-200 - Claire Mathieu, Adrian Vladu:
Online Ranking for Tournament Graphs. WAOA 2010: 201-212 - Britta Peis, Andreas Wiese:
Throughput Maximization for Periodic Packet Routing on Trees and Grids. WAOA 2010: 213-224 - David Pritchard:
k-Edge-Connectivity: Approximation and LP Relaxation. WAOA 2010: 225-236 - Kirk Pruhs, Julien Robert, Nicolas Schabanel:
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability. WAOA 2010: 237-248 - Rob van Stee:
An Improved Algorithm for Online Rectangle Filling. WAOA 2010: 249-260 - Tomoyuki Yamakami:
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems. WAOA 2010: 261-272
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-06 01:52 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