Остановите войну!
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 70 matches
- 2014
- Amir Abboud, Kevin Lewi, Ryan Williams:
Losing Weight by Gaining Edges. ESA 2014: 1-12 - Fidaa Abed, José R. Correa, Chien-Chung Huang:
Optimal Coordination Mechanisms for Multi-job Scheduling Games. ESA 2014: 13-24 - Umut A. Acar, Arthur Charguéraud, Mike Rainey:
Theory and Practice of Chunked Sequences. ESA 2014: 25-36 - Rachit Agarwal:
The Space-Stretch-Time Tradeoff in Distance Oracles. ESA 2014: 49-60 - Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang:
Convex Hulls under Uncertainty. ESA 2014: 37-48 - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink:
Distribution-Sensitive Construction of the Greedy Spanner. ESA 2014: 61-73 - Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard:
Recognizing Shrinkable Complexes Is NP-Complete. ESA 2014: 74-86 - Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. ESA 2014: 100-111 - Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Improved Approximation Algorithms for Box Contact Representations. ESA 2014: 87-99 - Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai:
The Batched Predecessor Problem in External Memory. ESA 2014: 112-124 - Arnab Bhattacharyya:
Polynomial Decompositions in Polynomial Time. ESA 2014: 125-136 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Fault-Tolerant Approximate Shortest-Path Trees. ESA 2014: 137-148 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Fast Witness Extraction Using a Decision Oracle. ESA 2014: 149-160 - Thomas Bläsius, Guido Brückner, Ignaz Rutter:
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. ESA 2014: 161-172 - Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA 2014: 173-184 - Jean-Daniel Boissonnat, Clément Maria:
Computing Persistent Homology with Various Coefficient Fields in a Single Pass. ESA 2014: 185-196 - Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. ESA 2014: 197-208 - Martijn van Brink, Ruben van der Zwaan:
A Branch and Price Procedure for the Container Premarshalling Problem. ESA 2014: 798-809 - Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA 2014: 209-221 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal:
Improved Algorithms for Resource Allocation under Varying Capacity. ESA 2014: 222-234 - Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer:
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. ESA 2014: 235-246 - Timothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou:
Succinct Indices for Path Minimum, with Applications to Path Reporting. ESA 2014: 247-259 - Moses Charikar, Monika Henzinger, Huy L. Nguyen:
Online Bipartite Matching with Decomposable Weights. ESA 2014: 260-271 - Siu-Wing Cheng, Liam Mencel, Antoine Vigneron:
A Faster Algorithm for Computing Straight Skeletons. ESA 2014: 272-283 - Omar Darwish, Amr Elmasry:
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem. ESA 2014: 284-295 - Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. ESA 2014: 296-308 - Brian C. Dean, Rommel Jalasutram, Chad G. Waters:
Lightweight Approximate Selection. ESA 2014: 309-320 - Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - Zdenek Dvorák, Martin Kupec, Vojtech Tuma:
A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth. ESA 2014: 334-345 - Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. ESA 2014: 346-357
skipping 40 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).
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-30 21:10 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