default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniela Kühn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j93]Dong Yeap Kang, Tom Kelly, Daniela Kühn, Deryk Osthus, Vincent Pfenninger:
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. Comb. 44(6): 1233-1266 (2024)- [j92]Tom Kelly
, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Comb. Probab. Comput. 33(2): 179-195 (2024) - 2023
- [j91]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Hypergraph regularity and random sampling. Random Struct. Algorithms 62(4): 956-1015 (2023) - 2022
- [j90]Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus:
Almost all optimally coloured complete graphs contain a rainbow Hamilton path. J. Comb. Theory B 156: 57-100 (2022) - 2021
- [j89]Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus:
Dirac's theorem for random regular graphs. Comb. Probab. Comput. 30(1): 17-36 (2021) - [j88]Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus:
Counting Hamilton cycles in Dirac hypergraphs. Comb. Probab. Comput. 30(4): 631-653 (2021) - [j87]Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus:
Decompositions into isomorphic rainbow spanning trees. J. Comb. Theory B 146: 439-484 (2021) - [c5]Stefan Glock, Daniela Kühn, Deryk Osthus:
Extremal aspects of graph and hypergraph decomposition problems. BCC 2021: 235-266 - [c4]Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus:
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS 2021: 1080-1089 - [c3]Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus:
Hamiltonicity of random subgraphs of the hypercube. SODA 2021: 889-898 - [i6]Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus:
Graph and hypergraph colouring via nibble methods: A survey. CoRR abs/2106.13733 (2021) - [i5]Tom Kelly, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. CoRR abs/2109.11438 (2021) - [i4]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Hypergraph regularity and random sampling. CoRR abs/2110.01570 (2021) - 2020
- [j86]Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus:
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. Comb. 40(3): 363-403 (2020) - [j85]Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus:
Euler Tours in Hypergraphs. Comb. 40(5): 679-690 (2020) - [j84]Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus:
Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms 56(4): 1171-1204 (2020) - [j83]Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
Minimalist designs. Random Struct. Algorithms 57(1): 47-63 (2020)
2010 – 2019
- 2019
- [j82]Padraig Condon, Alberto Espuny Díaz, Daniela Kühn, Deryk Osthus, Jaehoon Kim:
Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs. Electron. J. Comb. 26(4): 4 (2019) - [j81]Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
On the decomposition threshold of a given graph. J. Comb. Theory B 139: 47-127 (2019) - [j80]Alberto Espuny Díaz, Felix Joos, Daniela Kühn, Deryk Osthus:
Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing. SIAM J. Discret. Math. 33(4): 1837-1863 (2019) - 2018
- [j79]Jaehoon Kim, Daniela Kühn, Deryk Osthus, Timothy Townsend:
Forbidding induced even cycles in a graph: Typical structure and counting. J. Comb. Theory B 131: 170-219 (2018) - 2017
- [j78]Daniela Kühn, Deryk Osthus, Timothy Townsend, Yi Zhao:
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. J. Comb. Theory B 124: 88-127 (2017) - [j77]Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
Fractional clique decompositions of dense graphs and hypergraphs. J. Comb. Theory B 127: 148-186 (2017) - [j76]Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus, Amelia Taylor:
Clique decompositions of multipartite graphs and completion of Latin squares. J. Comb. Theory A 151: 146-201 (2017) - [c2]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
A Characterization of Testable Hypergraph Properties. FOCS 2017: 859-867 - [i3]Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus:
A characterization of testable hypergraph properties. CoRR abs/1707.03303 (2017) - 2016
- [j75]Daniela Kühn, Deryk Osthus, Timothy Townsend:
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Comb. 36(4): 451-469 (2016) - [j74]Stefan Glock, Daniela Kühn, Deryk Osthus:
Optimal path and cycle decompositions of dense quasirandom graphs. J. Comb. Theory B 118: 88-108 (2016) - [j73]Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden:
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. J. Comb. Theory B 121: 85-145 (2016) - [j72]Daniela Kühn, Deryk Osthus, Viresh Patel:
A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms 48(3): 427-453 (2016) - [j71]Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Bipartitions of Highly Connected Tournaments. SIAM J. Discret. Math. 30(2): 895-911 (2016) - [j70]Daniela Kühn, Deryk Osthus, Amelia Taylor:
On the Random Greedy F-Free Hypergraph Process. SIAM J. Discret. Math. 30(3): 1343-1350 (2016) - 2015
- [j69]Stefan Glock, Daniela Kühn, Deryk Osthus:
Optimal path and cycle decompositions of dense quasirandom graphs. Electron. Notes Discret. Math. 49: 65-72 (2015) - [j68]Daniela Kühn, Deryk Osthus, Amelia Taylor:
On the random greedy F-free hypergraph process. Electron. Notes Discret. Math. 49: 73-77 (2015) - [j67]Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Bipartitions of highly connected tournaments. Electron. Notes Discret. Math. 49: 79-84 (2015) - [j66]Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus:
Edge-decompositions of graphs with high minimum degree. Electron. Notes Discret. Math. 49: 115-121 (2015) - [j65]Fiachra Knox, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithms 46(3): 397-445 (2015) - [j64]Louis DeBiasio, Daniela Kühn, Theodore Molla, Deryk Osthus, Amelia Taylor:
Arbitrary Orientations of Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 29(3): 1553-1584 (2015) - 2014
- [j63]Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus:
Optimal covers with Hamilton cycles in random graphs. Comb. 34(5): 573-596 (2014) - [j62]Daniela Kühn, Deryk Osthus, Timothy Townsend:
Fractional and integer matchings in uniform hypergraphs. Eur. J. Comb. 38: 83-96 (2014) - [j61]Daniela Kühn, Deryk Osthus:
Hamilton decompositions of regular expanders: Applications. J. Comb. Theory B 104: 1-27 (2014) - [j60]Daniela Kühn, Deryk Osthus:
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles. J. Comb. Theory A 126: 128-135 (2014) - [i2]Daniela Kühn, Deryk Osthus, Viresh Patel:
A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR abs/1401.4931 (2014) - 2013
- [j59]Daniela Kühn, John Lapinskas, Deryk Osthus:
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. Comb. Probab. Comput. 22(3): 394-416 (2013) - [j58]Daniela Kühn, Deryk Osthus, Diana Piguet:
Embedding cycles of given length in oriented graphs. Eur. J. Comb. 34(2): 495-501 (2013) - [j57]Daniela Kühn, Deryk Osthus, Andrew Treglown:
Matchings in 3-uniform hypergraphs. J. Comb. Theory B 103(2): 291-305 (2013) - 2012
- [j56]Daniela Kühn, Deryk Osthus:
A survey on Hamilton cycles in directed graphs. Eur. J. Comb. 33(5): 750-766 (2012) - [j55]Demetres Christofides, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in graphs. J. Comb. Theory B 102(5): 1035-1060 (2012) - [j54]Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. 16(2): 335-358 (2012) - [j53]Fiachra Knox, Daniela Kühn, Deryk Osthus:
Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40(2): 133-149 (2012) - [j52]Daniela Kühn, Deryk Osthus:
On Pósa's Conjecture for Random Graphs. SIAM J. Discret. Math. 26(3): 1440-1457 (2012) - [i1]Daniela Kühn, Deryk Osthus:
Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments. CoRR abs/1202.6219 (2012) - 2011
- [j51]Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus:
Loose Hamilton cycles in hypergraphs. Discret. Math. 311(7): 544-559 (2011) - [j50]Deryk Osthus, Daniela Kühn, Richard Mycroft:
A proof of Sumner's universal tournament conjecture for large tournaments. Electron. Notes Discret. Math. 38: 687-692 (2011) - [j49]Andrew Treglown, Daniela Kühn, Deryk Osthus:
Matchings in 3-uniform hypergraphs of large minimum vertex degree. Electron. Notes Discret. Math. 38: 813-818 (2011) - [j48]Daniela Kühn, Richard Mycroft, Deryk Osthus:
An approximate version of Sumnerʼs universal tournament conjecture. J. Comb. Theory B 101(6): 415-447 (2011) - 2010
- [j47]Luke Kelly, Daniela Kühn, Deryk Osthus:
Cycles of given length in oriented graphs. J. Comb. Theory B 100(3): 251-264 (2010) - [j46]Daniela Kühn, Deryk Osthus, Andrew Treglown:
Hamiltonian degree sequences in digraphs. J. Comb. Theory B 100(4): 367-380 (2010) - [j45]Daniela Kühn, Richard Mycroft, Deryk Osthus:
Hamilton l-cycles in uniform hypergraphs. J. Comb. Theory A 117(7): 910-927 (2010) - [j44]Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discret. Math. 24(3): 709-756 (2010)
2000 – 2009
- 2009
- [j43]Daniela Kühn, Deryk Osthus:
The minimum degree threshold for perfect graph packings. Comb. 29(1): 65-107 (2009) - [j42]Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. Comb. 29(3): 263-297 (2009) - [j41]Daniela Kühn, Deryk Osthus, Andrew Treglown:
Degree sequences forcing Hamilton cycles in directed graphs. Electron. Notes Discret. Math. 34: 347-351 (2009) - [j40]Deryk Osthus, Luke Kelly, Daniela Kühn:
Short cycles in oriented graphs. Electron. Notes Discret. Math. 34: 369-373 (2009) - [j39]Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Minors in random regular graphs. Random Struct. Algorithms 35(4): 444-463 (2009) - [j38]Daniela Kühn, Deryk Osthus, Andrew Treglown:
An Ore-type Theorem for Perfect Packings in Graphs. SIAM J. Discret. Math. 23(3): 1335-1355 (2009) - 2008
- [j37]Daniela Kühn, Deryk Osthus:
Linkedness and Ordered Cycles in Digraphs. Comb. Probab. Comput. 17(3): 411-422 (2008) - [j36]Luke Kelly, Daniela Kühn, Deryk Osthus:
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. Comb. Probab. Comput. 17(5): 689-709 (2008) - [j35]Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory B 98(3): 484-505 (2008) - [j34]Daniela Kühn, Deryk Osthus, Andrew Young:
k-Ordered Hamilton cycles in digraphs. J. Comb. Theory B 98(6): 1165-1180 (2008) - [j33]Daniela Kühn, Deryk Osthus, Andrew Young:
A note on complete subdivisions in digraphs of large outdegree. J. Graph Theory 57(1): 1-6 (2008) - [j32]Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
The order of the largest complete minor in a random graph. Random Struct. Algorithms 33(2): 127-141 (2008) - 2007
- [j31]Daniela Kühn, Deryk Osthus:
Maximizing Several Cuts Simultaneously. Comb. Probab. Comput. 16(2): 277-283 (2007) - [j30]Oliver Cooley, Daniela Kühn, Deryk Osthus:
Perfect packings with complete graphs minus an edge. Eur. J. Comb. 28(8): 2143-2155 (2007) - [j29]Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus:
Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. 29: 29-33 (2007) - [j28]Deryk Osthus, Daniela Kühn:
A minimum degree condition forcing a digraph to be k-linked. Electron. Notes Discret. Math. 29: 35-39 (2007) - [j27]Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
The order of the largest complete minor in a random graph. Electron. Notes Discret. Math. 29: 141-146 (2007) - 2006
- [j26]Daniela Kühn, Deryk Osthus:
Extremal connectivity for topological cliques in bipartite graphs. J. Comb. Theory B 96(1): 73-99 (2006) - [j25]Daniela Kühn, Deryk Osthus:
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Comb. Theory B 96(6): 767-821 (2006) - [j24]Daniela Kühn, Deryk Osthus:
Matchings in hypergraphs of large minimum degree. J. Graph Theory 51(4): 269-280 (2006) - [j23]Daniela Kühn, Deryk Osthus:
Improved Bounds for Topological Cliques in Graphs of Large Girth. SIAM J. Discret. Math. 20(1): 62-78 (2006) - [j22]Daniela Kühn, Deryk Osthus:
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. SIAM J. Discret. Math. 20(2): 273-286 (2006) - [c1]Daniela Kühn, Deryk Osthus:
Critical chromatic number and the complexity of perfect packings in graphs. SODA 2006: 851-859 - 2005
- [j21]Daniela Kühn, Deryk Osthus:
Packings in Dense Regular Graphs. Comb. Probab. Comput. 14(3): 325-337 (2005) - [j20]Reinhard Diestel, Daniela Kühn:
Graph minor hierarchies. Discret. Appl. Math. 145(2): 167-182 (2005) - [j19]Daniela Kühn, Deryk Osthus:
Forcing unbalanced complete bipartite minors. Eur. J. Comb. 26(1): 75-81 (2005) - [j18]Daniela Kühn, Deryk Osthus, Anusch Taraz:
Large planar subgraphs in dense graphs. J. Comb. Theory B 95(2): 263-282 (2005) - [j17]Daniela Kühn, Deryk Osthus:
Four-cycles in graphs without a given even cycle. J. Graph Theory 48(2): 147-156 (2005) - [j16]Daniela Kühn, Deryk Osthus:
Spanning triangulations in graphs. J. Graph Theory 49(3): 205-233 (2005) - 2004
- [j15]Reinhard Diestel, Daniela Kühn:
On Infinite Cycles I. Comb. 24(1): 69-89 (2004) - [j14]Reinhard Diestel, Daniela Kühn:
On Infinite Cycles II. Comb. 24(1): 91-116 (2004) - [j13]Daniela Kühn, Deryk Osthus:
Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. Comb. 24(1): 155-162 (2004) - [j12]Daniela Kühn, Deryk Osthus:
Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. Comb. 24(2): 287-304 (2004) - [j11]Daniela Kühn, Deryk Osthus:
Complete Minors In Ks, s-Free Graphs. Comb. 25(1): 49-64 (2004) - [j10]Daniela Kühn, Deryk Osthus:
Large Topological Cliques in Graphs Without a 4-Cycle. Comb. Probab. Comput. 13(1): 93-102 (2004) - [j9]Daniela Kühn, Deryk Osthus:
Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. Comb. Probab. Comput. 13(3): 361-371 (2004) - [j8]Reinhard Diestel, Daniela Kühn:
Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. 25(6): 835-862 (2004) - 2003
- [j7]Reinhard Diestel, Daniela Kühn:
Graph-theoretical versus topological ends of graphs. J. Comb. Theory B 87(1): 197-206 (2003) - [j6]Daniela Kühn, Deryk Osthus:
Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory B 88(1): 29-43 (2003) - [j5]Daniela Kühn, Deryk Osthus:
Minors in graphs of large girth. Random Struct. Algorithms 22(2): 213-225 (2003) - 2002
- [j4]Daniela Kühn, Deryk Osthus:
Topological Minors in Graphs of Large Girth. J. Comb. Theory B 86(2): 364-380 (2002) - [j3]Daniela Kühn:
Forcing a Kr minor by high external connectivity. J. Graph Theory 39(4): 241-264 (2002) - 2001
- [j2]Daniela Kühn:
Minor-universal planar graphs without accumulation points. J. Graph Theory 36(1): 1-7 (2001)
1990 – 1999
- 1999
- [j1]Reinhard Diestel, Daniela Kühn:
A universal planar graph under the minor relation. J. Graph Theory 32(2): 191-206 (1999)
Coauthor Index
[j93] [j92] [j91] [j90] [j89] [j88] [j87] [c5] [c4] [c3] [i6] [i5] [i4] [j86] [j85] [j84] [j83] [j82] [j81] [j80] [j79] [j78] [j77] [j76] [c2] [i3] [j75] [j74] [j73] [j72] [j71] [j70] [j69] [j68] [j67] [j66] [j65] [j64] [j63] [j62] [j61] [j60] [i2] [j59] [j58] [j57] [j56] [j55] [j54] [j53] [j52] [i1] [j51] [j50] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [j42] [j41] [j40] [j39] [j38] [j37] [j36] [j35] [j34] [j33] [j32] [j31] [j30] [j29] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [c1] [j21] [j19] [j18] [j17] [j16] [j13] [j12] [j11] [j10] [j9] [j6] [j5] [j4]
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-09 22:15 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:
