default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dcg/dcg6.bht:"
download as .bib file
@article{DBLP:journals/dcg/AdamsS91,
author = {Colin Adams and
William Sherman},
title = {Minimum Ideal Triangulations of Hyperbolic 3-Manifolds},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {135--153},
year = {1991},
url = {https://doi.org/10.1007/BF02574680},
doi = {10.1007/BF02574680},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AdamsS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AffentrangerW91,
author = {Fernando Affentranger and
John A. Wieacker},
title = {On the Convex Hull of Uniform Randowm Points in a Simple d-polytope},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {291--305},
year = {1991},
url = {https://doi.org/10.1007/BF02574691},
doi = {10.1007/BF02574691},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AffentrangerW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AgarwalES91,
author = {Pankaj K. Agarwal and
Herbert Edelsbrunner and
Otfried Schwarzkopf},
title = {Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {407--422},
year = {1991},
url = {https://doi.org/10.1007/BF02574698},
doi = {10.1007/BF02574698},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AgarwalES91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AronovCE91,
author = {Boris Aronov and
Bernard Chazelle and
Herbert Edelsbrunner and
Leonidas J. Guibas and
Micha Sharir and
Rephael Wenger},
title = {Points and Triangles in the Plane and Halving Planes in Space},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {435--442},
year = {1991},
url = {https://doi.org/10.1007/BF02574700},
doi = {10.1007/BF02574700},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/AronovCE91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BayerK91,
author = {Margaret M. Bayer and
Andrew Klapper},
title = {A New Index for Polytopes},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {33--47},
year = {1991},
url = {https://doi.org/10.1007/BF02574672},
doi = {10.1007/BF02574672},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BayerK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BeauquierN91,
author = {Dani{\`{e}}le Beauquier and
Maurice Nivat},
title = {On Translating One Polyomino to Tile the Plane},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {575--592},
year = {1991},
url = {https://doi.org/10.1007/BF02574705},
doi = {10.1007/BF02574705},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BeauquierN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BenedettiLR91,
author = {Riccardo Benedetti and
Fran{\c{c}}ois Loeser and
Jean{-}Jacques Risler},
title = {Bounding the Number of Connected Components of a Real Algebraic Set},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {191--209},
year = {1991},
url = {https://doi.org/10.1007/BF02574685},
doi = {10.1007/BF02574685},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BenedettiLR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BezdekKM91,
author = {Andr{\'{a}}s Bezdek and
Wlodzimierz Kuperberg and
E. Makai},
title = {Maximum Density Space Packing with Parallel Strings of Spheres},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {277--283},
year = {1991},
url = {https://doi.org/10.1007/BF02574689},
doi = {10.1007/BF02574689},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BezdekKM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Bienstock91,
author = {Daniel Bienstock},
title = {Some Provably Hard Crossing Number Problems},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {443--459},
year = {1991},
url = {https://doi.org/10.1007/BF02574701},
doi = {10.1007/BF02574701},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Bienstock91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BilleraR91,
author = {Louis J. Billera and
Lauren L. Rose},
title = {A Dimension Series for Multivariate Splines},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {107--128},
year = {1991},
url = {https://doi.org/10.1007/BF02574678},
doi = {10.1007/BF02574678},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/BilleraR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Booth91,
author = {R. S. Booth},
title = {Analytic Formulas for Full Steiner Trees},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {69--82},
year = {1991},
url = {https://doi.org/10.1007/BF02574675},
doi = {10.1007/BF02574675},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Booth91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/CannyRR91,
author = {John F. Canny and
Ashutosh Rege and
John H. Reif},
title = {An Exact Algorithm for Kinodynamic Planning in the Plane},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {461--484},
year = {1991},
url = {https://doi.org/10.1007/BF02574702},
doi = {10.1007/BF02574702},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/CannyRR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Chazelle91,
author = {Bernard Chazelle},
title = {Triangulating a Simple Polygon in Linear Time},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {485--524},
year = {1991},
url = {https://doi.org/10.1007/BF02574703},
doi = {10.1007/BF02574703},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Chazelle91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ChinN91,
author = {Wei{-}pang Chin and
Simeon C. Ntafos},
title = {Shortest Watchman Routes in Simple Polygons},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {9--31},
year = {1991},
url = {https://doi.org/10.1007/BF02574671},
doi = {10.1007/BF02574671},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ChinN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Dwyer91,
author = {Rex A. Dwyer},
title = {Higher-Dimensional Voronoi Diagrams in Linear Expected Time},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {343--367},
year = {1991},
url = {https://doi.org/10.1007/BF02574694},
doi = {10.1007/BF02574694},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Dwyer91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Furedi91,
author = {Zolt{\'{a}}n F{\"{u}}redi},
title = {The Densest Packing of Equal Circles into a Parallel Strip},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {95--106},
year = {1991},
url = {https://doi.org/10.1007/BF02574677},
doi = {10.1007/BF02574677},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Furedi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Haiman91,
author = {Mark D. Haiman},
title = {A Simple and Relatively Efficient Triangulation of the n-Cube},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {287--289},
year = {1991},
url = {https://doi.org/10.1007/BF02574690},
doi = {10.1007/BF02574690},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Haiman91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Houle91,
author = {Michael E. Houle},
title = {Theorems on the Existence of Separating Surfaces},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {49--56},
year = {1991},
url = {https://doi.org/10.1007/BF02574673},
doi = {10.1007/BF02574673},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Houle91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KoppermanMW91,
author = {Ralph Kopperman and
Paul R. Meyer and
Richard G. Wilson},
title = {A Jordan Surface Theorem for Three-Dimensional Digital Spaces},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {155--161},
year = {1991},
url = {https://doi.org/10.1007/BF02574681},
doi = {10.1007/BF02574681},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KoppermanMW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/LassakZ91,
author = {Marek Lassak and
Jixian Zhang},
title = {An On-line Potato-Sack Theorem},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {1--7},
year = {1991},
url = {https://doi.org/10.1007/BF02574670},
doi = {10.1007/BF02574670},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/LassakZ91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Maehara91,
author = {Hiroshi Maehara},
title = {Dispersed Points and Geometric Embedding of Complete Bipartite Graphs},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {57--67},
year = {1991},
url = {https://doi.org/10.1007/BF02574674},
doi = {10.1007/BF02574674},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Maehara91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Maehara91a,
author = {Hiroshi Maehara},
title = {On Graver's Conjecture Concerning the Rigidity Problem of Graphs},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {339--342},
year = {1991},
url = {https://doi.org/10.1007/BF02574693},
doi = {10.1007/BF02574693},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Maehara91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Martini91,
author = {Horst Martini},
title = {Convex Polytopes Whose Projection Bodies and Difference Set Are Polars},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {83--91},
year = {1991},
url = {https://doi.org/10.1007/BF02574676},
doi = {10.1007/BF02574676},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Martini91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Matousek91,
author = {Jir{\'{\i}} Matousek},
title = {Lower Bounds on the Length of Monotone Paths in Arrangement},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {129--134},
year = {1991},
url = {https://doi.org/10.1007/BF02574679},
doi = {10.1007/BF02574679},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Matousek91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Matousek91a,
author = {Jir{\'{\i}} Matousek},
title = {Cutting Hyperplane Arrangements},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {385--406},
year = {1991},
url = {https://doi.org/10.1007/BF02574697},
doi = {10.1007/BF02574697},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Matousek91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/MehlhornMO91,
author = {Kurt Mehlhorn and
Stefan Meiser and
Colm {\'{O}}'D{\'{u}}nlaing},
title = {On the Construction of Abstract Voronoi Diagrams},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {211--224},
year = {1991},
url = {https://doi.org/10.1007/BF02574686},
doi = {10.1007/BF02574686},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/MehlhornMO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Mulmuley91,
author = {Ketan Mulmuley},
title = {On Levels in Arrangement and Voronoi Diagrams},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {307--338},
year = {1991},
url = {https://doi.org/10.1007/BF02574692},
doi = {10.1007/BF02574692},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Mulmuley91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/NackmanS91,
author = {Lee R. Nackman and
Vijay Srinivasan},
title = {Bisectors of Linearly Separable Sets},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {263--275},
year = {1991},
url = {https://doi.org/10.1007/BF02574688},
doi = {10.1007/BF02574688},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/NackmanS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Schmitt91,
author = {Peter Schmitt},
title = {Disks with Special Properties of Densest Packings},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {181--190},
year = {1991},
url = {https://doi.org/10.1007/BF02574684},
doi = {10.1007/BF02574684},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Schmitt91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Schrijver91,
author = {Alexander Schrijver},
title = {Disjoint Homotopic Paths and Trees in a Planar Graph},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {527--574},
year = {1991},
url = {https://doi.org/10.1007/BF02574704},
doi = {10.1007/BF02574704},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Schrijver91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Seidel91,
author = {Raimund Seidel},
title = {Small-Dimensional Linear Programming and Convex Hulls Made Easy},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {423--434},
year = {1991},
url = {https://doi.org/10.1007/BF02574699},
doi = {10.1007/BF02574699},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/Seidel91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Sharir91,
author = {Micha Sharir},
title = {On k-Sets in Arrangement of Curves and Surfaces},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {593--613},
year = {1991},
url = {https://doi.org/10.1007/BF02574706},
doi = {10.1007/BF02574706},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Sharir91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Stengel91,
author = {Gilbert Stengel},
title = {Constraints on the Angular Distribution of the Zeros of a Polynomial
of Low Complexity},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {163--169},
year = {1991},
url = {https://doi.org/10.1007/BF02574682},
doi = {10.1007/BF02574682},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Stengel91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Taylor91,
author = {Jean E. Taylor},
title = {On the Global Structure of Crystalline Surfaces},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {225--262},
year = {1991},
url = {https://doi.org/10.1007/BF02574687},
doi = {10.1007/BF02574687},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Taylor91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Vaidya91,
author = {Pravin M. Vaidya},
title = {A sparse Graph Almost as Good as the Complete Graph on Points in {K}
Dimensions},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {369--381},
year = {1991},
url = {https://doi.org/10.1007/BF02574695},
doi = {10.1007/BF02574695},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Vaidya91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Zamfirescu91,
author = {Tudor Zamfirescu},
title = {On Two Conjectures of Franz Hering about Convex Surfaces},
journal = {Discret. Comput. Geom.},
volume = {6},
pages = {171--180},
year = {1991},
url = {https://doi.org/10.1007/BF02574683},
doi = {10.1007/BF02574683},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Zamfirescu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-10-08 06:37 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
