Jacob E. Goodman

According to our database1, Jacob E. Goodman authored at least 30 papers between 1980 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2010
Valedictory Editorial.
Discret. Comput. Geom., 2010

2008
Foreword.
Discret. Comput. Geom., 2008

The combinatorial encoding of disjoint convex sets in the plane.
Comb., 2008

2007
Convexity in Topological Affine Planes.
Discret. Comput. Geom., 2007

2005
Editorial Note.
Discret. Comput. Geom., 2005

Double-permutation sequences and pseudoline transversals.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Pseudoline Arrangements.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2002
A Helly-type theorem for higher-dimensional transversals.
Comput. Geom., 2002

2001
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.
Discret. Comput. Geom., 2001

2000
On the Helly Number for Hyperplane Transversals to Unit Balls.
Discret. Comput. Geom., 2000

1996
Bounding the Number of Geometric Permutations Induced byk-Transversals.
J. Comb. Theory, Ser. A, 1996

1995
On the Connected Components of the Space of Line Transersals t a Family of Convex Sets.
Discret. Comput. Geom., 1995

1994
Every Arrangement Extends to a Spread.
Comb., 1994

Bounding the Number of Geometric Permutations Induced by <i>k</i>-Transversals.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1992
There is a Universal Topological Plane.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
The complexity of point configurations.
Discret. Appl. Math., 1991

1990
Do Projections Go to Infinity?
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

The Combinatorial Complexity of Hyperplane Transversals.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Coordinate Representation of Order Types Requires Exponential Storage
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1986
Preface.
Discret. Math., 1986

Upper Bounds for Configurations and Polytopes in R<sup>d</sup>.
Discret. Comput. Geom., 1986

1985
Modeling planar configurations.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Semispaces of Configurations, Cell Complexes of Arrangements.
J. Comb. Theory, Ser. A, 1984

On the Number of k-Subsets of a Set of n Points in the Plane.
J. Comb. Theory, Ser. A, 1984

1983
Multidimensional Sorting.
SIAM J. Comput., 1983

1982
Helly-Type Theorems for Pseudoline Arrangements in P<sup>2</sup>.
J. Comb. Theory, Ser. A, 1982

1981
Three Points Do Not Determine a (Pseudo-) Plane.
J. Comb. Theory, Ser. A, 1981

1980
Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines.
J. Comb. Theory, Ser. A, 1980

On the Combinatorial Classification of Nondegenerate Configurations in the Plane.
J. Comb. Theory, Ser. A, 1980

Proof of a conjecture of Burr, Grünbaum, and Sloane.
Discret. Math., 1980


  Loading...