default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Danziger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Andrea C. Burgess, Peter Danziger, Adrián Pastine
, Tommaso Traetta:
Constructing uniform 2-factorizations via row-sum matrices: Solutions to the Hamilton-Waterloo problem. J. Comb. Theory A 201: 105803 (2024)- 2022
- [j30]Peter Danziger, Melissa A. Huggan, Rehan Malik, Trent G. Marbach:
Tic-Tac-Toe on an affine plane of order 4. Australas. J Comb. 82: 21-30 (2022) - [j29]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the Oberwolfach problem for single-flip 2-factors via graceful labelings. J. Comb. Theory A 189: 105611 (2022) - 2021
- [j28]Andrea C. Burgess, Peter Danziger, M. T. Javed:
Cycle Decompositions of Complete Digraphs. Electron. J. Comb. 28(1): 1 (2021) - 2020
- [j27]Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. Discret. Appl. Math. 285: 552-566 (2020)
2010 – 2019
- 2019
- [j26]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the generalized Oberwolfach problem. Ars Math. Contemp. 17(1): 67-78 (2019) - [j25]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
The Hamilton-Waterloo Problem with even cycle lengths. Discret. Math. 342(8): 2213-2222 (2019) - [i1]Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. CoRR abs/1910.14200 (2019) - 2018
- [j24]Peter Danziger, S. Park:
Orthogonally Resolvable Matching Designs. Discret. Math. 341(3): 701-704 (2018) - [j23]Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
On the Hamilton-Waterloo Problem with cycle lengths of distinct parities. Discret. Math. 341(6): 1636-1644 (2018) - 2017
- [j22]Saieed Akbari, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn:
Zero-sum flows for triple systems. Discret. Math. 340(3): 416-425 (2017) - [j21]Peter Danziger, Eric Mendelsohn, Tommaso Traetta:
On the existence of unparalleled even cycle systems. Eur. J. Comb. 59: 11-22 (2017) - 2016
- [j20]Darryn E. Bryant, Andrea C. Burgess, Peter Danziger:
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs. Electron. J. Comb. 23(2): 2 (2016) - [j19]R. Julian R. Abel, Robert F. Bailey, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn:
On generalized Howell designs with block size three. Des. Codes Cryptogr. 81(2): 365-391 (2016) - [j18]Marco Buratti, Peter Danziger:
A Cyclic Solution for an Infinite Class of Hamilton-Waterloo Problems. Graphs Comb. 32(2): 521-531 (2016) - 2015
- [j17]Darryn E. Bryant, Peter Danziger, William Pettersson:
Bipartite 2-Factorizations of Complete Multipartite Graphs. J. Graph Theory 78(4): 287-294 (2015) - 2014
- [j16]Peter Danziger, Daniel Horsley, Bridget S. Webb:
Resolvability of infinite designs. J. Comb. Theory A 123(1): 73-85 (2014) - 2012
- [j15]Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez:
Cover starters for covering arrays of strength two. Discret. Math. 312(5): 943-956 (2012) - 2011
- [j14]Peter Danziger, Ian M. Wanless, Bridget S. Webb:
Monogamous latin squares. J. Comb. Theory A 118(3): 796-807 (2011) - [j13]Darryn E. Bryant, Peter Danziger:
On bipartite 2-factorizations of kn - I and the Oberwolfach problem. J. Graph Theory 68(1): 22-37 (2011)
2000 – 2009
- 2009
- [j12]Peter Danziger, Eric Mendelsohn, Gaetano Quattrocchi:
Resolvable decompositions of λKn into the union of two 2-paths. Ars Comb. 93 (2009) - [j11]Jeffrey H. Dinitz, Alan C. H. Ling, Peter Danziger:
Maximum uniformly resolvable designs with block sizes 2 and 4. Discret. Math. 309(14): 4716-4721 (2009) - [j10]Peter Danziger, Salvatore Milici, Gaetano Quattrocchi:
Minimum embedding of a P4-design into a balanced incomplete block design of index lambda. Discret. Math. 309(14): 4861-4870 (2009) - [j9]Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering arrays avoiding forbidden edges. Theor. Comput. Sci. 410(52): 5403-5414 (2009) - 2008
- [j8]Peter Danziger, Chengmin Wang:
Resolvable modified group divisible designs with higher index. Australas. J Comb. 41: 37-44 (2008) - [c1]Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering Arrays Avoiding Forbidden Edges. COCOA 2008: 296-308 - 2006
- [j7]Peter Danziger, Peter Dukes, Terry S. Griggs, Eric Mendelsohn:
On the Intersection Problem for Steiner Triple Systems of Different Orders. Graphs Comb. 22(3): 311-329 (2006) - 2004
- [j6]Peter Danziger, Brett Stevens:
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs. Electron. J. Comb. 11(1) (2004) - [j5]Peter Danziger, Brett Stevens:
Class-Uniformly Resolvable Group Divisible Structures II: Frames. Electron. J. Comb. 11(1) (2004) - [j4]Peter Danziger, Eric Mendelsohn, Gaetano Quattrocchi:
On the chromatic index of path decompositions. Discret. Math. 284(1-3): 107-121 (2004) - 2003
- [j3]Peter Danziger, Eric Mendelsohn:
Bicolour graphs of Steiner triple systems. Discret. Math. 261(1-3): 157-176 (2003)
1990 – 1999
- 1998
- [j2]Peter Danziger, Mike J. Grannell, Terry S. Griggs, Alexander Rosa:
On the 2-parallel chromatic index of Steiner triple systems. Australas. J Comb. 17: 109-132 (1998) - 1997
- [j1]Peter Danziger:
Uniform Restricted Resolvable Designs with r = 3. Ars Comb. 46 (1997)
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:28 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:
