Deterministic vs Non-deterministic Graph Property Testing. - Lior Gishboliner; Asaf Shapira (Electron. Colloquium Comput. Complex., 2013)

Removal lemmas with polynomial bounds. - Lior Gishboliner; Asaf Shapira (STOC, 2017)

Efficient Testing without Efficient Regularity. - Lior Gishboliner; Asaf Shapira (ITCS, 2018)

The Minrank of Random Graphs over Arbitrary Fields. - Noga Alon; Igor Balla; Lior Gishboliner; Adva Mond; Frank Mousset (CoRR, 2018)

A Generalized Turan Problem and its Applications. - Lior Gishboliner; Asaf Shapira (Electron. Colloquium Comput. Complex., 2018)

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. - Lior Gishboliner; Michael Krivelevich; Gal Kronenberg (Random Struct. Algorithms, 2018)

Efficient Removal Without Efficient Regularity. - Lior Gishboliner; Asaf Shapira (Comb., 2019)

Testing Graphs against an Unknown Distribution. - Lior Gishboliner; Asaf Shapira (Electron. Colloquium Comput. Complex., 2019)

On the separation conjecture in Avoider-Enforcer games. - Malgorzata Bednarska-Bzdega; Omri Ben-Eliezer; Lior Gishboliner; Tuan Tran (J. Comb. Theory B, 2019)

The removal lemma for tournaments. - Jacob Fox; Lior Gishboliner; Asaf Shapira; Raphael Yuster (J. Comb. Theory B, 2019)

Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties. - Lior Gishboliner (CoRR, 2020)

Counting Subgraphs in Degenerate Graphs. - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (Electron. Colloquium Comput. Complex., 2020)

Testing linear inequalities of subgraph statistics. - Lior Gishboliner; Asaf Shapira; Henrique Stagni (Electron. Colloquium Comput. Complex., 2020)

Very fast construction of bounded-degree spanning graphs via the semi-random graph process. - Omri Ben-Eliezer; Lior Gishboliner; Dan Hefetz; Michael Krivelevich (Random Struct. Algorithms, 2020)

Polynomial removal lemmas for ordered graphs. - Lior Gishboliner; István Tomon (Comb. Theory, 2022)

A characterization of easily testable induced digraphs and k-colored graphs. - Lior Gishboliner (Eur. J. Comb., 2022)

Counting Subgraphs in Degenerate Graphs. - Suman K. Bera 001; Lior Gishboliner; Yevgeny Levanzov; C. Seshadhri 001; Asaf Shapira (J. ACM, 2022)

Discrepancies of spanning trees and Hamilton cycles. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (J. Comb. Theory B, 2022)

Dichromatic number and forced subdivisions. - Lior Gishboliner; Raphael Steiner; Tibor Szabó (J. Comb. Theory B, 2022)

Color-biased Hamilton cycles in random graphs. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (Random Struct. Algorithms, 2022)

Oriented Cycles in Digraphs of Large Outdegree. - Lior Gishboliner; Raphael Steiner; Tibor Szabó (Comb., 2022)

On Rödl's Theorem for Cographs. - Lior Gishboliner; Asaf Shapira (Electron. J. Comb., 2023)

A new bound for the Brown-Erdős-Sós problem. - David Conlon; Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (J. Comb. Theory B, 2023)

Counting Homomorphic Cycles in Degenerate Graphs. - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira; Raphael Yuster (ACM Trans. Algorithms, 2023)

Asymptotics of the Hypergraph Bipartite Turán Problem. - Domagoj Bradac; Lior Gishboliner; Oliver Janzer; Benny Sudakov (Comb., 2023)

Oriented discrepancy of Hamilton cycles. - Lior Gishboliner; Michael Krivelevich; Peleg Michaeli (J. Graph Theory, 2023)

Maximal chordal subgraphs. - Lior Gishboliner; Benny Sudakov (Comb. Probab. Comput., 2023)

Minimum Degree Threshold for $H$-factors with High Discrepancy. - Domagoj Bradac; Micha Christoph; Lior Gishboliner (Electron. J. Comb., 2024)

Polynomial Removal Lemma for Ordered Matchings. - Lior Gishboliner; Borna Simic (Electron. J. Comb., 2024)

Large cliques or cocliques in hypergraphs with forbidden order-size pairs. - Maria Axenovich; Domagoj Bradac; Lior Gishboliner; Dhruv Mubayi; Lea Weber (Comb. Probab. Comput., 2024)

The minimum degree removal lemma thresholds. - Lior Gishboliner; Zhihan Jin; Benny Sudakov (J. Comb. Theory B, 2024)

Testing versus estimation of graph properties, revisited. - Asaf Shapira; Nick Kushnir; Lior Gishboliner (Random Struct. Algorithms, 2024)

Trimming Forests Is Hard (Unless They Are Made of Stars). - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (SIAM J. Discret. Math., 2024)

On Ramsey Size-Linear Graphs and Related Questions. - Domagoj Bradac; Lior Gishboliner; Benny Sudakov (SIAM J. Discret. Math., 2024)

Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. - Lior Gishboliner; Zhihan Jin; Benny Sudakov (Comb., 2024)

Tight Hamilton cycles with high discrepancy. - Lior Gishboliner; Stefan Glock; Amedeo Sgueglia (Comb. Probab. Comput., 2025)

Canonical Ramsey Numbers of Sparse Graphs. - Lior Gishboliner; Aleksa Milojevic; Benny Sudakov; Yuval Wigderson (SIAM J. Discret. Math., 2025)

Hardness of Hypergraph Edge Modification Problems. - Lior Gishboliner; Yevgeny Levanzov; Asaf Shapira (CoRR, 2025)

Induced Subgraphs of Kr-Free Graphs and the Erdős-Rogers Problem. - Lior Gishboliner; Oliver Janzer; Benny Sudakov (Comb., 2025)