Peter Danziger

444 total citations
35 papers, 221 citations indexed

About

Peter Danziger is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Peter Danziger has authored 35 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Electrical and Electronic Engineering, 21 papers in Artificial Intelligence and 18 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Peter Danziger's work include graph theory and CDMA systems (31 papers), Coding theory and cryptography (21 papers) and Finite Group Theory Research (15 papers). Peter Danziger is often cited by papers focused on graph theory and CDMA systems (31 papers), Coding theory and cryptography (21 papers) and Finite Group Theory Research (15 papers). Peter Danziger collaborates with scholars based in Canada, Italy and Australia. Peter Danziger's co-authors include Brett Stevens, Darryn Bryant, Eric Mendelsohn, Lucia Moura, Marco Buratti, Chengmin Wang, Yu Tang, Alan C. H. Ling, Jeffrey H. Dinitz and Ian M. Wanless and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Peter Danziger

29 papers receiving 215 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Peter Danziger Canada	9	185	113	99	36	35	35	221
D. Jungnickel Germany	3	207 1.1×	120 1.1×	193 1.9×	11 0.3×	44 1.3×	4	259
Steve Linton United Kingdom	7	24 0.1×	55 0.5×	54 0.5×	8 0.2×	47 1.3×	18	121
Anthony B. Evans United States	11	194 1.0×	146 1.3×	123 1.2×	82 2.3×	103 2.9×	36	297
Marlene J. Colbourn Canada	9	168 0.9×	73 0.6×	117 1.2×	16 0.4×	72 2.1×	14	216
Earl S. Kramer United States	11	306 1.7×	169 1.5×	244 2.5×	11 0.3×	51 1.5×	25	324
Carl Bracken Ireland	8	248 1.3×	50 0.4×	302 3.1×	28 0.8×	36 1.0×	17	310
Saad I. El‐Zanati United States	10	232 1.3×	125 1.1×	123 1.2×	27 0.8×	143 4.1×	59	280
Ko‐Wei Lih Taiwan	10	50 0.3×	110 1.0×	13 0.1×	63 1.8×	206 5.9×	24	260
Iliya Bouyukliev Bulgaria	10	217 1.2×	90 0.8×	259 2.6×	3 0.1×	54 1.5×	47	283
Horacio Tapia-Recillas Mexico	8	96 0.5×	58 0.5×	169 1.7×	25 0.7×	63 1.8×	25	187

Countries citing papers authored by Peter Danziger

Since Specialization

Citations

This map shows the geographic impact of Peter Danziger'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 Peter Danziger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Danziger more than expected).

Fields of papers citing papers by Peter Danziger

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter Danziger. 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 Peter Danziger. The network helps show where Peter Danziger may publish in the future.

Co-authorship network of co-authors of Peter Danziger

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Danziger. A scholar is included among the top collaborators of Peter Danziger 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 Peter Danziger. Peter Danziger 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

Danziger, Peter, et al.. (2019). The Hamilton–Waterloo Problem with even cycle lengths. Discrete Mathematics. 342(8). 2213–2222. 1 indexed citations

Danziger, Peter, et al.. (2019). On the generalized Oberwolfach problem. Ars Mathematica Contemporanea. 17(1). 67–78. 1 indexed citations

Danziger, Peter, et al.. (2018). On the Hamilton–Waterloo Problem with cycle lengths of distinct parities. Institutional Research Information System (Università degli Studi di Brescia). 2 indexed citations

Danziger, Peter, et al.. (2017). On the Hamilton–Waterloo problem with odd cycle lengths. Journal of Combinatorial Designs. 26(2). 51–83. 5 indexed citations

Akbari, Saieed, et al.. (2016). Zero-sum flows for triple systems. Discrete Mathematics. 340(3). 416–425.

Abel, R. Julian R., et al.. (2015). On generalized Howell designs with block size three. Designs Codes and Cryptography. 81(2). 365–391. 4 indexed citations

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

Danziger, Peter, et al.. (2012). Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit. Journal of Combinatorial Designs. 21(8). 311–341. 4 indexed citations

Colbourn, Charles J., et al.. (2011). Cover starters for covering arrays of strength two. Discrete Mathematics. 312(5). 943–956. 8 indexed citations

10.

Danziger, Peter, et al.. (2009). Resolvable decompositions of λK n into the union of two 2-paths.. Ars Combinatoria. 93. 1 indexed citations

11.

Danziger, Peter, Eric Mendelsohn, Lucia Moura, & Brett Stevens. (2009). Covering arrays avoiding forbidden edges. Theoretical Computer Science. 410(52). 5403–5414. 23 indexed citations

12.

Danziger, Peter & Chengmin Wang. (2008). Resolvable modified group divisible designs with higher index.. Australas. J Comb.. 41. 37–44.

13.

Dinitz, Jeffrey H., Alan C. H. Ling, & Peter Danziger. (2008). Maximum uniformly resolvable designs with block sizes 2 and 4. Discrete Mathematics. 309(14). 4716–4721. 13 indexed citations

14.

Danziger, Peter, Peter J. Dukes, Terry S. Griggs, & Eric Mendelsohn. (2006). On the Intersection Problem for Steiner Triple Systems of Different Orders. Graphs and Combinatorics. 22(3). 311–329.

15.

Wang, Chengmin, Yu Tang, & Peter Danziger. (2005). Resolvable modified group divisible designs with block size three. Journal of Combinatorial Designs. 15(1). 2–14. 14 indexed citations

16.

Danziger, Peter, et al.. (2004). On the chromatic index of path decompositions. Discrete Mathematics. 284(1-3). 107–121. 2 indexed citations

17.

Danziger, Peter & Brett Stevens. (2004). Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs. The Electronic Journal of Combinatorics. 11(1). 6 indexed citations

18.

Danziger, Peter & Brett Stevens. (2001). Class‐uniformly resolvable designs. Journal of Combinatorial Designs. 9(2). 79–99. 2 indexed citations

19.

Danziger, Peter, M. J. Grannell, Terry S. Griggs, & Alexander Rosa. (1998). On the 2-parallel chromatic index of Steiner triple systems.. Australas. J Comb.. 17. 109–132. 4 indexed citations

20.

Danziger, Peter. (1997). Uniform Restricted Resolvable Designs with r = 3.. Ars Combinatoria. 46. 6 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