The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jacob E. Goodman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    A Helly-type theorem for hyperplane transversals to well-separated convex sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:57-63 [Conf]
  2. Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
    The Combinatorial Complexity of Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:83-91 [Conf]
  3. Jacob E. Goodman
    Double-permutation sequences and pseudoline transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:159- [Conf]
  4. Jacob E. Goodman, Richard Pollack, Rephael Wenger
    Bounding the Number of Geometric Permutations Induced by k-Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:192-197 [Conf]
  5. Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
    There is a Universal Topological Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:171-176 [Conf]
  6. Jacob E. Goodman, Richard Pollack, Bernd Sturmfels
    Coordinate Representation of Order Types Requires Exponential Storage [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:405-410 [Conf]
  7. Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
    Every Arrangement Extends to a Spread. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:3, pp:301-306 [Journal]
  8. Boris Aronov, Jacob E. Goodman, Richard Pollack
    A Helly-type theorem for higher-dimensional transversals. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:177-183 [Journal]
  9. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    On the Helly Number for Hyperplane Transversals to Unit Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:171-176 [Journal]
  10. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:507-517 [Journal]
  11. Jacob E. Goodman, Richard Pollack
    Editorial Note. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:1- [Journal]
  12. Jacob E. Goodman, Richard Pollack
    Upper Bounds for Configurations and Polytopes in Rd. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:219-227 [Journal]
  13. Jacob E. Goodman, Richard Pollack, Rephael Wenger
    On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:469-476 [Journal]
  14. Jacob E. Goodman
    Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:3, pp:385-390 [Journal]
  15. Jacob E. Goodman
    On the Combinatorial Classification of Nondegenerate Configurations in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:2, pp:220-235 [Journal]
  16. Jacob E. Goodman, Richard Pollack
    Three Points Do Not Determine a (Pseudo-) Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:31, n:2, pp:215-218 [Journal]
  17. Jacob E. Goodman, Richard Pollack
    Helly-Type Theorems for Pseudoline Arrangements in P2. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:1, pp:1-19 [Journal]
  18. Jacob E. Goodman, Richard Pollack
    On the Number of k-Subsets of a Set of n Points in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:36, n:1, pp:101-104 [Journal]
  19. Jacob E. Goodman, Richard Pollack
    Semispaces of Configurations, Cell Complexes of Arrangements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:257-293 [Journal]
  20. Jacob E. Goodman, Richard Pollack, Rephael Wenger
    Bounding the Number of Geometric Permutations Induced byk-Transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:2, pp:187-197 [Journal]
  21. Jacob E. Goodman, Richard Pollack
    Multidimensional Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:484-507 [Journal]
  22. Jacob E. Goodman
    Proof of a conjecture of Burr, Grünbaum, and Sloane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:1, pp:27-35 [Journal]
  23. Jacob E. Goodman, Richard Pollack
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:1- [Journal]

  24. Modeling planar configurations. [Citation Graph (, )][DBLP]


  25. The combinatorial encoding of disjoint convex sets in the plane. [Citation Graph (, )][DBLP]


  26. The complexity of point configurations. [Citation Graph (, )][DBLP]


  27. Convexity in Topological Affine Planes. [Citation Graph (, )][DBLP]


  28. Foreword. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002