Elad Aigner‐Horev

Publications

111

Citations

H-Index

2008

Active since

Affiliations

Ben-Gurion University of the Negev(Current)

Ariel University

Elad Aigner‐Horev is an author at Ben-Gurion University of the Negev specializing in discrete mathematics, graph theory, and combinatorial optimization.

ORCID

Top concepts

Discrete MathematicsGraph TheoryCombinatorial OptimizationEngineeringComputational GeometryBusinessGeometryEducationNetwork ScienceComputer Science

Publications per year

2008–2021

Publications

Envy-free Matchings in Bipartite Graphs and their Applications to Fair\n Division

Elad Aigner‐Horev, Erel Segal-Halevi · arXiv (Cornell University) · 2019 · 20 citations · Full text

Infinite matroid union

Elad Aigner‐Horev, Johannes Carmesin, Jan-Oliver Fröhlich · arXiv (Cornell University) · 2011 · 17 citations · Full text

Mathematical Programming, Matroid Theory, Engineering +10

Polychromatic 4-coloring of cubic bipartite plane graphs

Elad Aigner‐Horev, Matthew J. Katz, Roi Krakovski et al. · Discrete Mathematics · 2011 · 16 citations

Graph Theory, Extremal Graph Theory, Topological Graph Theory +5

Polychromatic colorings of bounded degree plane graphs

Elad Aigner‐Horev, Roi Krakovski · Journal of Graph Theory · 2009 · 15 citations

Polychromatic K, Polychromatic Colorings, Geometric Graph Theory +8

Envy-free matchings in bipartite graphs and their applications to fair division

Elad Aigner‐Horev, Erel Segal-Halevi · Information Sciences · 2021 · 12 citations · Full text

Network Science, Graph Theory, Engineering +12

Rows per page

1–5 of 8