| A generalized Turán problem and its applications L Gishboliner, A Shapira Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 69 | 2018 |
| Removal lemmas with polynomial bounds L Gishboliner, A Shapira Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 27 | 2017 |
| Counting subgraphs in degenerate graphs SK Bera, L Gishboliner, Y Levanzov, C Seshadhri, A Shapira ACM Journal of the ACM (JACM) 69 (3), 1-21, 2022 | 24 | 2022 |
| Very fast construction of bounded-degree spanning graphs via the semi-random graph process O Ben-Eliezer, L Gishboliner, D Hefetz, M Krivelevich Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 22 | 2020 |
| A new bound for the Brown–Erdős–Sós problem D Conlon, L Gishboliner, Y Levanzov, A Shapira Journal of Combinatorial Theory, Series B 158, 1-35, 2023 | 19 | 2023 |
| Color‐biased Hamilton cycles in random graphs L Gishboliner, M Krivelevich, P Michaeli Random Structures & Algorithms 60 (3), 289-307, 2022 | 19 | 2022 |
| Dichromatic number and forced subdivisions L Gishboliner, R Steiner, T Szabó Journal of Combinatorial Theory, Series B 153, 1-30, 2022 | 19 | 2022 |
| Discrepancies of spanning trees and Hamilton cycles L Gishboliner, M Krivelevich, P Michaeli Journal of Combinatorial Theory, Series B 154, 262-291, 2022 | 17 | 2022 |
| Efficient removal without efficient regularity L Gishboliner, A Shapira Combinatorica 39 (3), 639-658, 2019 | 14 | 2019 |
| Deterministic vs non-deterministic graph property testing L Gishboliner, A Shapira Israel Journal of Mathematics 204 (1), 397-416, 2014 | 13 | 2014 |
| Constructing dense grid-free linear 3-graphs L Gishboliner, A Shapira Proceedings of the American Mathematical Society 150 (1), 69-74, 2022 | 12 | 2022 |
| On 3‐graphs with no four vertices spanning exactly two edges L Gishboliner, I Tomon Bulletin of the London Mathematical Society 54 (6), 2117-2134, 2022 | 9 | 2022 |
| The removal lemma for tournaments J Fox, L Gishboliner, A Shapira, R Yuster Journal of Combinatorial Theory, Series B 136, 110-134, 2019 | 8 | 2019 |
| Minimum Degree Threshold for -factors with High Discrepancy D Bradač, M Christoph, L Gishboliner arXiv preprint arXiv:2302.13780, 2023 | 6 | 2023 |
| Counting homomorphic cycles in degenerate graphs L Gishboliner, Y Levanzov, A Shapira, R Yuster ACM Transactions on Algorithms 19 (1), 1-22, 2023 | 6 | 2023 |
| Oriented cycles in digraphs of large outdegree L Gishboliner, R Steiner, T Szabó Combinatorica 42 (Suppl 1), 1145-1187, 2022 | 6 | 2022 |
| The minrank of random graphs over arbitrary fields N Alon, I Balla, L Gishboliner, A Mond, F Mousset Israel Journal of Mathematics 235 (1), 63-77, 2020 | 6 | 2020 |
| Large cliques or cocliques in hypergraphs with forbidden order-size pairs M Axenovich, D Bradač, L Gishboliner, D Mubayi, L Weber Combinatorics, Probability and Computing 33 (3), 286-299, 2024 | 5 | 2024 |
| Tight Hamilton cycles with high discrepancy L Gishboliner, S Glock, A Sgueglia arXiv preprint arXiv:2312.09976, 2023 | 5 | 2023 |
| Oriented discrepancy of Hamilton cycles L Gishboliner, M Krivelevich, P Michaeli Journal of Graph Theory 103 (4), 780-792, 2023 | 5 | 2023 |
