default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLior Gishboliner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Lior Gishboliner
, Zhihan Jin, Benny Sudakov:
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. Comb. 44(3): 509-529 (2024)- [j24]Domagoj Bradac, Micha Christoph, Lior Gishboliner:
Minimum Degree Threshold for $H$-factors with High Discrepancy. Electron. J. Comb. 31(3) (2024) - [j23]Lior Gishboliner, Borna Simic:
Polynomial Removal Lemma for Ordered Matchings. Electron. J. Comb. 31(4) (2024) - [j22]Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber:
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Comb. Probab. Comput. 33(3): 286-299 (2024) - [j21]Lior Gishboliner, Zhihan Jin, Benny Sudakov:
The minimum degree removal lemma thresholds. J. Comb. Theory B 166: 203-221 (2024) - [j20]Domagoj Bradac, Lior Gishboliner, Benny Sudakov:
On Ramsey Size-Linear Graphs and Related Questions. SIAM J. Discret. Math. 38(1): 225-242 (2024) - 2023
- [j19]Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov:
Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. 43(3): 429-446 (2023) - [j18]Lior Gishboliner, Asaf Shapira:
On Rödl's Theorem for Cographs. Electron. J. Comb. 30(4) (2023) - [j17]Lior Gishboliner, Benny Sudakov:
Maximal chordal subgraphs. Comb. Probab. Comput. 32(5): 724-741 (2023) - [j16]David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
A new bound for the Brown-Erdős-Sós problem. J. Comb. Theory B 158(Part): 1-35 (2023) - [j15]Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
Oriented discrepancy of Hamilton cycles. J. Graph Theory 103(4): 780-792 (2023) - [j14]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. ACM Trans. Algorithms 19(1): 2:1-2:22 (2023) - [c8]Lior Gishboliner, Nick Kushnir, Asaf Shapira:
Testing Versus Estimation of Graph Properties, Revisited. APPROX/RANDOM 2023: 46:1-46:18 - [i16]Lior Gishboliner, Nick Kushnir, Asaf Shapira:
Testing versus estimation of graph properties, revisited. CoRR abs/2305.05487 (2023) - [i15]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Trimming forests is hard (unless they are made of stars). CoRR abs/2310.11277 (2023) - 2022
- [j13]Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Oriented Cycles in Digraphs of Large Outdegree. Comb. 42(6): 1145-1187 (2022) - [j12]Lior Gishboliner, István Tomon:
Polynomial removal lemmas for ordered graphs. Comb. Theory 2(3) (2022) - [j11]Lior Gishboliner:
A characterization of easily testable induced digraphs and k-colored graphs. Eur. J. Comb. 103: 103516 (2022) - [j10]Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. J. ACM 69(3): 23:1-23:21 (2022) - [j9]Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Dichromatic number and forced subdivisions. J. Comb. Theory B 153: 1-30 (2022) - [j8]Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
Discrepancies of spanning trees and Hamilton cycles. J. Comb. Theory B 154: 262-291 (2022) - [j7]Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
Color-biased Hamilton cycles in random graphs. Random Struct. Algorithms 60(3): 289-307 (2022) - [c7]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. SODA 2022: 417-430 - 2021
- [j6]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. Random Struct. Algorithms 58(3): 468-479 (2021) - 2020
- [j5]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57(4): 892-919 (2020) - [c6]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing Linear Inequalities of Subgraph Statistics. ITCS 2020: 43:1-43:9 - [c5]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA 2020: 718-737 - [i14]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. CoRR abs/2007.10390 (2020) - [i13]Lior Gishboliner:
Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties. CoRR abs/2009.12697 (2020) - [i12]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. CoRR abs/2010.05998 (2020) - [i11]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. CoRR abs/2011.05957 (2020) - [i10]Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i9]Lior Gishboliner, Asaf Shapira, Henrique Stagni:
Testing linear inequalities of subgraph statistics. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j4]Lior Gishboliner, Asaf Shapira:
Efficient Removal Without Efficient Regularity. Comb. 39(3): 639-658 (2019) - [j3]Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster:
The removal lemma for tournaments. J. Comb. Theory B 136: 110-134 (2019) - [j2]Malgorzata Bednarska-Bzdega, Omri Ben-Eliezer, Lior Gishboliner, Tuan Tran:
On the separation conjecture in Avoider-Enforcer games. J. Comb. Theory B 138: 41-77 (2019) - [c4]Lior Gishboliner, Asaf Shapira:
Testing graphs against an unknown distribution. STOC 2019: 535-546 - [i8]Lior Gishboliner, Asaf Shapira:
Testing Graphs against an Unknown Distribution. CoRR abs/1905.09903 (2019) - [i7]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR abs/1907.08031 (2019) - [i6]Lior Gishboliner, Asaf Shapira:
Testing Graphs against an Unknown Distribution. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j1]Lior Gishboliner, Michael Krivelevich, Gal Kronenberg:
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Random Struct. Algorithms 52(4): 545-559 (2018) - [c3]Lior Gishboliner, Asaf Shapira:
Efficient Testing without Efficient Regularity. ITCS 2018: 54:1-54:14 - [c2]Lior Gishboliner, Asaf Shapira:
A generalized Turán problem and its applications. STOC 2018: 760-772 - [i5]Noga Alon, Igor Balla, Lior Gishboliner, Adva Mond, Frank Mousset:
The Minrank of Random Graphs over Arbitrary Fields. CoRR abs/1809.01873 (2018) - [i4]Lior Gishboliner, Asaf Shapira:
A Generalized Turan Problem and its Applications. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c1]Lior Gishboliner, Asaf Shapira:
Removal lemmas with polynomial bounds. STOC 2017: 510-522 - [i3]Lior Gishboliner, Asaf Shapira:
A Generalized Turán Problem and its Applications. CoRR abs/1712.00831 (2017) - 2016
- [i2]Lior Gishboliner, Michael Krivelevich, Gal Kronenberg:
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. CoRR abs/1603.04044 (2016) - 2013
- [i1]Lior Gishboliner, Asaf Shapira:
Deterministic vs Non-deterministic Graph Property Testing. Electron. Colloquium Comput. Complex. TR13 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
