default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Sheffer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Adam Sheffer, Olivine Silier:
A Structural Szemerédi-Trotter Theorem for Cartesian Products. Discret. Comput. Geom. 71(2): 646-666 (2024)- [j25]Toby Aldape, Jingyi Liu
, Gregory Pylypovych, Adam Sheffer, Minh-Quan Vo:
Distinct distances in R3 between quadratic and orthogonal curves. Eur. J. Comb. 120: 103993 (2024) - 2023
- [j24]Martin Balko, Adam Sheffer, Ruiwen Tang:
The constant of point-line incidence constructions. Comput. Geom. 114: 102009 (2023) - [j23]Surya Mathialagan, Adam Sheffer:
Distinct Distances on Non-Ruled Surfaces and Between Circles. Discret. Comput. Geom. 69(2): 422-452 (2023) - 2021
- [j22]Thao Do, Adam Sheffer:
A general incidence bound in Rd. Eur. J. Comb. 95: 103330 (2021) - 2020
- [j21]Matthew Hase-Liu, Adam Sheffer:
Sum-product phenomena for planar hypercomplex numbers. Eur. J. Comb. 89: 103162 (2020) - [j20]Sara Fish, Cosmin Pohoata, Adam Sheffer:
Local Properties via Color Energy Graphs and Forbidden Configurations. SIAM J. Discret. Math. 34(1): 177-187 (2020) - [i13]Adam Sheffer, Joshua Zahl:
Distinct distances in the complex plane. CoRR abs/2006.08886 (2020)
2010 – 2019
- 2019
- [j19]Cosmin Pohoata, Adam Sheffer:
Local Properties in Colored Graphs, Distinct Distances, and Difference Sets. Comb. 39(3): 705-714 (2019) - [j18]Sara Fish, Ben Lund, Adam Sheffer:
A construction for difference sets with local properties. Eur. J. Comb. 79: 237-243 (2019) - [j17]Sam Bardwell-Evans, Adam Sheffer:
A reduction for the distinct distances problem in Rd. J. Comb. Theory A 166: 171-225 (2019) - 2018
- [j16]Adam Sheffer, Endre Szabó, Joshua Zahl:
Point-Curve Incidences in the Complex Plane. Comb. 38(2): 487-499 (2018) - 2016
- [j15]Adam Sheffer, Joshua Zahl, Frank de Zeeuw:
Few distinct distances implies no heavy lines or circles. Comb. 36(3): 349-364 (2016) - [j14]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝd. Electron. J. Comb. 23(4): 4 (2016) - [j13]Ben Lund, Adam Sheffer, Frank de Zeeuw:
Bisector Energy and Few Distinct Distances. Discret. Comput. Geom. 56(2): 337-356 (2016) - [j12]Igor Pak, Adam Sheffer, Martin Tassy:
Fast Domino Tileability. Discret. Comput. Geom. 56(2): 377-394 (2016) - 2015
- [j11]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved Bounds for Incidences Between Points and Circles. Comb. Probab. Comput. 24(3): 490-520 (2015) - [c8]Ben Lund, Adam Sheffer, Frank de Zeeuw:
Bisector Energy and Few Distinct Distances. SoCG 2015: 537-552 - [c7]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝ d. ESA 2015: 977-988 - 2014
- [b1]Adam Sheffer:
New Approaches to Some Problems in Combinatorial Geometry/ Adam, Sheffer. Tel Aviv University, Israel, 2014 - [j10]Vida Dujmovic, Pat Morin, Adam Sheffer:
Crossings in Grid Drawings. Electron. J. Comb. 21(1): 1 (2014) - [j9]Javier Cilleruelo, Micha Sharir, Adam Sheffer:
A note on distinct distances in rectangular lattices. Discret. Math. 336: 37-40 (2014) - [j8]Abdul Basit, Adam Sheffer:
Incidences with k-non-degenerate sets and their applications. J. Comput. Geom. 5(1): 284-302 (2014) - [i12]Adam Sheffer:
Distinct Distances: Open Problems and Current Bounds. CoRR abs/1406.1949 (2014) - 2013
- [j7]Moria Ben-Ner, André Schulz, Adam Sheffer:
On numbers of pseudo-triangulations. Comput. Geom. 46(6): 688-699 (2013) - [j6]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. Comb. Probab. Comput. 22(6): 935-954 (2013) - [j5]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory A 120(4): 777-794 (2013) - [j4]Micha Sharir, Adam Sheffer, József Solymosi:
Distinct distances on two lines. J. Comb. Theory A 120(7): 1732-1736 (2013) - [j3]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs. SIAM J. Discret. Math. 27(2): 802-826 (2013) - [c6]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved bounds for incidences between points and circles. SoCG 2013: 97-106 - [i11]Vida Dujmovic, Pat Morin, Adam Sheffer:
Crossings in Grid Drawings. CoRR abs/1301.0303 (2013) - [i10]Micha Sharir, Adam Sheffer:
Distinct distances on two lines. CoRR abs/1302.3081 (2013) - [i9]Javier Cilleruelo, Micha Sharir, Adam Sheffer:
On lattices, distinct distances, and the Elekes-Sharir framework. CoRR abs/1306.0242 (2013) - [i8]Adam Sheffer, Joshua Zahl, Frank de Zeeuw:
Few distinct distances implies no heavy lines or circles. CoRR abs/1308.5620 (2013) - 2012
- [c5]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. SCG 2012: 189-198 - [c4]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. GD 2012: 19-30 - [i7]Micha Sharir, Adam Sheffer, Joshua Zahl:
Incidences between points and non-coplanar circles. CoRR abs/1208.0053 (2012) - [i6]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. CoRR abs/1209.0194 (2012) - [i5]Moria Ben-Ner, André Schulz, Adam Sheffer:
On Numbers of Pseudo-Triangulations. CoRR abs/1210.7126 (2012) - 2011
- [j2]Micha Sharir, Adam Sheffer:
Counting Triangulations of Planar Point Sets. Electron. J. Comb. 18(1) (2011) - [j1]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. J. Comb. Theory A 118(7): 1979-1999 (2011) - [c3]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. STACS 2011: 637-648 - [c2]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535 - [i4]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique. CoRR abs/1109.5596 (2011) - 2010
- [c1]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. SCG 2010: 297-306 - [i3]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010) - [i2]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the maximum multiplicity of some common geometric graphs. CoRR abs/1012.5664 (2010)
2000 – 2009
- 2009
- [i1]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting Triangulations of Planar Point Sets. CoRR abs/0911.3352 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
