Envy-free matchings in bipartite graphs and their applications to fair division E Aigner-Horev, E Segal-Halevi Information Sciences 587, 164-187, 2022 | 41 | 2022 |
Quasirandomness in Hypergraphs MS E. Aigner-Horev, D. Conlon, H. Han, Y. Person Electronic journal of combinatorics 25 (3), P3.34, 2018 | 32* | 2018 |
Polychromatic 4-coloring of cubic bipartite plane graphs E Horev, MJ Katz, R Krakovski, A Nakamoto Discrete Mathematics 312 (4), 715-719, 2012 | 29 | 2012 |
Conflict-free coloring made stronger E Horev, R Krakovski, S Smorodinsky Algorithm Theory-SWAT 2010: 12th Scandinavian Symposium and Workshops on …, 2010 | 29 | 2010 |
Infinite matroid union E Aigner-Horev, J Carmesin, JO Fröhlich arXiv preprint arXiv:1111.0602, 2011 | 28 | 2011 |
Polychromatic colorings of bounded degree plane graphs E Horev, R Krakovski Journal of Graph Theory 60 (4), 269-283, 2009 | 26 | 2009 |
On the intersection of infinite matroids E Aigner-Horev, J Carmesin, JO Fröhlich Discrete Mathematics 341 (6), 1582-1596, 2018 | 25 | 2018 |
Polychromatic colorings of rectangular partitions D Dimitrov, E Horev, R Krakovski Discrete mathematics 309 (9), 2957-2960, 2009 | 19 | 2009 |
Polychromatic 4-coloring of guillotine subdivisions E Horev, MJ Katz, R Krakovski, M Löffler Information processing letters 109 (13), 690-694, 2009 | 16 | 2009 |
Monochromatic Schur triples in randomly perturbed dense sets of integers E Aigner-Horev, Y Person SIAM Journal on Discrete Mathematics 33 (4), 2175-2180, 2019 | 13 | 2019 |
Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs E Aigner-Horev, D Hefetz SIAM Journal on Discrete Mathematics 35 (3), 1569-1577, 2021 | 12 | 2021 |
Small rainbow cliques in randomly perturbed dense graphs E Aigner-Horev, O Danon, D Hefetz, S Letzter European Journal of Combinatorics 101, 103452, 2022 | 10 | 2022 |
Subdivisions in apex graphs E Aigner-Horev Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 82 (1 …, 2012 | 10 | 2012 |
Extremal graphs without a semi‐topological wheel E Horev Journal of Graph Theory 68 (4), 326-339, 2011 | 10 | 2011 |
Large rainbow cliques in randomly perturbed dense graphs E Aigner-Horev, O Danon, D Hefetz, S Letzter SIAM Journal on Discrete Mathematics 36 (4), 2975-2994, 2022 | 9 | 2022 |
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs E Aigner-Horev, G Levy Combinatorics, Probability and Computing 30 (3), 412-443, 2021 | 9 | 2021 |
Rainbow trees in uniformly edge‐colored graphs E Aigner‐Horev, D Hefetz, A Lahiri Random Structures & Algorithms 62 (2), 287-303, 2023 | 8 | 2023 |
Experimental Study of Bounding Box Algorithms. D Dimitrov, M Holst, C Knauer, K Kriegel GRAPP, 15-22, 2008 | 8 | 2008 |
The structure of 2-separations of infinite matroids E Aigner-Horev, R Diestel, L Postle Journal of combinatorial theory series B 116, 25-56, 2016 | 6 | 2016 |
The structure of 2-separations of infinite matroids E Aigner-Horev, R Diestel, L Postle arXiv preprint arXiv:1201.1135, 2012 | 5 | 2012 |