Daniel Horsley

474 total citations
44 papers, 221 citations indexed

About

Daniel Horsley is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics. According to data from OpenAlex, Daniel Horsley has authored 44 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Electrical and Electronic Engineering, 18 papers in Discrete Mathematics and Combinatorics and 18 papers in Computational Theory and Mathematics. Recurrent topics in Daniel Horsley's work include graph theory and CDMA systems (33 papers), Limits and Structures in Graph Theory (13 papers) and Coding theory and cryptography (11 papers). Daniel Horsley is often cited by papers focused on graph theory and CDMA systems (33 papers), Limits and Structures in Graph Theory (13 papers) and Coding theory and cryptography (11 papers). Daniel Horsley collaborates with scholars based in Australia, United States and Canada. Daniel Horsley's co-authors include Darryn Bryant, Charles J. Colbourn, Yeow Meng Chee, Violet R. Syrotiuk, Chengmin Wang, Saieed Akbari, Xiaomiao Wang, Rakhi Singh, Peter Danziger and Brian Alspach and has published in prestigious journals such as IEEE Transactions on Communications, Theoretical Computer Science and Bulletin of the London Mathematical Society.

In The Last Decade

Daniel Horsley

37 papers receiving 196 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Daniel Horsley Australia	9	169	92	89	84	27	44	221
G.H. Norton United Kingdom	8	164 1.0×	47 0.5×	65 0.7×	156 1.9×	111 4.1×	28	249
Shudi Yang China	12	213 1.3×	61 0.7×	52 0.6×	321 3.8×	143 5.3×	28	358
L. Thiel Canada	5	134 0.8×	73 0.8×	57 0.6×	83 1.0×	17 0.6×	11	197
Attila Sali Hungary	9	104 0.6×	129 1.4×	82 0.9×	102 1.2×	38 1.4×	47	238
Luis Goddyn Canada	11	113 0.7×	171 1.9×	286 3.2×	30 0.4×	42 1.6×	30	372
Viresh Patel United Kingdom	10	94 0.6×	50 0.5×	121 1.4×	24 0.3×	39 1.4×	38	282
Jonathan F. Buss Canada	8	33 0.2×	48 0.5×	215 2.4×	96 1.1×	98 3.6×	20	314
Louay Bazzi Lebanon	7	95 0.6×	18 0.2×	83 0.9×	107 1.3×	120 4.4×	11	223
Charles Vanden Eynden United States	11	175 1.0×	98 1.1×	137 1.5×	113 1.3×	28 1.0×	55	305
Kevin Cattell Canada	8	47 0.3×	26 0.3×	172 1.9×	108 1.3×	41 1.5×	13	228

Countries citing papers authored by Daniel Horsley

Since Specialization

Citations

This map shows the geographic impact of Daniel Horsley's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Horsley with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Horsley more than expected).

Fields of papers citing papers by Daniel Horsley

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Horsley. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Horsley. The network helps show where Daniel Horsley may publish in the future.

Co-authorship network of co-authors of Daniel Horsley

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Horsley. A scholar is included among the top collaborators of Daniel Horsley based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel Horsley. Daniel Horsley is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Horsley, Daniel, et al.. (2023). Smaller Embeddings of Partial $k$-Star Decompositions. The Electronic Journal of Combinatorics. 30(1).

Horsley, Daniel, et al.. (2023). Minimising the total number of subsets and supersets. European Journal of Combinatorics. 118. 103882–103882. 1 indexed citations

Chen, Guangzhou, et al.. (2023). Exact values for some unbalanced Zarankiewicz numbers. Journal of Graph Theory. 106(1). 81–109.

Singh, Rakhi, et al.. (2019). SUE(s2)-optimal supersaturated designs. Statistics & Probability Letters. 158. 108673–108673.

Colbourn, Charles J., et al.. (2019). Distributing hash families with few rows. Theoretical Computer Science. 800. 31–41. 1 indexed citations

Horsley, Daniel & Rakhi Singh. (2017). New lower bounds for t‐coverings. Journal of Combinatorial Designs. 26(8). 369–386. 1 indexed citations

Das, Ashish, Daniel Horsley, & Rakhi Singh. (2017). Pseudo generalized Youden designs. Journal of Combinatorial Designs. 26(9). 439–454. 2 indexed citations

Horsley, Daniel, et al.. (2017). DecomposingKu+w−Kuinto cycles of prescribed lengths. Discrete Mathematics. 340(8). 1818–1843. 1 indexed citations

Colbourn, Charles J., Daniel Horsley, & Violet R. Syrotiuk. (2017). A hierarchical framework for recovery in compressive sensing. Discrete Applied Mathematics. 236. 96–107. 2 indexed citations

10.

Bryant, Darryn & Daniel Horsley. (2015). Steiner Triple Systems without Parallel Classes. SIAM Journal on Discrete Mathematics. 29(1). 693–696. 2 indexed citations

11.

Bryant, Darryn & Daniel Horsley. (2013). A second infinite family of Steiner triple systems without almost parallel classes. Journal of Combinatorial Theory Series A. 120(7). 1851–1854. 3 indexed citations

12.

Horsley, Daniel, et al.. (2013). On balanced incomplete block designs with specified weak chromatic number. Journal of Combinatorial Theory Series A. 123(1). 123–153. 1 indexed citations

13.

Danziger, Peter, et al.. (2013). Resolvability of infinite designs. Journal of Combinatorial Theory Series A. 123(1). 73–85. 3 indexed citations

14.

Bryant, Darryn, et al.. (2012). Cycle decompositions of complete graphs. arXiv (Cornell University). 4 indexed citations

15.

Colbourn, Charles J., Daniel Horsley, & Violet R. Syrotiuk. (2012). Strengthening hash families and compressive sensing. Journal of Discrete Algorithms. 16. 170–186. 3 indexed citations

16.

Horsley, Daniel, et al.. (2011). Existential closure of block intersection graphs of infinite designs having infinite block size. Journal of Combinatorial Designs. 19(4). 317–327. 2 indexed citations

17.

Horsley, Daniel. (2010). Maximum packings of the complete graph with uniform length cycles. Journal of Graph Theory. 68(1). 1–7. 4 indexed citations

18.

Horsley, Daniel, et al.. (2009). On cycle systems with specified weak chromatic number. Journal of Combinatorial Theory Series A. 117(8). 1195–1206. 1 indexed citations

19.

Bryant, Darryn & Daniel Horsley. (2008). Packing cycles in complete graphs. Journal of Combinatorial Theory Series B. 98(5). 1014–1037. 13 indexed citations

20.

Bryant, Darryn & Daniel Horsley. (2006). The Embedding Problem for Partial Steiner Triple Systems. Queensland's institutional digital repository (The University of Queensland). 33(2). 111–115. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact