Остановите войну!
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 76 matches
- 2021
- Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid Recognition: Classical and Parameterized Computational Perspectives. ISAAC 2021: 37:1-37:15 - Susanne Albers, Waldo Gálvez, Maximilian Janke:
Machine Covering in the Random-Order Model. ISAAC 2021: 52:1-52:16 - Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. ISAAC 2021: 54:1-54:17 - Shinwoo An, Eunjin Oh:
Feedback Vertex Set on Geometric Intersection Graphs. ISAAC 2021: 47:1-47:12 - Markus Anders, Jendrik Brachter, Pascal Schweitzer:
A Characterization of Individualization-Refinement Trees. ISAAC 2021: 24:1-24:14 - Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar:
Skeletons and Minimum Energy Scheduling. ISAAC 2021: 51:1-51:16 - Eloi Araujo, Luiz C. S. Rozante, Diego P. Rubert, Fábio Viduani Martinez:
Algorithms for Normalized Multiple Sequence Alignments. ISAAC 2021: 40:1-40:16 - Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15 - Takao Asano:
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. ISAAC 2021: 68:1-68:17 - Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland:
Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC 2021: 30:1-30:11 - Joyce Bacic, Saeed Mehrabi, Michiel Smid:
Shortest Beer Path Queries in Outerplanar Graphs. ISAAC 2021: 62:1-62:16 - Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC 2021: 44:1-44:14 - Aritra Banik, Rajiv Raman, Saurabh Ray:
On Geometric Priority Set Cover Problems. ISAAC 2021: 12:1-12:14 - Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel:
Selected Neighbor Degree Forest Realization. ISAAC 2021: 27:1-27:15 - Sam Barr, Therese Biedl:
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest. ISAAC 2021: 16:1-16:15 - Florian Barth, Stefan Funke, Claudius Proissl:
Preference-Based Trajectory Clustering - An Application of Geometric Hitting Sets. ISAAC 2021: 15:1-15:14 - Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. ISAAC 2021: 22:1-22:15 - Sarita de Berg, Frank Staals:
Dynamic Data Structures for k-Nearest Neighbor Queries. ISAAC 2021: 14:1-14:14 - Sujoy Bhore, Rahul Jain:
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs. ISAAC 2021: 63:1-63:17 - Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. ISAAC 2021: 19:1-19:17 - Leyla Biabani, Mark de Berg, Morteza Monemizadeh:
Maximum-Weight Matching in Sliding Windows and Beyond. ISAAC 2021: 73:1-73:16 - Ahmad Biniaz:
Approximating Longest Spanning Tree with Neighborhoods. ISAAC 2021: 7:1-7:11 - Mitchell Black, William Maxwell:
Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. ISAAC 2021: 31:1-31:27 - Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. ISAAC 2021: 29:1-29:17 - Prosenjit Bose:
Spanning Properties of Variants of the Delaunay Graph (Invited Talk). ISAAC 2021: 2:1-2:1 - Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Partitioning H-Free Graphs of Bounded Diameter. ISAAC 2021: 21:1-21:14 - Clément L. Canonne, Karl Wimmer:
Identity Testing Under Label Mismatch. ISAAC 2021: 55:1-55:17 - Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. ISAAC 2021: 65:1-65:19 - Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC 2021: 48:1-48:17 - Siu-Wing Cheng, Man Ting Wong:
Self-Improving Voronoi Construction for a Hidden Mixture of Product Distributions. ISAAC 2021: 8:1-8:13
skipping 46 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-11 02: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