Journals in DBLP
Neil L. White A Nonuniform Matroid Which violates the Isotogy Conecture. [Citation Graph (0, 0)][DBLP ] Journal ] Chandrajit L. Bajaj , Ming Li Geometric Optimization and Dp - Completeness. [Citation Graph (0, 0)][DBLP ] Journal ] Hiroshi Maehara Note on Induced Subgraphs of the Unit Distance Graph En . [Citation Graph (0, 0)][DBLP ] Journal ] Pedro Jussieu de Rezende , D. T. Lee , Ying-Fung Wu Rectilinear Shortest Paths in the presence of Rectangular Barriers. [Citation Graph (0, 0)][DBLP ] Journal ] Asia Ivic Weiss Incidence-Polytopes with Toroidal Cells. [Citation Graph (0, 0)][DBLP ] Journal ] Walter Whiteley A Matroid on Hypergraphs with Applications in Scene Analysis and Geometry. [Citation Graph (0, 0)][DBLP ] Journal ] Beat Jaggi , Peter Mani-Levitska , Bernd Sturmfels , Neil White Uniform Oriented Matroids Without the Isotopy Property. [Citation Graph (0, 0)][DBLP ] Journal ] Pravin M. Vaidya An O(n log n) Algorithm for the All-nearest.Neighbors Problem. [Citation Graph (0, 0)][DBLP ] Journal ] Mikhail Katz Diameter-Extremal Subsets of Spheres. [Citation Graph (0, 0)][DBLP ] Journal ] Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas The Complexity of Cutting Complexes. [Citation Graph (0, 0)][DBLP ] Journal ] Fan R. K. Chung Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs. [Citation Graph (0, 0)][DBLP ] Journal ] Helge Tverberg Proof of Grünbaum's Conjecture on Common Transversals for Translates. [Citation Graph (0, 0)][DBLP ] Journal ] Dietrich Kölzow , Attila Kuba , Aljosa Volcic An Algorithm for Reconstructing Convex Bodies form Their Projections. [Citation Graph (0, 0)][DBLP ] Journal ] Noga Alon , Meir Katchalski , William R. Pulleyblank Cutting Disjoint Disks by Straight Lines. [Citation Graph (0, 0)][DBLP ] Journal ] Noga Alon , Meir Katchalski , William R. Pulleyblank The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. [Citation Graph (0, 0)][DBLP ] Journal ] Imre Bárány , James H. Schmerl , Stuart J. Sidney , Jorge Urrutia A Combinatorial Result About Points and Balls in Euclidean Space. [Citation Graph (0, 0)][DBLP ] Journal ] Ryan Hayward A Note on the Circle Containment Problem. [Citation Graph (0, 0)][DBLP ] Journal ] G. Toussaint On Seperating Two Simple Polygons by a Single Translation. [Citation Graph (0, 0)][DBLP ] Journal ] Hiroshi Maehara Helly-Type Theorems for Spheres. [Citation Graph (0, 0)][DBLP ] Journal ] Noga Alon , Paul Erdös Disjoint Edges in Geometric Graphs. [Citation Graph (0, 0)][DBLP ] Journal ] János Pach , Micha Sharir The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. [Citation Graph (0, 0)][DBLP ] Journal ] Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. [Citation Graph (0, 0)][DBLP ] Journal ] Herbert Edelsbrunner The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces. [Citation Graph (0, 0)][DBLP ] Journal ] Endre Boros , Zoltán Füredi , L. M. Kelly On Representing Sylvester- Gallai Designs. [Citation Graph (0, 0)][DBLP ] Journal ] Jan Reiterman , Vojtech Rödl , Edita Sinajová Embeddings of Graphs in Euclidean Spaces. [Citation Graph (0, 0)][DBLP ] Journal ] Ethan D. Bloch Complexes Whose Boundaries Cannot Be Pused Around. [Citation Graph (0, 0)][DBLP ] Journal ] E. A. Kasimatis Dissections of Regular Polygons into Triangles of Equal Areas. [Citation Graph (0, 0)][DBLP ] Journal ] Kenneth L. Clarkson , Peter W. Shor Application of Random Sampling in Computational Geometry, II. [Citation Graph (0, 0)][DBLP ] Journal ] Kenneth L. Clarkson , Robert Endre Tarjan , Christopher J. Van Wyk A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Journal ] Herbert Edelsbrunner , Leonidas J. Guibas , John Hershberger , Raimund Seidel , Micha Sharir , Jack Snoeyink , Emo Welzl Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP ] Journal ] Bernard Chazelle , Emo Welzl Quasi-Optimal Range Searching in Space of Finite VC-Dimension. [Citation Graph (0, 0)][DBLP ] Journal ] Leonidas J. Guibas , Micha Sharir , Shmuel Sifrony On the General Motion-Planning Problem with Two Degrees of Freedom. [Citation Graph (0, 0)][DBLP ] Journal ] Herbert Edelsbrunner , Leonidas J. Guibas , John Hershberger , János Pach , Richard Pollack , Raimund Seidel , Micha Sharir , Jack Snoeyink On Arrangement of Jordan Arcs with Three Intersection per Pair. [Citation Graph (0, 0)][DBLP ] Journal ] Paul Erdös , László Lovász , Katalin Vesztergombi On the Graph of Large Distance. [Citation Graph (0, 0)][DBLP ] Journal ] Bernard Chazelle , Leonidas J. Guibas Visibility and Intersection Problems in Plane Geometry. [Citation Graph (0, 0)][DBLP ] Journal ] Jürgen Bokowski A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map. [Citation Graph (0, 0)][DBLP ] Journal ] Alok Aggarwal , Leonidas J. Guibas , James B. Saxe , Peter W. Shor A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Journal ] Nimrod Megiddo On the Ball Spanned by Balls. [Citation Graph (0, 0)][DBLP ] Journal ] Richard Pollack , Micha Sharir , Günter Rote Computing the Geodesic Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Journal ] Peter Gritzmann , Marek Lassak Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies. [Citation Graph (0, 0)][DBLP ] Journal ] 