Остановите войну!
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 42 matches
- 2012
- Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers:
Hinged Dissections Exist. Discret. Comput. Geom. 47(1): 150-186 (2012) - Karim A. Adiprasito:
Characterization of Polytopes via Tilings with Similar Pieces. Discret. Comput. Geom. 47(2): 424-429 (2012) - Noga Alon:
A Non-linear Lower Bound for Planar Epsilon-nets. Discret. Comput. Geom. 47(2): 235-244 (2012) - Sunil Arya, David M. Mount, Jian Xia:
Tight Lower Bounds for Halfspace Range Searching. Discret. Comput. Geom. 47(4): 711-730 (2012) - Jonathan Ariel Barmak, Elias Gabriel Minian:
Strong Homotopy Types, Nerves and Collapses. Discret. Comput. Geom. 47(2): 301-328 (2012) - Sal Barone, Saugata Basu:
Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety. Discret. Comput. Geom. 47(3): 577-597 (2012) - Riddhipratim Basu, Bhaswar B. Bhattacharya, Tanmoy Talukdar:
The Projection Median of a Set of Points in ℝ d. Discret. Comput. Geom. 47(2): 329-346 (2012) - Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. 47(3): 461-491 (2012) - Ulrich Bauer, Carsten Lange, Max Wardetzky:
Optimal Topological Simplification of Discrete Functions on Surfaces. Discret. Comput. Geom. 47(2): 347-377 (2012) - Károly Bezdek:
Illuminating Spindle Convex Bodies and Minimizing the Volume of Spherical Sets of Constant Width. Discret. Comput. Geom. 47(2): 275-287 (2012) - Wouter Castryck:
Moving Out the Edges of a Lattice Polygon. Discret. Comput. Geom. 47(3): 496-518 (2012) - Timothy M. Chan:
Optimal Partition Trees. Discret. Comput. Geom. 47(4): 661-690 (2012) - Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47(1): 187-214 (2012) - Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent Digital Line Segments. Discret. Comput. Geom. 47(4): 691-710 (2012) - Daniel C. Cohen, Armindo Costa, Michael Farber, Thomas Kappeler:
Topology of Random 2-Complexes. Discret. Comput. Geom. 47(1): 117-149 (2012) - Alicia Dickenstein, Luis Felipe Tabera:
Singular Tropical Hypersurfaces. Discret. Comput. Geom. 47(2): 430-453 (2012) - Herbert Edelsbrunner, Michael Kerber:
Dual Complexes of Cubical Subdivisions of ℝ n. Discret. Comput. Geom. 47(2): 393-414 (2012) - Marc Glisse, Sylvain Lazard:
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. Discret. Comput. Geom. 47(4): 756-772 (2012) - Akihiro Higashitani:
Counterexamples of the Conjecture on Roots of Ehrhart Polynomials. Discret. Comput. Geom. 47(3): 618-623 (2012) - Peter Horák, Bader F. AlBdaiwi:
Non-periodic Tilings of ℝ n by Crosses. Discret. Comput. Geom. 47(1): 1-16 (2012) - HaiLin Jin, Qi Guo:
Asymmetry of Convex Bodies of Constant Width. Discret. Comput. Geom. 47(2): 415-423 (2012) - Ross J. Kang, Tobias Müller:
Sphere and Dot Product Representations of Graphs. Discret. Comput. Geom. 47(3): 548-568 (2012) - Roman N. Karasev:
A Simpler Proof of the Boros-Füredi-Bárány-Pach-Gromov Theorem. Discret. Comput. Geom. 47(3): 492-495 (2012) - Ken-ichi Kawarabayashi, Stephan Kreutzer, Bojan Mohar:
Linkless and Flat Embeddings in 3-Space. Discret. Comput. Geom. 47(4): 731-755 (2012) - Ruth Kellerhals:
Scissors Congruence, the Golden Ratio and Volumes in Hyperbolic 5-Space. Discret. Comput. Geom. 47(3): 629-658 (2012) - Balázs Keszegh, Dömötör Pálvölgyi:
Octants Are Cover-Decomposable. Discret. Comput. Geom. 47(3): 598-609 (2012) - David G. Kirkpatrick:
Guest Editor's Foreword. Discret. Comput. Geom. 47(4): 659-660 (2012) - Alexander Koldobsky:
A Hyperplane Inequality for Measures of Convex Bodies in ℝ n , n≤4. Discret. Comput. Geom. 47(3): 538-547 (2012) - Jiming Ma, Jean-Marc Schlenker:
Non-rigidity of Spherical Inversive Distance Circle Packings. Discret. Comput. Geom. 47(3): 610-617 (2012) - Jirí Matousek, Martin Tancer, Uli Wagner:
A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. 47(2): 245-265 (2012)
skipping 12 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-13 01:38 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