default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDániel Korándi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Carla Groenland
, Tom Johnston, Dániel Korándi, Alexander Roberts, Alex D. Scott, Jane Tan:
Decomposing Random Permutations into Order-Isomorphic Subpermutations. SIAM J. Discret. Math. 37(2): 1252-1261 (2023)- 2021
- [j16]Matija Bucic, Dániel Korándi, Benny Sudakov:
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41(3): 319-352 (2021) - [j15]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j14]Dániel Korándi, Richard Lang, Shoham Letzter, Alexey Pokrovskiy:
Minimum degree conditions for monochromatic cycle partitioning. J. Comb. Theory B 146: 96-123 (2021) - 2020
- [j13]Dániel Korándi, István Tomon:
Improved Ramsey-type results for comparability graphs. Comb. Probab. Comput. 29(5): 747-756 (2020) - [j12]Dániel Korándi, János Pach, István Tomon:
Large Homogeneous Submatrices. SIAM J. Discret. Math. 34(4): 2532-2552 (2020)
2010 – 2019
- 2019
- [j11]Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert:
On the Turán number of ordered forests. J. Comb. Theory A 165: 32-43 (2019) - 2018
- [j10]Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer:
On the Turán number of some ordered even cycles. Eur. J. Comb. 73: 81-88 (2018) - [j9]Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov:
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53(4): 667-691 (2018) - [j8]Dániel Korándi:
Rainbow Saturation and Graph Capacities. SIAM J. Discret. Math. 32(2): 1261-1264 (2018) - 2017
- [j7]Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert:
On the Turán number of ordered forests. Electron. Notes Discret. Math. 61: 773-779 (2017) - [j6]Dániel Korándi, Benny Sudakov:
Domination in 3-tournaments. J. Comb. Theory A 146: 165-168 (2017) - [j5]Dániel Korándi, Benny Sudakov:
Saturation in random graphs. Random Struct. Algorithms 51(1): 169-181 (2017) - 2016
- [j4]Dániel Korándi, Yuval Peled, Benny Sudakov:
A Random Triadic Process. SIAM J. Discret. Math. 30(1): 1-19 (2016) - 2015
- [j3]Dániel Korándi, Michael Krivelevich, Benny Sudakov:
Decomposing Random Graphs into Few Cycles and Edges. Comb. Probab. Comput. 24(6): 857-872 (2015) - [j2]Wenying Gan, Dániel Korándi, Benny Sudakov:
Ks, t-saturated bipartite graphs. Eur. J. Comb. 45: 12-20 (2015) - [j1]Dániel Korándi, Yuval Peled, Benny Sudakov:
A random triadic process. Electron. Notes Discret. Math. 49: 189-196 (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:29 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:
