The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Richard Pollack: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hubert de Fraysseix, János Pach, Richard Pollack
    Small Sets Supporting Fáry Embeddings of Planar Graphs [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:426-433 [Conf]
  2. 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]
  3. 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]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  5. 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]
  6. 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]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  8. Richard Pollack, Rephael Wenger
    Necessary and Sufficient Conditions for Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:152-155 [Conf]
  9. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    On the Combinatorial and Algebraic Complexity of Quantifier Elimination [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:632-641 [Conf]
  10. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:242-251 [Conf]
  11. Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
    Geometric Applications of Davenport-Schinzel Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:77-86 [Conf]
  12. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:1-7 [Conf]
  13. Saugata Basu, Raghavan Dhandapani, Richard Pollack
    On the Realizable Weaving Patterns of Polynomial Curves in R3. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:36-42 [Conf]
  14. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:214-229 [Conf]
  15. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:25-29 [Conf]
  16. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Segments in Space. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:439-446 [Conf]
  17. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    Computing the first Betti number and the connected components of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:304-312 [Conf]
  18. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:168-173 [Conf]
  19. 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]
  20. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Line Segments in Space. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:561-571 [Journal]
  21. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    Computing the euler-poincaré characteristics of sign conditions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:1, pp:53-71 [Journal]
  22. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:1-9 [Journal]
  23. Hubert de Fraysseix, János Pach, Richard Pollack
    How to draw a planar graph on a grid. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:41-51 [Journal]
  24. 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]
  25. Richard Pollack, Rephael Wenger
    Necessary and sufficient conditions for hyperplane transversals. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:3, pp:307-311 [Journal]
  26. 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]
  27. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:305-323 [Journal]
  28. 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]
  29. 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]
  30. Pankaj K. Agarwal, Dan Halperin, Richard Pollack
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:505-506 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  32. Jacob E. Goodman, Richard Pollack
    Editorial Note. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:1- [Journal]
  33. 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]
  34. 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]
  35. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  36. Richard Pollack, Micha Sharir, Günter Rote
    Computing the Geodesic Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:611-626 [Journal]
  37. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    On the Combinatorial and Algebraic Complexity of Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:6, pp:1002-1045 [Journal]
  38. 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. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:28-37 [Journal]
  39. Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
    Radius, diameter, and minimum degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:73-79 [Journal]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. Jacob E. Goodman, Richard Pollack
    Multidimensional Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:484-507 [Journal]
  46. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:319-336 [Journal]
  47. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  48. Saugata Basu, Richard Pollack, Marie-Françoise Roy
    An asymptotically tight bound on the number of connected components of realizable sign conditions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  49. Jacob E. Goodman, Richard Pollack
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:1- [Journal]

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


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


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


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


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


Search in 0.036secs, Finished in 0.040secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002