Остановите войну!
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 44 matches
- 2017
- Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. Discret. Comput. Geom. 58(4): 757-784 (2017) - Michal Adamaszek, Florian Frick, Adrien Vakili:
On Homotopy Types of Euclidean Rips Complexes. Discret. Comput. Geom. 58(3): 526-542 (2017) - Pankaj K. Agarwal, Alon Efrat, Swaminathan Sankararaman, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty I. Discret. Comput. Geom. 58(3): 705-745 (2017) - Ron Aharoni, Ron Holzman, Shira Zerbib:
Edge-Covers in d-Interval Hypergraphs. Discret. Comput. Geom. 58(3): 650-662 (2017) - Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. Discret. Comput. Geom. 58(4): 785-821 (2017) - Jin Akiyama, Kiyoko Matsunaga:
Generalization of Haberdasher's Puzzle. Discret. Comput. Geom. 58(1): 30-50 (2017) - Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi Diagrams. Discret. Comput. Geom. 58(4): 822-848 (2017) - Dennis Amelunxen, Martin Lotz:
Intrinsic Volumes of Polyhedral Cones: A Combinatorial Perspective. Discret. Comput. Geom. 58(2): 371-409 (2017) - Maxim Arnold, Dmitry Fuchs, Ivan Izmestiev, Serge Tabachnikov, Emmanuel Tsukerman:
Iterating Evolutes and Involutes. Discret. Comput. Geom. 58(1): 80-143 (2017) - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58(4): 849-870 (2017) - Biplab Basak:
3-Regular Colored Graphs and Classification of Surfaces. Discret. Comput. Geom. 58(2): 345-354 (2017) - Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. 58(2): 482-504 (2017) - Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance. Discret. Comput. Geom. 58(1): 180-216 (2017) - Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. 58(4): 871-888 (2017) - Nicolas Ariel Capitelli, Elias Gabriel Minian:
A Simplicial Complex is Uniquely Determined by Its Set of Discrete Morse Functions. Discret. Comput. Geom. 58(1): 144-157 (2017) - Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. Discret. Comput. Geom. 58(4): 889-920 (2017) - Robert Connelly, Matthew Funkhouser, Vivian Kuperberg, Evan Solomonides:
Packings of Equal Disks in a Square Torus. Discret. Comput. Geom. 58(3): 614-642 (2017) - Francisco Criado, Francisco Santos:
The Maximum Diameter of Pure Simplicial Complexes and Pseudo-manifolds. Discret. Comput. Geom. 58(3): 643-649 (2017) - Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. Discret. Comput. Geom. 58(1): 1-29 (2017) - Maria Dostert, Cristóbal Guzmán, Fernando Mário de Oliveira Filho, Frank Vallentin:
New Upper Bounds for the Density of Translative Packings of Three-Dimensional Convex Bodies with Tetrahedral Symmetry. Discret. Comput. Geom. 58(2): 449-481 (2017) - Bruno Federici, Agelos Georgakopoulos:
Hyperbolicity vs. Amenability for Planar Graphs. Discret. Comput. Geom. 58(1): 67-79 (2017) - Sándor P. Fekete, Anna Lubiw:
Guest Editors' Foreword. Discret. Comput. Geom. 58(4): 755-756 (2017) - Natalia García-Colín, Miguel Raggi, Edgardo Roldán-Pensado:
A Note on the Tolerant Tverberg Theorem. Discret. Comput. Geom. 58(3): 746-754 (2017) - Luis A. Goddyn, Yian Xu:
On the Bounds of Conway's Thrackles. Discret. Comput. Geom. 58(2): 410-416 (2017) - Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. Discret. Comput. Geom. 58(2): 265-292 (2017) - Pierre-Antoine Guihéneuf, Émilien Joly:
A Minkowski Theorem for Quasicrystals. Discret. Comput. Geom. 58(3): 596-613 (2017) - Larry Guth, Joshua Zahl:
Curves in R4 and Two-Rich Points. Discret. Comput. Geom. 58(1): 232-253 (2017) - Boulos El Hilany:
Characterization of Circuits Supporting Polynomial Systems with the Maximal Number of Positive Solutions. Discret. Comput. Geom. 58(2): 355-370 (2017) - Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58(3): 686-704 (2017) - Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. Discret. Comput. Geom. 58(4): 921-945 (2017)
skipping 14 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-25 00:35 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