Остановите войну!
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 67 matches
- 2020
- Ke Yi:
Worst-Case Optimal Join Algorithms (Invited Talk). ISAAC 2020: 2:1-2:1 - Nikhil Kumar:
Multicommodity Flows in Planar Graphs with Demands on Faces. ISAAC 2020: 41:1-41:11 - Eunjin Oh:
Shortest-Path Queries in Geometric Networks. ISAAC 2020: 52:1-52:15 - Bartlomiej Dudek, Pawel Gawrychowski:
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. ISAAC 2020: 23:1-23:18 - Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu:
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. ISAAC 2020: 25:1-25:18 - Trung Thanh Nguyen, Jörg Rothe:
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. ISAAC 2020: 14:1-14:14 - Ke Chen, Adrian Dumitrescu:
Multiparty Selection. ISAAC 2020: 42:1-42:13 - Anadi Agrawal, Pawel Gawrychowski:
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. ISAAC 2020: 4:1-4:12 - Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC 2020: 62:1-62:16 - Leo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang:
Arithmetic Expression Construction. ISAAC 2020: 12:1-12:15 - Amihood Amir, Itai Boneh:
Update Query Time Trade-Off for Dynamic Suffix Arrays. ISAAC 2020: 63:1-63:16 - Boris Aronov, Jean Cardinal:
Geometric Pattern Matching Reduces to k-SUM. ISAAC 2020: 32:1-32:9 - Takao Asano, Hiroyuki Umeda:
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. ISAAC 2020: 15:1-15:16 - Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad:
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping. ISAAC 2020: 44:1-44:17 - Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC 2020: 59:1-59:15 - Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC 2020: 36:1-36:14 - Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. ISAAC 2020: 39:1-39:15 - Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. ISAAC 2020: 60:1-60:15 - Umang Bhaskar, Gunjan Kumar:
Partial Function Extension with Applications to Learning and Property Testing. ISAAC 2020: 46:1-46:16 - Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings. ISAAC 2020: 48:1-48:16 - Nicolas Bousquet, Alice Joffard, Paul Ouvrard:
Linear Transformations Between Dominating Sets in the TAR-Model. ISAAC 2020: 37:1-37:14 - Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible List Colorings in Graphs with Special Degeneracy Conditions. ISAAC 2020: 31:1-31:15 - Guido Brückner, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Level Planarity. ISAAC 2020: 8:1-8:15 - Josh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman:
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. ISAAC 2020: 17:1-17:14 - Angel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie:
Signal Passing Self-Assembly Simulates Tile Automata. ISAAC 2020: 53:1-53:17 - Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
Finding Temporal Paths Under Waiting Time Constraints. ISAAC 2020: 30:1-30:18 - Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC 2020: 7:1-7:15 - Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ISAAC 2020: 58:1-58:17 - Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang:
Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. ISAAC 2020: 47:1-47:17 - Erik D. Demaine, Justin Kopinsky, Jayson Lynch:
Recursed Is Not Recursive: A Jarring Result. ISAAC 2020: 50:1-50:15
skipping 37 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-07 11:20 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