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 60 matches
- 2020
- Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64(3): 575-607 (2020) - Karim A. Adiprasito, Bruno Benedetti:
Barycentric Subdivisions of Convex Complexes are Collapsible. Discret. Comput. Geom. 64(3): 608-626 (2020) - Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai:
Theorems of Carathéodory, Helly, and Tverberg Without Dimension. Discret. Comput. Geom. 64(2): 233-258 (2020) - Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. 64(3): 627-653 (2020) - Igor Balla, Shoham Letzter, Benny Sudakov:
Orthonormal Representations of H-Free Graphs. Discret. Comput. Geom. 64(3): 654-670 (2020) - Gill Barequet, Yusu Wang:
Guest Editors' Foreword. Discret. Comput. Geom. 64(4): 1123-1124 (2020) - Nicholas Barvinok, Mohammad Ghomi:
Pseudo-Edge Unfoldings of Convex Polyhedra. Discret. Comput. Geom. 64(3): 671-689 (2020) - Leah Wrenn Berman, Philip DeOrsey, Jill R. Faudree, Tomaz Pisanski, Arjana Zitnik:
Chiral Astral Realizations of Cyclic 3-Configurations. Discret. Comput. Geom. 64(2): 542-565 (2020) - Pavle V. M. Blagojevic, Günter M. Ziegler:
Plus Minus Analogues for Affine Tverberg Type Results. Discret. Comput. Geom. 64(2): 535-541 (2020) - Károly J. Böröczky, Máté Matolcsi, Imre Z. Ruzsa, Francisco Santos, Oriol Serra:
Triangulations and a Discrete Brunn-Minkowski Inequality in the Plane. Discret. Comput. Geom. 64(2): 396-426 (2020) - Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. Discret. Comput. Geom. 64(4): 1167-1191 (2020) - Timothy M. Chan:
Dynamic Geometric Data Structures via Shallow Cuttings. Discret. Comput. Geom. 64(4): 1235-1252 (2020) - Fan Chung, Ron Graham:
Efficient Packings of Unit Squares in a Large Square. Discret. Comput. Geom. 64(3): 690-699 (2020) - Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. Discret. Comput. Geom. 64(3): 700-733 (2020) - Katie Clinch, Anthony Nixon, Bernd Schulze, Walter Whiteley:
Pairing Symmetries for Euclidean and Spherical Frameworks. Discret. Comput. Geom. 64(2): 483-518 (2020) - Robert Connelly, Steven J. Gortler, Evan Solomonides, Maria Yampolskaya:
The Isostatic Conjecture. Discret. Comput. Geom. 64(3): 734-758 (2020) - Olivier Devillers, Sylvain Lazard, William J. Lenhart:
Rounding Meshes in 3D. Discret. Comput. Geom. 64(1): 37-62 (2020) - Herbert Edelsbrunner, Katharina Ölsböck:
Tri-partitions and Bases of an Ordered Complex. Discret. Comput. Geom. 64(3): 759-775 (2020) - David Eppstein:
Treetopes and Their Graphs. Discret. Comput. Geom. 64(2): 259-289 (2020) - David Eppstein:
Counting Polygon Triangulations is Hard. Discret. Comput. Geom. 64(4): 1210-1234 (2020) - Jeff Erickson, Yipu Wang:
Topologically Trivial Closed Walks in Directed Surface Graphs. Discret. Comput. Geom. 64(4): 1253-1294 (2020) - Geoffrey Exoo, Dan Ismailescu:
The Chromatic Number of the Plane is At Least 5: A New Proof. Discret. Comput. Geom. 64(1): 216-226 (2020) - Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - David V. Feldman, Eric L. Grinberg:
Admissible Complexes for the Projective X-ray Transform over a Finite Field. Discret. Comput. Geom. 64(1): 28-36 (2020) - Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: On Circularizability. Discret. Comput. Geom. 64(3): 776-813 (2020) - Maria Elisa Fernandes, Dimitri Leemans, Asia Ivic Weiss:
An Exploration of Locally Spherical Regular Hypertopes. Discret. Comput. Geom. 64(2): 519-534 (2020) - Augustin Fruchard, Tudor Zamfirescu:
Cages of Small Length Holding Convex Bodies. Discret. Comput. Geom. 64(3): 814-837 (2020) - Zoltán Füredi, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Ordered and Convex Geometric Trees with Linear Extremal Function. Discret. Comput. Geom. 64(2): 324-338 (2020) - Jacob E. Goodman:
In The Beginning... Discret. Comput. Geom. 64(3): 568-570 (2020) - Peter Gritzmann, Barbara Langfeld:
On Polyatomic Tomography over Abelian Groups: Some Remarks on Consistency, Tree Packings and Complexity. Discret. Comput. Geom. 64(2): 290-303 (2020)
skipping 30 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 2025-01-10 19:08 CET 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