Остановите войну!
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 84 matches
- 2021
- Aaron Roth:
A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk). ESA 2021: 2:1-2:1 - M. S. Ramanujan:
On Approximate Compressions for Connected Minor-Hitting Sets. ESA 2021: 78:1-78:16 - Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA 2021: 49:1-49:15 - Katarzyna Paluch, Mateusz Wasylkiewicz:
Restricted t-Matchings via Half-Edges. ESA 2021: 73:1-73:17 - Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-Directional A. ESA 2021: 3:1-3:15 - Maor Akav, Liam Roditty:
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. ESA 2021: 4:1-4:18 - Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland:
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. ESA 2021: 5:1-5:16 - Markus Anders, Pascal Schweitzer:
Parallel Computation of Combinatorial Symmetries. ESA 2021: 6:1-6:18 - Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
Graph Connectivity and Single Element Recovery via Linear and OR Queries. ESA 2021: 7:1-7:19 - Sepehr Assadi, Shay Solomon:
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. ESA 2021: 8:1-8:18 - Nikhil Ayyadevara, Ashish Chiplunkar:
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. ESA 2021: 9:1-9:11 - Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA 2021: 10:1-10:18 - Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh:
k-Distinct Branchings Admits a Polynomial Kernel. ESA 2021: 11:1-11:15 - Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. ESA 2021: 12:1-12:18 - Mark de Berg, Morteza Monemizadeh, Yu Zhong:
k-Center Clustering with Outliers in the Sliding-Window Model. ESA 2021: 13:1-13:13 - Aaron Bernstein, Aditi Dudeja, Seth Pettie:
Incremental SCC Maintenance in Sparse Graphs. ESA 2021: 14:1-14:16 - Nico Bertram, Jonas Ellert, Johannes Fischer:
Lyndon Words Accelerate Suffix Sorting. ESA 2021: 15:1-15:13 - Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. ESA 2021: 16:1-16:19 - Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. ESA 2021: 17:1-17:18 - Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA 2021: 18:1-18:17 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA 2021: 20:1-20:15 - Thomas Bläsius, Tobias Friedrich, Christopher Weyand:
Efficiently Computing Maximum Flows in Scale-Free Networks. ESA 2021: 21:1-21:14 - Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ESA 2021: 19:1-19:14 - Alexander Braun, Matthias Buttkus, Thomas Kesselheim:
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. ESA 2021: 22:1-22:16 - David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie:
Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. ESA 2021: 23:1-23:18 - Jean Cardinal, Justin Dallant, John Iacono:
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA 2021: 24:1-24:14 - Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. ESA 2021: 25:1-25:15 - Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. ESA 2021: 26:1-26:15 - Timothy M. Chan:
All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. ESA 2021: 27:1-27:9 - Timothy M. Chan, Zhengcheng Huang:
Dynamic Colored Orthogonal Range Searching. ESA 2021: 28:1-28:13
skipping 54 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-04-25 15:06 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