◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Shapira

65 papers hereh-index 262.9k citations121 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author14
  • middle author15
  • last author34

Across the 65 of 65 papers where every author was matched, so the position is known.

fields
  • math.CO52
  • cs.DS8
  • math.NT3
  • cs.CC2
same name
  • A. Shapira — 18 papers, h 7
  • A. Shapira — 3 papers
  • A. Shapira — 2 papers, h 34
  • A. Shapira — 1 paper, h 4
  • A. Shapira — 1 paper, h 12

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20072026
most citedA Proof of Green's Conjecture Regarding the Removal Properties of Sets of Linear Equations

23 citations · 54 across the 45 of their papers we have counts for

collaborators
Showing 2012 · math.COShow all

4 papers · 2 filters

math.CO2012★ 3 cited

Exact Bounds for Some Hypergraph Saturation Problems

Guy Moshkovitz, Asaf Shapira

Let W_n(p,q) denote the minimum number of edges in an n x n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that…

math.CO2012

Small Complete Minors Above the Extremal Edge Density

Asaf Shapira, Benny Sudakov

A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma show…

math.CO2012★ 6 cited

Ramsey Theory, Integer Partitions and a New Proof of the Erdos-Szekeres Theorem

Guy Moshkovitz, Asaf Shapira

Let H be a k-uniform hypergraph whose vertices are the integers 1,...,N. We say that H contains a monotone path of length n if there are x_1 < x_2 < ... < x_{n+k-1} so that H conta…

math.CO2012

Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs

Hao Huang, Jie Ma, Asaf Shapira +2

A minimum feedback arc set of a directed graph G is a smallest set of arcs whose removal makes G acyclic. Its cardinality is denoted by β(G). We show that an Eulerian digraph…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.