Richard Pollack

According to our database1, Richard Pollack authored at least 60 papers between 1980 and 2010.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2010
Valedictory Editorial.
Discrete & Computational Geometry, 2010

2009
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.
Combinatorica, 2009

2008
Computing the First Betti Number of a Semi-Algebraic Set.
Foundations of Computational Mathematics, 2008

Allowable double-permutation sequences and double pseudoline arrangements.
Electronic Notes in Discrete Mathematics, 2008

Foreword.
Discrete & Computational Geometry, 2008

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

2007
Convexity in Topological Affine Planes.
Discrete & Computational Geometry, 2007

2005
Editorial Note.
Discrete & Computational Geometry, 2005

Computing the euler-poincaré characteristics of sign conditions.
Computational Complexity, 2005

Computing the first Betti number and the connected components of semi-algebraic sets.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004
On the Realizable Weaving Patterns of Polynomial Curves in R3.
Proceedings of the Graph Drawing, 12th International Symposium, 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.
Discrete & Computational Geometry, 2001

Guest Editors' Foreword.
Discrete & Computational Geometry, 2001

2000
On the Helly Number for Hyperplane Transversals to Unit Balls.
Discrete & Computational Geometry, 2000

A Helly-type theorem for hyperplane transversals to well-separated convex sets.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1998
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety.
J. Complexity, 1997

Quasi-Planar Graphs Have a Linear Number of Edges.
Combinatorica, 1997

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

On the Combinatorial and Algebraic Complexity of Quantifier Elimination.
J. ACM, 1996

Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995
On the Connected Components of the Space of Line Transersals t a Family of Convex Sets.
Discrete & Computational Geometry, 1995

Quasi-Planar Graphs Have a Linear Number of Edges.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

1994
Every Arrangement Extends to a Spread.
Combinatorica, 1994

On the Combinatorial and Algebraic Complexity of Quantifier Elimination
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

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

1993
Weaving Patterns of Lines and Line Segments in Space.
Algorithmica, 1993

1992
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci., 1992

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

1991
The complexity of point configurations.
Discrete Applied Mathematics, 1991

Counting and Cutting Cycles of Lines and Rods in Space.
Comput. Geom., 1991

1990
Necessary and sufficient conditions for hyperplane transversals.
Combinatorica, 1990

How to draw a planar graph on a grid.
Combinatorica, 1990

Weaving Patterns of Lines and Segments in Space.
Proceedings of the Algorithms, 1990

Counting and Cutting Cycles of Lines and Rods in Space
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 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
Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B, 1989

Computing the Geodesic Center of a Simple Polygon.
Discrete & Computational Geometry, 1989

On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discrete & Computational Geometry, 1989

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

Necessary and Sufficient Conditions for Hyperplane Transversals.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry, 1988

Small Sets Supporting Fáry Embeddings of Planar Graphs
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

On Arrangements of Jordan Arcs with Three Intersections per Pair.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Computing the Link Center of a Simple Polygon.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Preface.
Discrete Mathematics, 1986

Upper Bounds for Configurations and Polytopes in Rd.
Discrete & Computational Geometry, 1986

Geometric Applications of Davenport-Schinzel Sequences
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
Increasing the Minimum Distance of a Set of Points.
J. Comb. Theory, Ser. A, 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 P2.
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


  Loading...