Volume 12,
1994
- János Pach, Jenö Töröcsik:
Some Geometric Applications of Dilworth's Theorem.
1-7 BibTeX
- A. Cavicchioli, B. Ruini:
Special Representations for n-Bridge Links.
9-27 BibTeX
- Boris Aronov, Marshall W. Bern, David Eppstein:
On the Number of Minimal 1-Steiner Trees.
29-34 BibTeX
- Alexander I. Barvinok:
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
35-48 BibTeX
- Keith A. Brandt, Hiroaki Terao:
Free Arrangements and Relation Spaces.
49-63 BibTeX
- G. Srinivasaraghavan, Asish Mukhopadhyay:
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.
65-82 BibTeX
- Wlodzimierz Kuperberg:
On-Line Covering a Cube by a Sequence of Cubes.
83-90 BibTeX
- Evangelos Kranakis, Michel Pocchiola:
Camera Placement in Integer Lattices.
91-104 BibTeX
- Peter Doyle, Zheng-Xu He, Burt Rodin:
The Asymptotic Value of the Circle-Packing Rigidity Constants Sn.
105-116 BibTeX
- Boris Aronov, Micha Sharir:
Castles in the Air Revisited.
119-150 BibTeX
- Philippe Flajolet, T. Lafforgue:
Search Costs in Quadtrees and Singularity Perturbation Asymptotics.
151-175 BibTeX
- Pankaj K. Agarwal, Micha Sharir:
On the Number of Views of Polyhedral Terrains.
177-182 BibTeX
- Chuanming Zong:
An Example Concerning the Translative Kissing Number of Convex Body.
183-188 BibTeX
- V. T. Rajan:
Optimality of the Delaunay Triangulation in Rd.
189-202 BibTeX
- Marco Pellegrini:
On Lines Missing Polyhedral Sets in 3-Space.
203-221 BibTeX
- D. P. Robbins:
Areas of Polygons Inscribed in a Circle.
223-236 BibTeX
- Nina Amenta:
Helly-Type Theorems and Generalized Linear Programming.
241-261 BibTeX
- Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.
263-280 BibTeX
- Tamal K. Dey, Herbert Edelsbrunner:
Counting Triangle Crossing and Halving Planes.
231-289 BibTeX
- Shreesh Jadhav, Asish Mukhopadhyay:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
291-312 BibTeX
- Dan Halperin, Micha Sharir:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains.
313-326 BibTeX
- Micha Sharir:
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
327-345 BibTeX
- Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri:
Can Visibility Graphs Be Represented Compactly?.
347-365 BibTeX
- Jack Snoeyink, Jorge Stolfi:
Objects that Cannot Be Taken Apart with Two Hands.
367-384 BibTeX
- Imre Bárány, Aladár Heppes:
On the Exact Constant i the Quantitative Steinitz Theorem in the Plane.
387-398 BibTeX
- Bernd Gärtner, Emo Welzl:
Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements.
399-432 BibTeX
- J. Januszewski, Marek Lassak:
On-line Covering the Unit Cube by Cubes.
433-438 BibTeX
- György Elekes:
Generalized Breadths, Circular Cantor Sets, and the Least Area UCC.
439-449 BibTeX
- E. Bujalance, A. F. Costa, J. M. Gamboa, J. Lafuente:
An Algorithm to Compute Odd Orders and Ramification Indices of Cyclic Actions on Compact Surfaces.
451-464 BibTeX
- E. Steigrímsson:
A Decomposition of 2-Weak Vertex-packing Polytopes.
465-479 BibTeX
Copyright © Wed Jun 4 19:07:52 2008
by Michael Ley (ley@uni-trier.de)
