You have Guest access.
Log In
Volume 1 / 1986 - Volume 47 / 2012
183-198
On Kalai’s Conjectures Concerning Centrally Symmetric Polytopes
Raman Sanyal, Axel Werner and Günter M. Ziegler
199-207
Linear Programming Bounds for Codes via a Covering Argument
Michael Navon and Alex Samorodnitsky
208-215
Simple Polygons of Maximum Perimeter Contained in a Unit Disk
Charles Audet, Pierre Hansen and Frédéric Messine
216-231
On Regular Vertices of the Union of Planar Convex Objects
Esther Ezra, János Pach and Micha Sharir
232-248
Generalizations of Schöbi’s Tetrahedral Dissection
N. J. A. Sloane and Vinay A. Vaishampayan
249-256
Finding a Simple Polytope from Its Graph in Polynomial Time
Eric J. Friedman
257-272
Stability Properties of Neighbourly Random Polytopes
Piotr Mankiewicz and Nicole Tomczak-Jaegermann
273-283
Lower Bounds for Local Versions of Dimension Reductions
Gideon Schechtman and Adi Shraibman
284-317
Multitriangulations as Complexes of Star Polygons
Vincent Pilaud and Francisco Santos
318-327
A Continuous d -Step Conjecture for Polytopes
Antoine Deza, Tamás Terlaky and Yuriy Zinchenko
328-347
On Minimal Triangulations of Products of Convex Polygons
Michelle Bucher-Karlsson
348-362
Coloring Geometric Range Spaces
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman and Shakhar Smorodinsky
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info