2008 |
54 | EE | Jacob E. Goodman,
Richard Pollack:
The combinatorial encoding of disjoint convex sets in the plane.
Combinatorica 28(1): 69-81 (2008) |
53 | EE | Jacob E. Goodman,
János Pach,
Richard Pollack:
Foreword.
Discrete & Computational Geometry 39(1-3): 1-2 (2008) |
52 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the First Betti Number of a Semi-Algebraic Set.
Foundations of Computational Mathematics 8(1): 97-136 (2008) |
2007 |
51 | EE | Raghavan Dhandapani,
Jacob E. Goodman,
Andreas Holmsen,
Richard Pollack,
Shakhar Smorodinsky:
Convexity in Topological Affine Planes.
Discrete & Computational Geometry 38(2): 243-257 (2007) |
2006 |
50 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
CoRR abs/math/0603248: (2006) |
49 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
An asymptotically tight bound on the number of connected components of realizable sign conditions
CoRR abs/math/0603256: (2006) |
2005 |
48 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the first Betti number and the connected components of semi-algebraic sets.
STOC 2005: 304-312 |
47 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing the euler-poincaré characteristics of sign conditions.
Computational Complexity 14(1): 53-71 (2005) |
46 | EE | Jacob E. Goodman,
Richard Pollack:
Editorial Note.
Discrete & Computational Geometry 33(1): 1 (2005) |
2004 |
45 | EE | Saugata Basu,
Raghavan Dhandapani,
Richard Pollack:
On the Realizable Weaving Patterns of Polynomial Curves in R3.
Graph Drawing 2004: 36-42 |
2002 |
44 | | Boris Aronov,
Jacob E. Goodman,
Richard Pollack:
A Helly-type theorem for higher-dimensional transversals.
Comput. Geom. 21(3): 177-183 (2002) |
2001 |
43 | EE | Pankaj K. Agarwal,
Dan Halperin,
Richard Pollack:
Guest Editors' Foreword.
Discrete & Computational Geometry 25(4): 505-506 (2001) |
42 | EE | Boris Aronov,
Jacob E. Goodman,
Richard Pollack,
Rephael Wenger:
A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.
Discrete & Computational Geometry 25(4): 507-517 (2001) |
2000 |
41 | EE | Boris Aronov,
Jacob E. Goodman,
Richard Pollack,
Rephael Wenger:
A Helly-type theorem for hyperplane transversals to well-separated convex sets.
Symposium on Computational Geometry 2000: 57-63 |
40 | EE | Boris Aronov,
Jacob E. Goodman,
Richard Pollack,
Rephael Wenger:
On the Helly Number for Hyperplane Transversals to Unit Balls.
Discrete & Computational Geometry 24(2-3): 171-176 (2000) |
1998 |
39 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.
ISSAC 1998: 25-29 |
1997 |
38 | | Pankaj K. Agarwal,
Boris Aronov,
János Pach,
Richard Pollack,
Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges.
Combinatorica 17(1): 1-9 (1997) |
37 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety.
J. Complexity 13(1): 28-37 (1997) |
1996 |
36 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).
STOC 1996: 168-173 |
35 | EE | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination.
J. ACM 43(6): 1002-1045 (1996) |
34 | EE | Jacob E. Goodman,
Richard Pollack,
Rephael Wenger:
Bounding the Number of Geometric Permutations Induced byk-Transversals.
J. Comb. Theory, Ser. A 75(2): 187-197 (1996) |
1995 |
33 | | Pankaj K. Agarwal,
Boris Aronov,
János Pach,
Richard Pollack,
Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges.
Graph Drawing 1995: 1-7 |
32 | | Jacob E. Goodman,
Richard Pollack,
Rephael Wenger:
On the Connected Components of the Space of Line Transersals t a Family of Convex Sets.
Discrete & Computational Geometry 13: 469-476 (1995) |
1994 |
31 | | Saugata Basu,
Richard Pollack,
Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination
FOCS 1994: 632-641 |
30 | EE | Jacob E. Goodman,
Richard Pollack,
Rephael Wenger:
Bounding the Number of Geometric Permutations Induced by k-Transversals.
Symposium on Computational Geometry 1994: 192-197 |
29 | | Jacob E. Goodman,
Richard Pollack,
Rephael Wenger,
Tudor Zamfirescu:
Every Arrangement Extends to a Spread.
Combinatorica 14(3): 301-306 (1994) |
1993 |
28 | | János Pach,
Richard Pollack,
Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space.
Algorithmica 9(6): 561-571 (1993) |
1992 |
27 | EE | Jacob E. Goodman,
Richard Pollack,
Rephael Wenger,
Tudor Zamfirescu:
There is a Universal Topological Plane.
Symposium on Computational Geometry 1992: 171-176 |
26 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms.
Theor. Comput. Sci. 92(2): 319-336 (1992) |
1991 |
25 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space.
Comput. Geom. 1: 305-323 (1991) |
24 | EE | Jacob E. Goodman,
Richard Pollack:
The complexity of point configurations.
Discrete Applied Mathematics 31(2): 167-180 (1991) |
1990 |
23 | | Bernard Chazelle,
Herbert Edelsbrunner,
Leonidas J. Guibas,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
Counting and Cutting Cycles of Lines and Rods in Space
FOCS 1990: 242-251 |
22 | | János Pach,
Richard Pollack,
Emo Welzl:
Weaving Patterns of Lines and Segments in Space.
SIGAL International Symposium on Algorithms 1990: 439-446 |
21 | EE | Sylvain E. Cappell,
Jacob E. Goodman,
János Pach,
Richard Pollack,
Micha Sharir,
Rephael Wenger:
The Combinatorial Complexity of Hyperplane Transversals.
Symposium on Computational Geometry 1990: 83-91 |
20 | | Hubert de Fraysseix,
János Pach,
Richard Pollack:
How to draw a planar graph on a grid.
Combinatorica 10(1): 41-51 (1990) |
19 | | Richard Pollack,
Rephael Wenger:
Necessary and sufficient conditions for hyperplane transversals.
Combinatorica 10(3): 307-311 (1990) |
1989 |
18 | | Jacob E. Goodman,
Richard Pollack,
Bernd Sturmfels:
Coordinate Representation of Order Types Requires Exponential Storage
STOC 1989: 405-410 |
17 | EE | Richard Pollack,
Rephael Wenger:
Necessary and Sufficient Conditions for Hyperplane Transversals.
Symposium on Computational Geometry 1989: 152-155 |
16 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
On Arrangement of Jordan Arcs with Three Intersection per Pair.
Discrete & Computational Geometry 4: 523-539 (1989) |
15 | | Richard Pollack,
Micha Sharir,
Günter Rote:
Computing the Geodesic Center of a Simple Polygon.
Discrete & Computational Geometry 4: 611-626 (1989) |
14 | EE | Paul Erdös,
János Pach,
Richard Pollack,
Zsolt Tuza:
Radius, diameter, and minimum degree.
J. Comb. Theory, Ser. B 47(1): 73-79 (1989) |
1988 |
13 | | Herbert Edelsbrunner,
Leonidas J. Guibas,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.
ICALP 1988: 214-229 |
12 | | Hubert de Fraysseix,
János Pach,
Richard Pollack:
Small Sets Supporting Fáry Embeddings of Planar Graphs
STOC 1988: 426-433 |
11 | EE | Herbert Edelsbrunner,
Leonidas J. Guibas,
John Hershberger,
János Pach,
Richard Pollack,
Raimund Seidel,
Micha Sharir,
Jack Snoeyink:
On Arrangements of Jordan Arcs with Three Intersections per Pair.
Symposium on Computational Geometry 1988: 258-265 |
10 | | William Lenhart,
Richard Pollack,
Jörg-Rüdiger Sack,
Raimund Seidel,
Micha Sharir,
Subhash Suri,
Godfried T. Toussaint,
Sue Whitesides,
Chee-Keng Yap:
Computing the Link Center of a Simple Polygon.
Discrete & Computational Geometry 3: 281-293 (1988) |
1987 |
9 | EE | William Lenhart,
Richard Pollack,
Jörg-Rüdiger Sack,
Raimund Seidel,
Micha Sharir,
Subhash Suri,
Godfried T. Toussaint,
Sue Whitesides,
Chee-Keng Yap:
Computing the Link Center of a Simple Polygon.
Symposium on Computational Geometry 1987: 1-10 |
1986 |
8 | | Micha Sharir,
Richard Cole,
Klara Kedem,
Daniel Leven,
Richard Pollack,
Shmuel Sifrony:
Geometric Applications of Davenport-Schinzel Sequences
FOCS 1986: 77-86 |
7 | | Jacob E. Goodman,
Richard Pollack:
Upper Bounds for Configurations and Polytopes in Rd.
Discrete & Computational Geometry 1: 219-227 (1986) |
6 | EE | Jacob E. Goodman,
Richard Pollack:
Preface.
Discrete Mathematics 60: 1 (1986) |
1984 |
5 | | Jacob E. Goodman,
Richard Pollack:
On the Number of k-Subsets of a Set of n Points in the Plane.
J. Comb. Theory, Ser. A 36(1): 101-104 (1984) |
4 | | Jacob E. Goodman,
Richard Pollack:
Semispaces of Configurations, Cell Complexes of Arrangements.
J. Comb. Theory, Ser. A 37(3): 257-293 (1984) |
1983 |
3 | | Jacob E. Goodman,
Richard Pollack:
Multidimensional Sorting.
SIAM J. Comput. 12(3): 484-507 (1983) |
1982 |
2 | | Jacob E. Goodman,
Richard Pollack:
Helly-Type Theorems for Pseudoline Arrangements in P2.
J. Comb. Theory, Ser. A 32(1): 1-19 (1982) |
1981 |
1 | | Jacob E. Goodman,
Richard Pollack:
Three Points Do Not Determine a (Pseudo-) Plane.
J. Comb. Theory, Ser. A 31(2): 215-218 (1981) |