![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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
- 2013
- David Adjiashvili, Gianpaolo Oriolo, Marco Senatore:
The Online Replacement Path Problem. ESA 2013: 1-12 - Deepesh Agarwal, Júlio César Silva Araújo
, Christelle Caillouet
, Frédéric Cazals
, David Coudert, Stéphane Pérennes:
Connectivity Inference in Mass Spectrometry Based Structure Determination. ESA 2013: 289-300 - Oswin Aichholzer, Wolfgang Mulzer
, Alexander Pilz
:
Flip Distance between Triangulations of a Simple Polygon is NP-Complete. ESA 2013: 13-24 - Deepak Ajwani
, Nodari Sitchinava:
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. ESA 2013: 25-36 - Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
:
Computing the Greedy Spanner in Linear Space. ESA 2013: 37-48 - Elliot Anshelevich, Onkar Bhardwaj
, Martin Hoefer:
Friendship and Stable Matching. ESA 2013: 49-60 - Lars Arge, Gerth Stølting Brodal
, Jakob Truelsen, Constantinos Tsirogiannis:
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. ESA 2013: 61-72 - Vincenzo Auletta
, Diodato Ferraioli
, Francesco Pasquale
, Paolo Penna, Giuseppe Persiano:
Logit Dynamics with Concurrent Updates for Local Interaction Games. ESA 2013: 73-84 - Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano
, Andrea Ribichini:
On Resilient Graph Spanners. ESA 2013: 85-96 - Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. ESA 2013: 97-108 - Jérémy Barbay
, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti
, Jonathan P. Sorenson
:
Theory and Implementation of Online Multiselection Algorithms. ESA 2013: 109-120 - Andreas Beckmann, Ulrich Meyer, David Veith:
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. ESA 2013: 121-132 - Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
:
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. ESA 2013: 133-144 - Mark de Berg, Dirk H. P. Gerrits:
Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap. ESA 2013: 373-384 - Christoph Berkholz, Paul S. Bonsma, Martin Grohe
:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. ESA 2013: 145-156 - Davide Bilò
, Luciano Gualà
, Guido Proietti
:
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA 2013: 157-168 - Timo Bingmann, Peter Sanders:
Parallel String Sample Sort. ESA 2013: 169-180 - Lélia Blin, Janna Burman, Nicolas Nisse:
Exclusive Graph Searching. ESA 2013: 181-192 - Ivan Bliznets
, Fedor V. Fomin
, Michal Pilipczuk
, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA 2013: 193-204 - Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria:
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology. ESA 2013: 695-706 - Prosenjit Bose
, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. ESA 2013: 205-216 - Jop Briët, Daniel Dadush
, Sebastian Pokutta:
On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity. ESA 2013: 217-228 - Gerth Stølting Brodal
, Andrej Brodnik
, Pooya Davoodi:
The Encoding Complexity of Two Dimensional Range Minimum Data Structures. ESA 2013: 229-240 - Kevin Buchin
, Maike Buchin
, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer
:
Computing the Fréchet Distance with a Retractable Leash. ESA 2013: 241-252 - Kevin Buchin
, Olivier Devillers
, Wolfgang Mulzer
, Okke Schrijvers, Jonathan Richard Shewchuk:
Vertex Deletion for 3D Delaunay Triangulations. ESA 2013: 253-264 - Lucas Moutinho Bueno, Jorge Stolfi:
Economic 3-Colored Subdivision of Triangulations. ESA 2013: 265-276 - Ioannis Caragiannis
, Christos Kaklamanis, Maria Kyropoulou
:
Limitations of Deterministic Auction Design for Correlated Bidders. ESA 2013: 277-288 - Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. ESA 2013: 301-312 - Rajesh Hemant Chitnis
, László Egri, Dániel Marx:
List H-Coloring a Graph by Removing Few Vertices. ESA 2013: 313-324 - Andrea Clementi, Pierluigi Crescenzi
, Carola Doerr
, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale
, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336
skipping 40 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-30 21:35 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