Lior Gishboliner

58 papers A* 5A 3Journal 50

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Disperse hypergraphs. Comb. Probab. Comput. Lior Gishboliner, Ethan Honest
2025	J	`jnl`	Canonical Ramsey Numbers of Sparse Graphs. SIAM J. Discret. Math. Lior Gishboliner, Aleksa Milojevic, Benny Sudakov, Yuval Wigderson
2025	J	`jnl`	Hardness of Hypergraph Edge Modification Problems. CoRR Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
2025	J	`jnl`	Induced Subgraphs of K Comb. Lior Gishboliner, Oliver Janzer, Benny Sudakov
2025	J	`jnl`	Polynomial Property Testing. CoRR Lior Gishboliner, Asaf Shapira
2025	J	`jnl`	Polynomial property testing. Comput. Sci. Rev. Lior Gishboliner, Asaf Shapira
2025	J	`jnl`	Tight Hamilton cycles with high discrepancy. Comb. Probab. Comput. Lior Gishboliner, Stefan Glock, Amedeo Sgueglia
2024	J	`jnl`	Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Comb. Probab. Comput. Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber
2024	J	`jnl`	Minimum Degree Threshold for $H$-factors with High Discrepancy. Electron. J. Comb. Domagoj Bradac, Micha Christoph, Lior Gishboliner
2024	J	`jnl`	On Ramsey Size-Linear Graphs and Related Questions. SIAM J. Discret. Math. Domagoj Bradac, Lior Gishboliner, Benny Sudakov
2024	J	`jnl`	Polynomial Removal Lemma for Ordered Matchings. Electron. J. Comb. Lior Gishboliner, Borna Simic
2024	J	`jnl`	Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. Comb. Lior Gishboliner, Zhihan Jin, Benny Sudakov
2024	J	`jnl`	Testing versus estimation of graph properties, revisited. Random Struct. Algorithms Asaf Shapira, Nick Kushnir, Lior Gishboliner
2024	J	`jnl`	The minimum degree removal lemma thresholds. J. Comb. Theory B Lior Gishboliner, Zhihan Jin, Benny Sudakov
2024	J	`jnl`	Trimming Forests Is Hard (Unless They Are Made of Stars). SIAM J. Discret. Math. Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
2023	J	`jnl`	A new bound for the Brown-Erdős-Sós problem. J. Comb. Theory B David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
2023	J	`jnl`	Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov
2023	J	`jnl`	Counting Homomorphic Cycles in Degenerate Graphs. ACM Trans. Algorithms Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2023	J	`jnl`	Maximal chordal subgraphs. Comb. Probab. Comput. Lior Gishboliner, Benny Sudakov
2023	J	`jnl`	On Rödl's Theorem for Cographs. Electron. J. Comb. Lior Gishboliner, Asaf Shapira
2023	J	`jnl`	Oriented discrepancy of Hamilton cycles. J. Graph Theory Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
2023	A	`conf`	Testing Versus Estimation of Graph Properties, Revisited. APPROX/RANDOM Lior Gishboliner, Nick Kushnir, Asaf Shapira
2023	J	`jnl`	Testing versus estimation of graph properties, revisited. CoRR Lior Gishboliner, Nick Kushnir, Asaf Shapira
2023	J	`jnl`	Trimming forests is hard (unless they are made of stars). CoRR Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
2022	J	`jnl`	A characterization of easily testable induced digraphs and k-colored graphs. Eur. J. Comb. Lior Gishboliner
2022	J	`jnl`	Color-biased Hamilton cycles in random graphs. Random Struct. Algorithms Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
2022	A*	`conf`	Counting Homomorphic Cycles in Degenerate Graphs. SODA Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2022	J	`jnl`	Counting Subgraphs in Degenerate Graphs. J. ACM Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira
2022	J	`jnl`	Dichromatic number and forced subdivisions. J. Comb. Theory B Lior Gishboliner, Raphael Steiner, Tibor Szabó
2022	J	`jnl`	Discrepancies of spanning trees and Hamilton cycles. J. Comb. Theory B Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
2022	J	`jnl`	Oriented Cycles in Digraphs of Large Outdegree. Comb. Lior Gishboliner, Raphael Steiner, Tibor Szabó
2022	J	`jnl`	Polynomial removal lemmas for ordered graphs. Comb. Theory Lior Gishboliner, István Tomon
2021	J	`jnl`	Testing linear inequalities of subgraph statistics. Random Struct. Algorithms Lior Gishboliner, Asaf Shapira, Henrique Stagni
2020	J	`jnl`	Counting Homomorphic Cycles in Degenerate Graphs. CoRR Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2020	J	`jnl`	Counting Subgraphs in Degenerate Graphs. CoRR Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
2020	J	`jnl`	Counting Subgraphs in Degenerate Graphs. Electron. Colloquium Comput. Complex. Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
2020	J	`jnl`	Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties. CoRR Lior Gishboliner
2020	A	`conf`	Testing Linear Inequalities of Subgraph Statistics. ITCS Lior Gishboliner, Asaf Shapira, Henrique Stagni
2020	J	`jnl`	Testing linear inequalities of subgraph statistics. CoRR Lior Gishboliner, Asaf Shapira, Henrique Stagni
2020	J	`jnl`	Testing linear inequalities of subgraph statistics. Electron. Colloquium Comput. Complex. Lior Gishboliner, Asaf Shapira, Henrique Stagni
2020	A*	`conf`	Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2020	J	`jnl`	Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2019	J	`jnl`	Efficient Removal Without Efficient Regularity. Comb. Lior Gishboliner, Asaf Shapira
2019	J	`jnl`	On the separation conjecture in Avoider-Enforcer games. J. Comb. Theory B Malgorzata Bednarska-Bzdega, Omri Ben-Eliezer, Lior Gishboliner, Tuan Tran
2019	J	`jnl`	Testing Graphs against an Unknown Distribution. CoRR Lior Gishboliner, Asaf Shapira
2019	J	`jnl`	Testing Graphs against an Unknown Distribution. Electron. Colloquium Comput. Complex. Lior Gishboliner, Asaf Shapira
2019	A*	`conf`	Testing graphs against an unknown distribution. STOC Lior Gishboliner, Asaf Shapira
2019	J	`jnl`	The removal lemma for tournaments. J. Comb. Theory B Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster
2019	J	`jnl`	Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2018	J	`jnl`	A Generalized Turan Problem and its Applications. Electron. Colloquium Comput. Complex. Lior Gishboliner, Asaf Shapira
2018	A*	`conf`	A generalized Turán problem and its applications. STOC Lior Gishboliner, Asaf Shapira
2018	A	`conf`	Efficient Testing without Efficient Regularity. ITCS Lior Gishboliner, Asaf Shapira
2018	J	`jnl`	On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Random Struct. Algorithms Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
2018	J	`jnl`	The Minrank of Random Graphs over Arbitrary Fields. CoRR Noga Alon, Igor Balla, Lior Gishboliner, Adva Mond, Frank Mousset
2017	J	`jnl`	A Generalized Turán Problem and its Applications. CoRR Lior Gishboliner, Asaf Shapira
2017	A*	`conf`	Removal lemmas with polynomial bounds. STOC Lior Gishboliner, Asaf Shapira
2016	J	`jnl`	On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. CoRR Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
2013	J	`jnl`	Deterministic vs Non-deterministic Graph Property Testing. Electron. Colloquium Comput. Complex. Lior Gishboliner, Asaf Shapira