Daniela Kühn - RankMe

105 papers A* 4Journal 100Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A characterization of testable hypergraph properties. J. Comb. Theory B Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
2024	J	`jnl`	A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Comb. Probab. Comput. Tom Kelly, Daniela Kühn, Deryk Osthus
2024	J	`jnl`	Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. Comb. Dong Yeap Kang, Tom Kelly, Daniela Kühn, Deryk Osthus, Vincent Pfenninger
2023	J	`jnl`	Hypergraph regularity and random sampling. Random Struct. Algorithms Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
2022	J	`jnl`	Almost all optimally coloured complete graphs contain a rainbow Hamilton path. J. Comb. Theory B Stephen Gould, Tom Kelly, Daniela Kühn, Deryk Osthus
2021	A*	`conf`	A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. FOCS Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
2021	J	`jnl`	A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. CoRR Tom Kelly, Daniela Kühn, Deryk Osthus
2021	J	`jnl`	Counting Hamilton cycles in Dirac hypergraphs. Comb. Probab. Comput. Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus
2021	J	`jnl`	Decompositions into isomorphic rainbow spanning trees. J. Comb. Theory B Stefan Glock, Daniela Kühn, Richard Montgomery, Deryk Osthus
2021	J	`jnl`	Dirac's theorem for random regular graphs. Comb. Probab. Comput. Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus
2021	—	`conf`	Extremal aspects of graph and hypergraph decomposition problems. BCC Stefan Glock, Daniela Kühn, Deryk Osthus
2021	J	`jnl`	Graph and hypergraph colouring via nibble methods: A survey. CoRR Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
2021	A*	`conf`	Hamiltonicity of random subgraphs of the hypercube. SODA Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus
2021	J	`jnl`	Hypergraph regularity and random sampling. CoRR Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
2020	J	`jnl`	Euler Tours in Hypergraphs. Comb. Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus
2020	J	`jnl`	Minimalist designs. Random Struct. Algorithms Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
2020	J	`jnl`	On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. Comb. Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus
2020	J	`jnl`	Rainbow structures in locally bounded colorings of graphs. Random Struct. Algorithms Jaehoon Kim, Daniela Kühn, Andrey Kupavskii, Deryk Osthus
2019	J	`jnl`	Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing. SIAM J. Discret. Math. Alberto Espuny Díaz, Felix Joos, Daniela Kühn, Deryk Osthus
2019	J	`jnl`	On the decomposition threshold of a given graph. J. Comb. Theory B Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
2019	J	`jnl`	Resilient Degree Sequences with respect to Hamilton Cycles and Matchings in Random Graphs. Electron. J. Comb. Padraig Condon, Alberto Espuny Díaz, Daniela Kühn, Deryk Osthus, Jaehoon Kim
2018	J	`jnl`	Forbidding induced even cycles in a graph: Typical structure and counting. J. Comb. Theory B Jaehoon Kim, Daniela Kühn, Deryk Osthus, Timothy Townsend
2017	A*	`conf`	A Characterization of Testable Hypergraph Properties. FOCS Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
2017	J	`jnl`	A characterization of testable hypergraph properties. CoRR Felix Joos, Jaehoon Kim, Daniela Kühn, Deryk Osthus
2017	J	`jnl`	Clique decompositions of multipartite graphs and completion of Latin squares. J. Comb. Theory A Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus, Amelia Taylor
2017	J	`jnl`	Fractional clique decompositions of dense graphs and hypergraphs. J. Comb. Theory B Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus
2017	J	`jnl`	On the structure of oriented graphs and digraphs with forbidden tournaments or cycles. J. Comb. Theory B Daniela Kühn, Deryk Osthus, Timothy Townsend, Yi Zhao
2016	J	`jnl`	A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms Daniela Kühn, Deryk Osthus, Viresh Patel
2016	J	`jnl`	Bipartitions of Highly Connected Tournaments. SIAM J. Discret. Math. Jaehoon Kim, Daniela Kühn, Deryk Osthus
2016	J	`jnl`	On the Random Greedy F-Free Hypergraph Process. SIAM J. Discret. Math. Daniela Kühn, Deryk Osthus, Amelia Taylor
2016	J	`jnl`	Optimal path and cycle decompositions of dense quasirandom graphs. J. Comb. Theory B Stefan Glock, Daniela Kühn, Deryk Osthus
2016	J	`jnl`	Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. Comb. Daniela Kühn, Deryk Osthus, Timothy Townsend
2016	J	`jnl`	Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. J. Comb. Theory B Daniela Kühn, Allan Lo, Deryk Osthus, Katherine Staden
2015	J	`jnl`	Arbitrary Orientations of Hamilton Cycles in Digraphs. SIAM J. Discret. Math. Louis DeBiasio, Daniela Kühn, Theodore Molla, Deryk Osthus, Amelia Taylor
2015	J	`jnl`	Bipartitions of highly connected tournaments. Electron. Notes Discret. Math. Jaehoon Kim, Daniela Kühn, Deryk Osthus
2015	J	`jnl`	Edge-decompositions of graphs with high minimum degree. Electron. Notes Discret. Math. Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus
2015	J	`jnl`	Edge-disjoint Hamilton cycles in random graphs. Random Struct. Algorithms Fiachra Knox, Daniela Kühn, Deryk Osthus
2015	J	`jnl`	On the random greedy F-free hypergraph process. Electron. Notes Discret. Math. Daniela Kühn, Deryk Osthus, Amelia Taylor
2015	J	`jnl`	Optimal path and cycle decompositions of dense quasirandom graphs. Electron. Notes Discret. Math. Stefan Glock, Daniela Kühn, Deryk Osthus
2014	J	`jnl`	A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR Daniela Kühn, Deryk Osthus, Viresh Patel
2014	J	`jnl`	Decompositions of complete uniform hypergraphs into Hamilton Berge cycles. J. Comb. Theory A Daniela Kühn, Deryk Osthus
2014	J	`jnl`	Fractional and integer matchings in uniform hypergraphs. Eur. J. Comb. Daniela Kühn, Deryk Osthus, Timothy Townsend
2014	J	`jnl`	Hamilton decompositions of regular expanders: Applications. J. Comb. Theory B Daniela Kühn, Deryk Osthus
2014	J	`jnl`	Optimal covers with Hamilton cycles in random graphs. Comb. Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus
2013	J	`jnl`	Embedding cycles of given length in oriented graphs. Eur. J. Comb. Daniela Kühn, Deryk Osthus, Diana Piguet
2013	J	`jnl`	Matchings in 3-uniform hypergraphs. J. Comb. Theory B Daniela Kühn, Deryk Osthus, Andrew Treglown
2013	J	`jnl`	Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. Comb. Probab. Comput. Daniela Kühn, John Lapinskas, Deryk Osthus
2012	J	`jnl`	A survey on Hamilton cycles in directed graphs. Eur. J. Comb. Daniela Kühn, Deryk Osthus
2012	J	`jnl`	Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms Fiachra Knox, Daniela Kühn, Deryk Osthus
2012	J	`jnl`	Edge-disjoint Hamilton cycles in graphs. J. Comb. Theory B Demetres Christofides, Daniela Kühn, Deryk Osthus
2012	J	`jnl`	Finding Hamilton cycles in robustly expanding digraphs. J. Graph Algorithms Appl. Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
2012	J	`jnl`	Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments CoRR Daniela Kühn, Deryk Osthus
2012	J	`jnl`	On Pósa's Conjecture for Random Graphs. SIAM J. Discret. Math. Daniela Kühn, Deryk Osthus
2011	J	`jnl`	A proof of Sumner's universal tournament conjecture for large tournaments. Electron. Notes Discret. Math. Deryk Osthus, Daniela Kühn, Richard Mycroft
2011	J	`jnl`	An approximate version of Sumnerʼs universal tournament conjecture. J. Comb. Theory B Daniela Kühn, Richard Mycroft, Deryk Osthus
2011	J	`jnl`	Loose Hamilton cycles in hypergraphs. Discret. Math. Peter Keevash, Daniela Kühn, Richard Mycroft, Deryk Osthus
2011	J	`jnl`	Matchings in 3-uniform hypergraphs of large minimum vertex degree. Electron. Notes Discret. Math. Andrew Treglown, Daniela Kühn, Deryk Osthus
2010	J	`jnl`	A Semiexact Degree Condition for Hamilton Cycles in Digraphs. SIAM J. Discret. Math. Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus
2010	J	`jnl`	Cycles of given length in oriented graphs. J. Comb. Theory B Luke Kelly, Daniela Kühn, Deryk Osthus
2010	J	`jnl`	Hamilton J. Comb. Theory A Daniela Kühn, Richard Mycroft, Deryk Osthus
2010	J	`jnl`	Hamiltonian degree sequences in digraphs. J. Comb. Theory B Daniela Kühn, Deryk Osthus, Andrew Treglown
2009	J	`jnl`	An Ore-type Theorem for Perfect Packings in Graphs. SIAM J. Discret. Math. Daniela Kühn, Deryk Osthus, Andrew Treglown
2009	J	`jnl`	Degree sequences forcing Hamilton cycles in directed graphs. Electron. Notes Discret. Math. Daniela Kühn, Deryk Osthus, Andrew Treglown
2009	J	`jnl`	Embeddings and Ramsey numbers of sparse Comb. Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
2009	J	`jnl`	Minors in random regular graphs. Random Struct. Algorithms Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
2009	J	`jnl`	Short cycles in oriented graphs. Electron. Notes Discret. Math. Deryk Osthus, Luke Kelly, Daniela Kühn
2009	J	`jnl`	The minimum degree threshold for perfect graph packings. Comb. Daniela Kühn, Deryk Osthus
2008	J	`jnl`	3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory B Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
2008	J	`jnl`	A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. Comb. Probab. Comput. Luke Kelly, Daniela Kühn, Deryk Osthus
2008	J	`jnl`	A note on complete subdivisions in digraphs of large outdegree. J. Graph Theory Daniela Kühn, Deryk Osthus, Andrew Young
2008	J	`jnl`	Linkedness and Ordered Cycles in Digraphs. Comb. Probab. Comput. Daniela Kühn, Deryk Osthus
2008	J	`jnl`	The order of the largest complete minor in a random graph. Random Struct. Algorithms Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
2008	J	`jnl`	k-Ordered Hamilton cycles in digraphs. J. Comb. Theory B Daniela Kühn, Deryk Osthus, Andrew Young
2007	J	`jnl`	A minimum degree condition forcing a digraph to be k-linked. Electron. Notes Discret. Math. Deryk Osthus, Daniela Kühn
2007	J	`jnl`	Maximizing Several Cuts Simultaneously. Comb. Probab. Comput. Daniela Kühn, Deryk Osthus
2007	J	`jnl`	Perfect packings with complete graphs minus an edge. Eur. J. Comb. Oliver Cooley, Daniela Kühn, Deryk Osthus
2007	J	`jnl`	Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus
2007	J	`jnl`	The order of the largest complete minor in a random graph. Electron. Notes Discret. Math. Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
2006	A*	`conf`	Critical chromatic number and the complexity of perfect packings in graphs. SODA Daniela Kühn, Deryk Osthus
2006	J	`jnl`	Extremal connectivity for topological cliques in bipartite graphs. J. Comb. Theory B Daniela Kühn, Deryk Osthus
2006	J	`jnl`	Improved Bounds for Topological Cliques in Graphs of Large Girth. SIAM J. Discret. Math. Daniela Kühn, Deryk Osthus
2006	J	`jnl`	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Comb. Theory B Daniela Kühn, Deryk Osthus
2006	J	`jnl`	Matchings in hypergraphs of large minimum degree. J. Graph Theory Daniela Kühn, Deryk Osthus
2006	J	`jnl`	Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. SIAM J. Discret. Math. Daniela Kühn, Deryk Osthus
2005	J	`jnl`	Forcing unbalanced complete bipartite minors. Eur. J. Comb. Daniela Kühn, Deryk Osthus
2005	J	`jnl`	Four-cycles in graphs without a given even cycle. J. Graph Theory Daniela Kühn, Deryk Osthus
2005	J	`jnl`	Graph minor hierarchies. Discret. Appl. Math. Reinhard Diestel, Daniela Kühn
2005	J	`jnl`	Large planar subgraphs in dense graphs. J. Comb. Theory B Daniela Kühn, Deryk Osthus, Anusch Taraz
2005	J	`jnl`	Packings in Dense Regular Graphs. Comb. Probab. Comput. Daniela Kühn, Deryk Osthus
2005	J	`jnl`	Spanning triangulations in graphs. J. Graph Theory Daniela Kühn, Deryk Osthus
2004	J	`jnl`	Complete Minors In K Comb. Daniela Kühn, Deryk Osthus
2004	J	`jnl`	Every Graph of Sufficiently Large Average Degree Contains a C Comb. Daniela Kühn, Deryk Osthus
2004	J	`jnl`	Induced Subdivisions In K Comb. Daniela Kühn, Deryk Osthus
2004	J	`jnl`	Large Topological Cliques in Graphs Without a 4-Cycle. Comb. Probab. Comput. Daniela Kühn, Deryk Osthus
2004	J	`jnl`	On Infinite Cycles I. Comb. Reinhard Diestel, Daniela Kühn
2004	J	`jnl`	On Infinite Cycles II. Comb. Reinhard Diestel, Daniela Kühn
2004	J	`jnl`	Subdivisions of K Comb. Probab. Comput. Daniela Kühn, Deryk Osthus
2004	J	`jnl`	Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. Reinhard Diestel, Daniela Kühn
2003	J	`jnl`	Graph-theoretical versus topological ends of graphs. J. Comb. Theory B Reinhard Diestel, Daniela Kühn
2003	J	`jnl`	Minors in graphs of large girth. Random Struct. Algorithms Daniela Kühn, Deryk Osthus
2003	J	`jnl`	Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory B Daniela Kühn, Deryk Osthus
2002	J	`jnl`	Forcing a J. Graph Theory Daniela Kühn
2002	J	`jnl`	Topological Minors in Graphs of Large Girth. J. Comb. Theory B Daniela Kühn, Deryk Osthus
2001	J	`jnl`	Minor-universal planar graphs without accumulation points. J. Graph Theory Daniela Kühn
1999	J	`jnl`	A universal planar graph under the minor relation. J. Graph Theory Reinhard Diestel, Daniela Kühn