On the Combinatorial Classification of Nondegenerate Configurations in the Plane. - Jacob E. Goodman; Richard Pollack (J. Comb. Theory A, 1980)

Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. - Jacob E. Goodman; Richard Pollack (J. Comb. Theory A, 1980)

Three Points Do Not Determine a (Pseudo-) Plane. - Jacob E. Goodman; Richard Pollack (J. Comb. Theory A, 1981)

Helly-Type Theorems for Pseudoline Arrangements in P2. - Jacob E. Goodman; Richard Pollack (J. Comb. Theory A, 1982)

Multidimensional Sorting. - Jacob E. Goodman; Richard Pollack (SIAM J. Comput., 1983)

On the Number of k-Subsets of a Set of n Points in the Plane. - Jacob E. Goodman; Richard Pollack (J. Comb. Theory A, 1984)

Semispaces of Configurations, Cell Complexes of Arrangements. - Jacob E. Goodman; Richard Pollack (J. Comb. Theory A, 1984)

Modeling planar configurations. - Jacob E. Goodman; Richard Pollack (SCG, 1985)

Increasing the Minimum Distance of a Set of Points. - Richard Pollack (J. Comb. Theory A, 1985)

Geometric Applications of Davenport-Schinzel Sequences - Micha Sharir; Richard Cole 001; Klara Kedem; Daniel Leven; Richard Pollack; Shmuel Sifrony (FOCS, 1986)

Upper Bounds for Configurations and Polytopes in Rd. - Jacob E. Goodman; Richard Pollack (Discret. Comput. Geom., 1986)

Preface. - Jacob E. Goodman; Richard Pollack (Discret. Math., 1986)

On Arrangements of Jordan Arcs with Three Intersections per Pair. - Herbert Edelsbrunner; Leonidas J. Guibas; John Hershberger 001; János Pach; Richard Pollack; Raimund Seidel; Micha Sharir; Jack Snoeyink (SCG, 1988)

Small Sets Supporting Fáry Embeddings of Planar Graphs - Hubert de Fraysseix; János Pach; Richard Pollack (STOC, 1988)

Computing the Link Center of a Simple Polygon. - William J. Lenhart; Richard Pollack; Jörg-Rüdiger Sack; Raimund Seidel; Micha Sharir; Subhash Suri; Godfried T. Toussaint; Sue Whitesides; Chee-Keng Yap (Discret. Comput. Geom., 1988)

Separating Two Simple Polygons by a Sequence of Translations. - Ricky Pollack; Micha Sharir; Shmuel Sifrony (Discret. Comput. Geom., 1988)

Coordinate Representation of Order Types Requires Exponential Storage - Jacob E. Goodman; Richard Pollack; Bernd Sturmfels (STOC, 1989)

On Arrangement of Jordan Arcs with Three Intersection per Pair. - Herbert Edelsbrunner; Leonidas J. Guibas; John Hershberger 001; János Pach; Richard Pollack; Raimund Seidel; Micha Sharir; Jack Snoeyink (Discret. Comput. Geom., 1989)

Computing the Geodesic Center of a Simple Polygon. - Richard Pollack; Micha Sharir; Günter Rote (Discret. Comput. Geom., 1989)

Radius, diameter, and minimum degree. - Paul Erdös; János Pach; Richard Pollack; Zsolt Tuza (J. Comb. Theory B, 1989)

The Combinatorial Complexity of Hyperplane Transversals. - Sylvain E. Cappell; Jacob E. Goodman; János Pach; Richard Pollack; Micha Sharir; Rephael Wenger (SCG, 1990)

Do Projections Go to Infinity? - Imre Bárány; Jacob E. Goodman; Richard Pollack (Applied Geometry And Discrete Mathematics, 1990)

Weaving Patterns of Lines and Segments in Space. - János Pach; Richard Pollack; Emo Welzl (SIGAL International Symposium on Algorithms, 1990)

How to draw a planar graph on a grid. - Hubert de Fraysseix; János Pach; Richard Pollack (Comb., 1990)

Necessary and sufficient conditions for hyperplane transversals. - Richard Pollack; Rephael Wenger (Comb., 1990)

Counting and Cutting Cycles of Lines and Rods in Space. - Bernard Chazelle; Herbert Edelsbrunner; Leonidas J. Guibas; Richard Pollack; Raimund Seidel; Micha Sharir; Jack Snoeyink (Comput. Geom., 1991)

The complexity of point configurations. - Jacob E. Goodman; Richard Pollack (Discret. Appl. Math., 1991)

There is a Universal Topological Plane. - Jacob E. Goodman; Richard Pollack; Rephael Wenger; Tudor Zamfirescu (SCG, 1992)

Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. - Herbert Edelsbrunner; Leonidas J. Guibas; János Pach; Richard Pollack; Raimund Seidel; Micha Sharir (Theor. Comput. Sci., 1992)

Weaving Patterns of Lines and Line Segments in Space. - János Pach; Richard Pollack; Emo Welzl (Algorithmica, 1993)

Bounding the Number of Geometric Permutations Induced by k-Transversals. - Jacob E. Goodman; Richard Pollack; Rephael Wenger (SCG, 1994)

Every Arrangement Extends to a Spread. - Jacob E. Goodman; Richard Pollack; Rephael Wenger; Tudor Zamfirescu (Comb., 1994)

On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. - Jacob E. Goodman; Richard Pollack; Rephael Wenger (Discret. Comput. Geom., 1995)

Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). - Saugata Basu; Richard Pollack; Marie-Françoise Roy (STOC, 1996)

On the Combinatorial and Algebraic Complexity of Quantifier Elimination. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (J. ACM, 1996)

Bounding the Number of Geometric Permutations Induced byk-Transversals. - Jacob E. Goodman; Richard Pollack; Rephael Wenger (J. Comb. Theory A, 1996)

Quasi-Planar Graphs Have a Linear Number of Edges. - Pankaj K. Agarwal; Boris Aronov; János Pach; Richard Pollack; Micha Sharir (Comb., 1997)

On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (J. Complex., 1997)

Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (ISSAC, 1998)

On the Helly Number for Hyperplane Transversals to Unit Balls. - Boris Aronov; Jacob E. Goodman; Richard Pollack; Rephael Wenger (Discret. Comput. Geom., 2000)

Guest Editors' Foreword. - Pankaj K. Agarwal; Dan Halperin; Richard Pollack (Discret. Comput. Geom., 2001)

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. - Boris Aronov; Jacob E. Goodman; Richard Pollack; Rephael Wenger (Discret. Comput. Geom., 2001)

A Helly-type theorem for higher-dimensional transversals. - Boris Aronov; Jacob E. Goodman; Richard Pollack (Comput. Geom., 2002)

On the Realizable Weaving Patterns of Polynomial Curves in R3. - Saugata Basu; Raghavan Dhandapani; Richard Pollack (GD, 2004)

Computing the first Betti number and the connected components of semi-algebraic sets. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (STOC, 2005)

Computing the euler-poincaré characteristics of sign conditions. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (Comput. Complex., 2005)

Editorial Note. - Jacob E. Goodman; Richard Pollack (Discret. Comput. Geom., 2005)

Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets - Saugata Basu; Richard Pollack; Marie-Françoise Roy (CoRR, 2006)

An asymptotically tight bound on the number of connected components of realizable sign conditions - Saugata Basu; Richard Pollack; Marie-Françoise Roy (CoRR, 2006)

Convexity in Topological Affine Planes. - Raghavan Dhandapani; Jacob E. Goodman; Andreas F. Holmsen; Richard Pollack; Shakhar Smorodinsky (Discret. Comput. Geom., 2007)

The combinatorial encoding of disjoint convex sets in the plane. - Jacob E. Goodman; Richard Pollack (Comb., 2008)

Foreword. - Jacob E. Goodman; János Pach; Richard Pollack (Discret. Comput. Geom., 2008)

Allowable double-permutation sequences and double pseudoline arrangements. - Ricky Pollack (Electron. Notes Discret. Math., 2008)

Computing the First Betti Number of a Semi-Algebraic Set. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (Found. Comput. Math., 2008)

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. - Saugata Basu; Richard Pollack; Marie-Françoise Roy (Comb., 2009)

Valedictory Editorial. - Jacob E. Goodman; Ricky Pollack (Discret. Comput. Geom., 2010)