default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob E. Goodman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j23]Jacob E. Goodman:
In The Beginning... Discret. Comput. Geom. 64(3): 568-570 (2020)
2010 – 2019
- 2010
- [j22]Jacob E. Goodman, Ricky Pollack:
Valedictory Editorial. Discret. Comput. Geom. 44(4): 725-726 (2010)
2000 – 2009
- 2008
- [j21]Jacob E. Goodman, Richard Pollack:
The combinatorial encoding of disjoint convex sets in the plane. Comb. 28(1): 69-81 (2008) - [j20]Jacob E. Goodman, János Pach, Richard Pollack:
Foreword. Discret. Comput. Geom. 39(1-3): 1-2 (2008) - 2007
- [j19]Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky
:
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38(2): 243-257 (2007) - 2005
- [j18]Jacob E. Goodman, Richard Pollack:
Editorial Note. Discret. Comput. Geom. 33(1): 1 (2005) - [c8]Jacob E. Goodman:
Double-permutation sequences and pseudoline transversals. SCG 2005: 159 - 2004
- [e2]Jacob E. Goodman, Joseph O'Rourke:
Handbook of Discrete and Computational Geometry, Second Edition. Chapman and Hall/CRC 2004, ISBN 978-1-58488-301-2 [contents] - [r1]Jacob E. Goodman:
Pseudoline Arrangements. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 97-128 - 2002
- [j17]Boris Aronov, Jacob E. Goodman, Richard Pollack:
A Helly-type theorem for higher-dimensional transversals. Comput. Geom. 21(3): 177-183 (2002) - 2001
- [j16]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discret. Comput. Geom. 25(4): 507-517 (2001) - 2000
- [j15]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
On the Helly Number for Hyperplane Transversals to Unit Balls. Discret. Comput. Geom. 24(2-3): 171-176 (2000) - [c7]Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-type theorem for hyperplane transversals to well-separated convex sets. SCG 2000: 57-63
1990 – 1999
- 1996
- [j14]Jacob E. Goodman, Richard Pollack, Rephael Wenger:
Bounding the Number of Geometric Permutations Induced byk-Transversals. J. Comb. Theory A 75(2): 187-197 (1996) - 1995
- [j13]Jacob E. Goodman, Richard Pollack, Rephael Wenger:
On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. Discret. Comput. Geom. 13: 469-476 (1995) - 1994
- [j12]Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
Every Arrangement Extends to a Spread. Comb. 14(3): 301-306 (1994) - [c6]Jacob E. Goodman, Richard Pollack, Rephael Wenger:
Bounding the Number of Geometric Permutations Induced by k-Transversals. SCG 1994: 192-197 - 1992
- [c5]Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu:
There is a Universal Topological Plane. SCG 1992: 171-176 - 1991
- [j11]Jacob E. Goodman, Richard Pollack:
The complexity of point configurations. Discret. Appl. Math. 31(2): 167-180 (1991) - [e1]Jacob E. Goodman, Richard Pollack, William Steiger:
Discrete and Computational Geometry: Papers from the DIMACS Special Year. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6, DIMACS/AMS 1991, ISBN 978-0-8218-6595-8 [contents] - 1990
- [c4]Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger:
The Combinatorial Complexity of Hyperplane Transversals. SCG 1990: 83-91 - [c3]Imre Bárány, Jacob E. Goodman, Richard Pollack:
Do Projections Go to Infinity? Applied Geometry And Discrete Mathematics 1990: 51-62
1980 – 1989
- 1989
- [c2]Jacob E. Goodman, Richard Pollack, Bernd Sturmfels:
Coordinate Representation of Order Types Requires Exponential Storage. STOC 1989: 405-410 - 1986
- [j10]Jacob E. Goodman, Richard Pollack:
Upper Bounds for Configurations and Polytopes in Rd. Discret. Comput. Geom. 1: 219-227 (1986) - [j9]Jacob E. Goodman, Richard Pollack:
Preface. Discret. Math. 60: 1 (1986) - 1985
- [c1]Jacob E. Goodman, Richard Pollack:
Modeling planar configurations. SCG 1985: 121-124 - 1984
- [j8]Jacob E. Goodman, Richard Pollack:
On the Number of k-Subsets of a Set of n Points in the Plane. J. Comb. Theory A 36(1): 101-104 (1984) - [j7]Jacob E. Goodman, Richard Pollack:
Semispaces of Configurations, Cell Complexes of Arrangements. J. Comb. Theory A 37(3): 257-293 (1984) - 1983
- [j6]Jacob E. Goodman, Richard Pollack:
Multidimensional Sorting. SIAM J. Comput. 12(3): 484-507 (1983) - 1982
- [j5]Jacob E. Goodman, Richard Pollack:
Helly-Type Theorems for Pseudoline Arrangements in P2. J. Comb. Theory A 32(1): 1-19 (1982) - 1981
- [j4]Jacob E. Goodman, Richard Pollack:
Three Points Do Not Determine a (Pseudo-) Plane. J. Comb. Theory A 31(2): 215-218 (1981) - 1980
- [j3]Jacob E. Goodman:
Proof of a conjecture of Burr, Grünbaum, and Sloane. Discret. Math. 32(1): 27-35 (1980) - [j2]Jacob E. Goodman, Richard Pollack:
On the Combinatorial Classification of Nondegenerate Configurations in the Plane. J. Comb. Theory A 29(2): 220-235 (1980) - [j1]Jacob E. Goodman, Richard Pollack:
Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. J. Comb. Theory A 29(3): 385-390 (1980)
Coauthor Index
aka: Richard Pollack
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
