Остановите войну!
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 94 matches
- 2022
- Nikhil Bansal, Christian Coester:
Online Metric Allocation and Time-Varying Regularization. ESA 2022: 13:1-13:13 - Jiehua Chen, Sanjukta Roy:
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. ESA 2022: 36:1-36:16 - Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. ESA 2022: 34:1-34:6 - Shahbaz Khan, Alexandru I. Tomescu:
Optimizing Safe Flow Decompositions in DAGs. ESA 2022: 72:1-72:17 - Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Minimal Connected Dominating Sets. ESA 2022: 1:1-1:15 - Raghavendra Addanki, Andrew McGregor, Cameron Musco:
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries. ESA 2022: 2:1-2:16 - Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. ESA 2022: 3:1-3:15 - Susanne Albers, Sebastian Schubert:
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. ESA 2022: 4:1-4:16 - Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous:
TSP in a Simple Polygon. ESA 2022: 5:1-5:14 - Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. ESA 2022: 6:1-6:18 - Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
Techniques for Generalized Colorful k-Center Problems. ESA 2022: 7:1-7:14 - Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh:
Simple Streaming Algorithms for Edge Coloring. ESA 2022: 8:1-8:4 - Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. ESA 2022: 9:1-9:13 - Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. ESA 2022: 10:1-10:14 - Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA 2022: 12:1-12:16 - Florian Barth, Stefan Funke, Claudius Proissl:
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. ESA 2022: 14:1-14:12 - Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic Token Sliding. ESA 2022: 15:1-15:14 - Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender:
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. ESA 2022: 16:1-16:17 - Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. ESA 2022: 17:1-17:19 - Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. ESA 2022: 18:1-18:20 - Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. ESA 2022: 19:1-19:16 - Daniel Blankenburg:
Resource Sharing Revisited: Local Weak Duality and Optimal Convergence. ESA 2022: 20:1-20:14 - Thomas Bläsius, Philipp Fischbeck:
On the External Validity of Average-Case Analyses of Graph Algorithms. ESA 2022: 21:1-21:14 - Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA 2022: 22:1-22:16 - Kobi Bodek, Moran Feldman:
Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. ESA 2022: 23:1-23:17 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. ESA 2022: 24:1-24:15 - Bartlomiej Bosek, Anna Zych-Pawlewicz:
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. ESA 2022: 25:1-25:14 - Lukasz Bozyk, Michal Pilipczuk:
Polynomial Kernel for Immersion Hitting in Tournaments. ESA 2022: 26:1-26:17 - Jendrik Brachter, Pascal Schweitzer:
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. ESA 2022: 27:1-27:14
skipping 64 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-06-19 08:53 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