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 39 matches
- 2004
- Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang:
Computing the Writhing Number of a Polygonal Knot. Discret. Comput. Geom. 32(1): 37-53 (2004) - Boris Aronov, Micha Sharir:
Cell Complexities in Hyperplane Arrangements. Discret. Comput. Geom. 32(1): 107-115 (2004) - József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy:
Long Monotone Paths in Line Arrangements. Discret. Comput. Geom. 32(2): 167-176 (2004) - Margaret M. Bayer, Carl W. Lee, Bernd Sturmfels:
Guest Editors' Preface. Discret. Comput. Geom. 32(4): 435-436 (2004) - Matthias Beck:
The Partial-Fractions Method for Counting Solutions to Integral Linear Systems. Discret. Comput. Geom. 32(4): 437-446 (2004) - Mark de Berg:
Guest Editor's Foreword. Discret. Comput. Geom. 32(2): 165-166 (2004) - Ulrich Betke:
Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem. Discret. Comput. Geom. 32(3): 317-338 (2004) - Károly Bezdek, Robert Connelly:
The Kneser-Poulsen Conjecture for Spherical Polytopes. Discret. Comput. Geom. 32(1): 101-106 (2004) - Grigoriy Blekherman:
Convexity Properties of the Cone of Nonnegative Polynomials. Discret. Comput. Geom. 32(3): 345-371 (2004) - René Brandenberg, Abhi Dattasharma, Peter Gritzmann, David G. Larman:
Isoradial Bodies. Discret. Comput. Geom. 32(4): 447-457 (2004) - Robert L. Bryant, Herbert Edelsbrunner, Patrice Koehl, Michael Levitt:
The Area Derivative of a Space-Filling Diagram. Discret. Comput. Geom. 32(3): 293-308 (2004) - Timothy M. Chan:
Euclidean Bounded-Degree Spanning Tree Ratios. Discret. Comput. Geom. 32(2): 177-194 (2004) - Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum:
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. Discret. Comput. Geom. 32(3): 401-415 (2004) - Kree Cole-McLaughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, Valerio Pascucci:
Loops in Reeb Graphs of 2-Manifolds. Discret. Comput. Geom. 32(2): 231-244 (2004) - Artur Czumaj, Hairong Zhao:
Fault-Tolerant Geometric Spanners. Discret. Comput. Geom. 32(2): 207-230 (2004) - Mike Develin:
A Complexity Bound on Faces of the Hull Complex. Discret. Comput. Geom. 32(4): 471-479 (2004) - Mohab Safey El Din, Éric Schost:
Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. Discret. Comput. Geom. 32(3): 417-430 (2004) - Randall Dougherty, Vance Faber, Michael Murphy:
Unflippable Tetrahedral Complexes. Discret. Comput. Geom. 32(3): 309-315 (2004) - Richard Ehrenborg, Stephanie van Willigenburg:
Enumerative Properties of Ferrers Graphs. Discret. Comput. Geom. 32(4): 481-492 (2004) - Joachim Giesen, Uli Wagner:
Shape Dimension and Intrinsic Metric from Samples of Manifolds. Discret. Comput. Geom. 32(2): 245-267 (2004) - Sariel Har-Peled, Kasturi R. Varadarajan:
High-Dimensional Shape Fitting in Linear Time. Discret. Comput. Geom. 32(2): 269-288 (2004) - Gábor Hetyei:
Tchebyshev Posets. Discret. Comput. Geom. 32(4): 493-520 (2004) - Joseph A. Johnson, George D. Poole, John E. Wetzel:
A Small Cover for Convex Unit Arcs. Discret. Comput. Geom. 32(1): 141-147 (2004) - Dmitry N. Kozlov:
Directed Trees in a String, Real Polynomials with Triple Roots, and Chain Mails. Discret. Comput. Geom. 32(3): 373-382 (2004) - Jean B. Lasserre:
The Integer Hull of a Convex Rational Polytope. Discret. Comput. Geom. 32(1): 129-139 (2004) - Jesús A. De Loera, Tyrrell B. McAllister:
Vertices of Gelfand-Tsetlin Polytopes. Discret. Comput. Geom. 32(4): 459-470 (2004) - Jirí Matousek, Uli Wagner:
New Constructions of Weak epsilon-Nets. Discret. Comput. Geom. 32(2): 195-206 (2004) - Peter McMullen:
Regular Polytopes of Full Rank. Discret. Comput. Geom. 32(1): 1-35 (2004) - Peter McMullen:
Mixed Fibre Polytopes. Discret. Comput. Geom. 32(4): 521-532 (2004) - Yana Mohanty:
Construction of a 3/4-Ideal Hyperbolic Tetrahedron out of Ideal Tetrahedra. Discret. Comput. Geom. 32(1): 117-128 (2004)
skipping 9 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-12-23 15:01 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