Остановите войну!
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
- 2012
- Roberto Solis-Oba, Giuseppe Persiano:
Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7164, Springer 2012, ISBN 978-3-642-29115-9 [contents] - 2011
- Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246 - Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 - Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara:
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. WAOA 2011: 35-48 - Ljiljana Brankovic, Henning Fernau:
Parameterized Approximation Algorithms for Hitting Set. WAOA 2011: 63-76 - Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA 2011: 164-175 - Reza Dorrigiv, Alejandro López-Ortiz:
A New Perspective on List Update: Probabilistic Locality and Working Set. WAOA 2011: 150-163 - Tomás Ebenlendr, Jirí Sgall:
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. WAOA 2011: 102-108 - Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha:
Optimization over Integers with Robustness in Cost and Few Constraints. WAOA 2011: 89-101 - Martin Groß, Martin Skutella:
Generalized Maximum Flows over Time. WAOA 2011: 247-260 - Rolf Harren, Walter Kern:
Improved Lower Bound for Online Strip Packing - (Extended Abstract). WAOA 2011: 211-218 - Ruben Hoeksma, Marc Uetz:
The Price of Anarchy for Minsum Related Machine Scheduling. WAOA 2011: 261-273 - Klaus Jansen:
Approximation Algorithms for Scheduling and Packing Problems. WAOA 2011: 1-8 - Klaus Jansen, Christina Robenek:
Scheduling Jobs on Identical and Uniform Processors Revisited. WAOA 2011: 109-122 - Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Competitive Router Scheduling with Structured Data. WAOA 2011: 219-232 - Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld:
Learning in Stochastic Machine Scheduling. WAOA 2011: 21-34 - Zeev Nutov:
Approximating Subset k-Connectivity Problems. WAOA 2011: 9-20 - Katarzyna E. Paluch:
Faster and Simpler Approximation of Stable Matchings. WAOA 2011: 176-187 - Marc P. Renault, Adi Rosén:
On Online Algorithms with Advice for the k-Server Problem. WAOA 2011: 198-210 - Nadine Schwartges, Joachim Spoerhase, Alexander Wolff:
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. WAOA 2011: 77-88 - David B. Shmoys, Gwen Spencer:
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. WAOA 2011: 123-136 - Jianqiao Zhu, Ho-Leung Chan, Tak Wah Lam:
Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models. WAOA 2011: 137-149 - Anke van Zuylen:
Simpler 3/4-Approximation Algorithms for MAX SAT. WAOA 2011: 188-197
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-25 16:40 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