
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 year
- no options
- temporarily not available
Publication search results
found 75 matches
- 2018
- Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye:
A Polynomial Kernel for Diamond-Free Editing. ESA 2018: 10:1-10:13 - Yan Gu, Yihan Sun, Guy E. Blelloch:
Algorithmic Building Blocks for Asymmetric Memories. ESA 2018: 44:1-44:15 - Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy:
Algorithms for Inverse Optimization Problems. ESA 2018: 1:1-1:14 - Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-Dimensional Maximal Repetitions. ESA 2018: 2:1-2:14 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA 2018: 3:1-3:14 - Nicolas Auger, Vincent Jugé, Cyril Nicaud, Carine Pivoteau:
On the Worst-Case Complexity of TimSort. ESA 2018: 4:1-4:13 - János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
A New and Improved Algorithm for Online Bin Packing. ESA 2018: 5:1-5:14 - Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions. ESA 2018: 6:1-6:13 - Luca Becchetti, Andrea E. F. Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan
:
Average Whenever You Meet: Opportunistic Protocols for Community Detection. ESA 2018: 7:1-7:13 - Amariah Becker, Philip N. Klein, David Saulpic:
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension. ESA 2018: 8:1-8:15 - Umang Bhaskar, Phani Raj Lolakapuri:
Equilibrium Computation in Atomic Splittable Routing Games. ESA 2018: 58:1-58:14 - Lucas Boczkowski, Amos Korman, Yoav Rodeh:
Searching a Tree with Permanently Noisy Advice. ESA 2018: 54:1-54:13 - Jean-Daniel Boissonnat, Siddharth Pritam, Divyansh Pareek:
Strong Collapse for Persistence. ESA 2018: 67:1-67:13 - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. ESA 2018: 22:1-22:13 - Sebastian Brandt, Seth Pettie, Jara Uitto:
Fine-grained Lower Bounds on Cops and Robbers. ESA 2018: 9:1-9:12 - Corrie Jacobien Carstens, Michael Hamann
, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA 2018: 11:1-11:15 - Sankardeep Chakraborty, Anish Mukherjee
, Venkatesh Raman, Srinivasa Rao Satti:
A Framework for In-place Graph Algorithms. ESA 2018: 13:1-13:16 - Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh:
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. ESA 2018: 12:1-12:15 - Cameron T. Chalk, Austin Luchsinger, Robert T. Schweller, Tim Wylie:
Self-Assembly of Any Shape with Constant Tile Types using High Temperature. ESA 2018: 14:1-14:14 - T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang
:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. ESA 2018: 15:1-15:13 - Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes
, Oren Weimann
:
Near-Optimal Distance Emulator for Planar Graphs. ESA 2018: 16:1-16:17 - Steven Chaplick
, Minati De, Alexander Ravsky, Joachim Spoerhase:
Approximation Schemes for Geometric Coverage Problems. ESA 2018: 17:1-17:15 - Yun Kuen Cheung, Richard Cole:
Amortized Analysis of Asynchronous Price Dynamics. ESA 2018: 18:1-18:15 - Markus Chimani, Tilo Wiedera:
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. ESA 2018: 19:1-19:14 - Rajesh Chitnis
, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. ESA 2018: 20:1-20:16 - Marek Cygan
, Artur Czumaj, Marcin Mucha
, Piotr Sankowski:
Online Facility Location with Deletions. ESA 2018: 21:1-21:15 - Hu Ding, Manni Liu:
On Geometric Prototype and Applications. ESA 2018: 23:1-23:15 - Michael Dinitz, Michael Schapira, Gal Shahaf:
Large Low-Diameter Graphs are Good Expanders. ESA 2018: 71:1-71:15 - Dani Dorfman, Haim Kaplan, László Kozma, Seth Pettie, Uri Zwick:
Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. ESA 2018: 24:1-24:13 - Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub:
Truthful Prompt Scheduling for Minimizing Sum of Completion Times. ESA 2018: 27:1-27:14
skipping 45 more matches
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
retrieved on 2021-02-28 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