default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGal Kronenberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Alberto Espuny Díaz
, Barnabás Janzer, Gal Kronenberg, Joanna Lada:
Long running times for hypergraph bootstrap percolation. Eur. J. Comb. 115: 103783 (2024)- 2023
- [j10]Gal Kronenberg, Adva Mond, Alon Naor:
\(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs. SIAM J. Discret. Math. 37(2): 864-916 (2023) - 2022
- [i3]António Girão, Gal Kronenberg, Alex Scott:
A multidimensional Ramsey Theorem. CoRR abs/2210.09227 (2022) - [i2]Tom Johnston, Gal Kronenberg, Alexander Roberts, Alex Scott:
Shotgun assembly of random graphs. CoRR abs/2211.14218 (2022) - 2021
- [j9]Gal Kronenberg, Taísa Martins, Natasha Morrison:
Weak saturation numbers of complete bipartite graphs in the clique. J. Comb. Theory A 178: 105357 (2021) - 2020
- [j8]Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic:
Semi-random graph process. Random Struct. Algorithms 56(3): 648-675 (2020)
2010 – 2019
- 2019
- [j7]Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran:
A note on the minimum number of edges in hypergraphs with property O. Eur. J. Comb. 81: 172-177 (2019) - [j6]Penny Haxell, Michael Krivelevich, Gal Kronenberg:
Goldberg's conjecture is true for random multigraphs. J. Comb. Theory B 138: 314-349 (2019) - 2018
- [j5]Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz, Zilin Jiang, Gal Kronenberg, Alon Naor:
Ramsey-nice families of graphs. Eur. J. Comb. 72: 29-44 (2018) - [j4]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) - 2017
- [j3]Asaf Ferber, Michael Krivelevich, Gal Kronenberg:
Efficient Winning Strategies in Random-Turn Maker-Breaker Games. J. Graph Theory 85(2): 446-465 (2017) - 2016
- [i1]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) - 2015
- [j2]Michael Krivelevich, Gal Kronenberg:
Random-Player Maker-Breaker games. Electron. J. Comb. 22(4): 4 (2015) - [j1]Asaf Ferber, Gal Kronenberg, Eoin Long:
Packing, Counting and Covering Hamilton cycles in random directed graphs. Electron. Notes Discret. Math. 49: 813-819 (2015)
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-06-10 20:30 CEST 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:
