Остановите войну!
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 85 matches
- 2020
- Rajiv Raman, Saurabh Ray:
Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ESA 2020: 78:1-78:16 - Johannes Blum, Sabine Storandt:
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies. ESA 2020: 20:1-20:14 - Tanmay Inamdar, Kasturi R. Varadarajan:
Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ESA 2020: 62:1-62:17 - Lin Chen, Martin Koutecký, Lei Xu, Weidong Shi:
New Bounds on Augmenting Steps of Block-Structured Integer Programs. ESA 2020: 33:1-33:19 - A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. ESA 2020: 1:1-1:16 - Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Parallel Batch-Dynamic Trees via Change Propagation. ESA 2020: 2:1-2:23 - Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Reconstructing Biological and Digital Phylogenetic Trees in Parallel. ESA 2020: 3:1-3:24 - Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. ESA 2020: 4:1-4:21 - Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky:
Analysis of the Period Recovery Error Bound. ESA 2020: 5:1-5:21 - Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke:
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ESA 2020: 6:1-6:24 - Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. ESA 2020: 7:1-7:23 - Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover with Delay - Clairvoyance Is Not Required. ESA 2020: 8:1-8:21 - Sayan Bandyapadhyay:
Improved Bounds for Metric Capacitated Covering Problems. ESA 2020: 9:1-9:17 - Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz:
Minimum Neighboring Degree Realization in Graphs and Trees. ESA 2020: 10:1-10:15 - Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram:
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. ESA 2020: 11:1-11:17 - Surender Baswana, Shiv Kumar Gupta, Till Knollmann:
Mincut Sensitivity Data Structures for the Insertion of an Edge. ESA 2020: 12:1-12:14 - Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. ESA 2020: 13:1-13:13 - Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. ESA 2020: 14:1-14:19 - Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan:
On the Complexity of BWT-Runs Minimization via Alphabet Reordering. ESA 2020: 15:1-15:13 - Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Simulating Population Protocols in Sub-Constant Time per Interaction. ESA 2020: 16:1-16:22 - Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA 2020: 17:1-17:12 - Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not so Greedy k-Means++. ESA 2020: 18:1-18:21 - Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ESA 2020: 19:1-19:24 - Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Minimization of Random Hypergraphs. ESA 2020: 21:1-21:15 - Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA 2020: 22:1-22:22 - Édouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant:
An Algorithmic Weakening of the Erdős-Hajnal Conjecture. ESA 2020: 23:1-23:18 - Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa:
Reconfiguration of Spanning Trees with Many or Few Leaves. ESA 2020: 24:1-24:15 - Karl Bringmann, Marvin Künnemann, André Nusser:
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. ESA 2020: 25:1-25:17 - Peter A. Brooksbank, Yinan Li, Youming Qiao, James B. Wilson:
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice. ESA 2020: 26:1-26:15 - Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
Sometimes Reliable Spanners of Almost Linear Size. ESA 2020: 27:1-27:15
skipping 55 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-19 00:50 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