Остановите войну!
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
- 2013
- Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7846, Springer 2013, ISBN 978-3-642-38015-0 [contents] - 2012
- Sara Ahmadian, Chaitanya Swamy:
Improved Approximation Guarantees for Lower-Bounded Facility Location. WAOA 2012: 257-271 - János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza:
Black and White Bin Packing. WAOA 2012: 131-144 - Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A Better Randomized 2-Server Algorithm on the Line. WAOA 2012: 120-130 - Nikhil Bansal:
The Primal-Dual Approach for Online Algorithms. WAOA 2012: 1 - Therese Biedl:
A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs. WAOA 2012: 272-285 - Vittorio Bilò:
A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. WAOA 2012: 215-228 - Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. WAOA 2012: 229-241 - Markus Chimani, Joachim Spoerhase:
Approximating Spanning Trees with Few Branches. WAOA 2012: 30-41 - Stefan Dobrev, Rastislav Královic, Richard Královic:
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). WAOA 2012: 2-15 - Trivikram Dokka, Marin Bougeret, Vincent Boudet, Rodolphe Giroudeau, Frits C. R. Spieksma:
Approximation Algorithms for the Wafer to Wafer Integration Problem. WAOA 2012: 286-297 - Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco:
On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. WAOA 2012: 93-106 - Christoph Dürr, Ioannis Milis, Julien Robert, Georgios Zois:
Approximating the Throughput by Coolest First Scheduling. WAOA 2012: 187-200 - Guy Even, Moti Medina:
Online Multi-Commodity Flow with High Demands. WAOA 2012: 16-29 - Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado:
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. WAOA 2012: 82-92 - Robert Georges, Frank Hoffmann, Klaus Kriegel:
Online Exploration of Polygons with Holes. WAOA 2012: 56-69 - Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs:
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA 2012: 173-186 - Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract). WAOA 2012: 42-55 - Janardhan Kulkarni, Kamesh Munagala:
Algorithms for Cost-Aware Scheduling. WAOA 2012: 201-214 - Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis:
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA 2012: 159-172 - Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. WAOA 2012: 70-81 - Alejandro López-Ortiz, Alejandro Salinger:
Minimizing Cache Usage in Paging. WAOA 2012: 145-158 - Akira Matsubayashi:
Asymptotically Optimal Online Page Migration on Three Points. WAOA 2012: 107-119 - Martin Niemeier, Andreas Wiese:
Scheduling with an Orthogonal Resource Constraint. WAOA 2012: 242-256
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-04-25 09:24 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