Adam Sheffer's Home Page

Adam Sheffer

California Institute of Technology (Caltech),
Department of Mathematics,
276 Sloan.

Phone: 626-395-4347,
Email: adamsh -at-

(Picture by Dawn K Chase)


I am organizing the Caltech combinatorics seminar.

Check out my blog focusing on algebraic discrete geometry.

I am a Bateman Research Instructor, working with Nets Katz. Before that, I did my Ph.D. in Tel Aviv University under the supervision of Micha Sharir.

Research related pages:

Currently Teaching (winter 16/17):


  1. A. Sheffer,
    Lower bounds for incidences with hypersurfaces,
    Discrete Analysis, to appear.

  2. J. Fox, J. Pach, A. Sheffer, A. Suk, and J. Zahl,
    A semi-algebraic version of Zarankiewicz's problem,
    Journal of the European Mathematical Society, to appear.

  3. A. Sheffer, E. Szabó, and J. Zahl,
    Point-curve incidences in the complex plane,
    Combinatorica, to appear.

  4. B. Lund, A. Sheffer, and F. de Zeeuw,
    Bisector energy and few distinct distances,
    Discrete Comput. Geom., 56 (2016), 337--356.

  5. A. Sheffer, J. Zahl, and F. de Zeeuw,
    Few distinct distances implies no heavy lines or circles,
    Combinatorica, to appear.

  6. I. Pak, A. Sheffer, and M. Tassy,
    Fast domino tileability,
    Discrete Comput. Geom., 56 (2016), 377--394.

  7. M. Sharir, A. Sheffer, and N. Solomon,
    Incidences with curves in R^d,
    Electr. J. Comb., to appear.

  8. M. Sharir, A. Sheffer, and J. Zahl,
    Improved bounds for incidences between points and circles,
    Combinat. Probab. Comput. 24, 490--520.

  9. J. Cilleruelo, M. Sharir, and A. Sheffer,
    A note on distinct distances in rectangular lattices,
    Discrete Math. 336 (2014), 37--40.

  10. A. Basit and A. Sheffer,
    Incidences with k-non-degenerate sets and their applications,
    Journal of Computational Geometry 5 (2014), 284--302.

  11. V. Dujmović, P. Morin and A. Sheffer,
    Crossings in grid drawings,
    Electr. J. Comb. 21(1) (2014).

  12. M. Sharir, A. Sheffer, and J. Solymosi,
    Distinct distances on two lines,
    J. Combinat. Theory A, 120 (2013), 1732--1736.

  13. M. Sharir and A. Sheffer,
    Counting plane graphs: Cross-graph charging schemes,
    Combinat. Probab. Comput., 22 (2013), 935--954.

  14. M. Sharir, A. Sheffer, and E. Welzl,
    Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique,
    J. Combinat. Theory A 120 (2013), 777--794.

  15. M. Ben-Ner, A. Schulz, and A. Sheffer,
    On numbers of pseudo-triangulations,
    Comput. Geom. Theory Appl. 46 (2013), 688--699.

  16. M. Hoffmann, A. Schulz, M. Sharir, A. Sheffer, C. D. Tóth, and E. Welzl,
    Counting plane graphs: Flippability and its applications,
    Thirty Essays on Geometric Graph Theory (J. Pach, ed.), Springer, 2013, pp. 303--326.

  17. A. Dumitrescu, A. Schulz, A. Sheffer, and Cs. D. Tóth,
    Bounds on the maximum multiplicity of some common geometric graphs,
    SIAM J. Discrete Math., 27 (2013), 802--826.

  18. M. Sharir, A. Sheffer, and E. Welzl,
    On degrees in random triangulations,
    J. Combinat. Theory A 118 (2011), 1979--1999.

  19. M. Sharir and A. Sheffer,
    Counting triangulations of planar point sets ,
    Electr. J. Comb., 18(1) (2011)


  1. A. Sheffer,
    Distinct Distances: Open Problems and Current Bounds,