Asaf Shapira
2012
A researcher in the Science corpus: 1 paper; trusts 4 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Asaf Shapira trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Asaf Shapira's perspective
Ordered by how strongly the researchers Asaf Shapira trusts endorse each paper. Same corpus, a different order for every researcher.
- A combinatorial problem in geometry
- A Course in Enumeration
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- Erdős–Szekeres‐type theorems for monotone paths and convex bodies
- Sparse partition universal graphs for graphs of bounded degree
- Hypergraph Ramsey numbers
- A new upper bound for diagonal Ramsey numbers
- Geometric Range Searching and Its Relatives
- Regularity Partitions and The Topology of Graphons
- The early evolution of the H-free process
Their papers
- Ramsey Theory, integer partitions and a new proof of the Erdős–Szekeres Theorem (2012) — 78 citations