Остановите войну!
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 17 matches
- 2017
- Klaus Jansen, Monaldo Mastrolilli:
Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10138, Springer 2017, ISBN 978-3-319-51740-7 [contents] - 2016
- Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng:
The Shortest Separating Cycle Problem. WAOA 2016: 1-13 - Yossi Azar, Adi Vardi:
Dynamic Traveling Repair Problem with an Arbitrary Time Window. WAOA 2016: 14-26 - Amotz Bar-Noy, George Rabanca:
Tight Approximation Bounds for the Seminar Assignment Problem. WAOA 2016: 170-182 - André Berger, Alexander Grigoriev, Andrej Winokurow:
A PTAS for the Cluster Editing Problem on Planar Graphs. WAOA 2016: 27-39 - Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. WAOA 2016: 40-51 - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. WAOA 2016: 52-64 - Parinya Chalermsook, Daniel Vaz:
New Integrality Gap Results for the Firefighters Problem on Trees. WAOA 2016: 65-77 - Astha Chauhan, N. S. Narayanaswamy:
A Refined Analysis of Online Path Coloring in Trees. WAOA 2016: 142-154 - Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the Scenario Model. WAOA 2016: 183-196 - Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy:
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. WAOA 2016: 78-91 - Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
Balanced Optimization with Vector Costs. WAOA 2016: 92-102 - Gramoz Goranci, Harald Räcke:
Vertex Sparsification in Trees. WAOA 2016: 103-115 - Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin:
Scenario Submodular Cover. WAOA 2016: 116-128 - Akira Matsubayashi:
Non-greedy Online Steiner Trees on Outerplanar Graphs. WAOA 2016: 129-141 - Roy B. Ofer, Tami Tamir:
Resource Allocation Games with Multiple Resource Classes. WAOA 2016: 155-169 - Felix J. L. Willamowski, Andreas Bley:
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. WAOA 2016: 197-209
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-22 09:31 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