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 18 matches
- 2015
- Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
On Temporally Connected Graphs of Small Cost. WAOA 2015: 84-96 - Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. WAOA 2015: 47-58 - Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Shortest Augmenting Paths for Online Matchings on Trees. WAOA 2015: 59-71 - Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul:
On Independent Set on B1-EPG Graphs. WAOA 2015: 158-169 - Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r. WAOA 2015: 122-132 - Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. WAOA 2015: 183-195 - Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. WAOA 2015: 145-157 - Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama:
Buyback Problem with Discrete Concave Valuation Functions. WAOA 2015: 72-83 - Corinna Gottschalk, Britta Peis:
Submodular Function Maximization on the Bounded Integer Lattice. WAOA 2015: 133-144 - Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal:
Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. WAOA 2015: 13-24 - Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - Yishay Mansour, Boaz Patt-Shamir, Shai Vardi:
Constant-Time Local Computation Algorithms. WAOA 2015: 110-121 - Bodo Manthey, Marten Waanders:
Approximation Algorithms for k-Connected Graph Factors. WAOA 2015: 1-12 - Shay Mozes, Eyal E. Skop:
Efficient Vertex-Label Distance Oracles for Planar Graphs. WAOA 2015: 97-109 - Katarzyna E. Paluch:
Maximum ATSP with Weights Zero and One via Half-Edges. WAOA 2015: 25-34 - Jan Reineke, Alejandro Salinger:
On the Smoothness of Paging Algorithms. WAOA 2015: 170-182 - Veerle Timmermans, Tjark Vredeveld:
Scheduling with State-Dependent Machine Speed. WAOA 2015: 196-208 - Laura Sanità, Martin Skutella:
Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers. Lecture Notes in Computer Science 9499, Springer 2015, ISBN 978-3-319-28683-9 [contents]
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-12-22 07:48 CET 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