default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Dukes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j48]Coen del Valle
, Peter J. Dukes:
Balancing permuted copies of multigraphs and integer matrices. J. Comb. Theory A 198: 105756 (2023)- [j47]Peter Dukes, Jonathan A. Noel, Abel Romer:
Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three. SIAM J. Discret. Math. 37(3): 2088-2125 (2023) - [i2]Gabriel Crudele, Peter Dukes, Jonathan A. Noel:
Six Permutation Patterns Force Quasirandomness. CoRR abs/2303.04776 (2023) - 2022
- [j46]Flora C. Bowditch, Peter J. Dukes:
Local Balance in Graph Decompositions. Graphs Comb. 38(2): 27 (2022) - [j45]Peter J. Dukes, Joanna Niezen:
Constructions of Sarvate-Beam Group Divisible Designs. Graphs Comb. 38(4): 109 (2022) - [j44]Peter J. Dukes, Joanna Niezen:
Number Cubes with Consecutive Line Sums. Am. Math. Mon. 129(4): 336-343 (2022) - 2021
- [j43]Michael Bailey, Coen del Valle, Peter J. Dukes:
A lower bound on HMOLS with equal sized holes. Finite Fields Their Appl. 74: 101866 (2021) - 2020
- [j42]Peter J. Dukes, Kaoruko Iwasaki:
Incidence structures near configurations of type (n3). Ars Math. Contemp. 19(1): 17-23 (2020) - [j41]Sergey Bereg, Peter J. Dukes:
A lower bound on permutation codes of distance n-1. Des. Codes Cryptogr. 88(1): 63-72 (2020) - [j40]Peter J. Dukes, Daniel Horsley:
On the Minimum Degree Required for a Triangle Decomposition. SIAM J. Discret. Math. 34(1): 597-610 (2020) - [j39]Peter J. Dukes, Ferdinand Ihringer, Nathan Lindzey:
On the Algebraic Combinatorics of Injections and its Applications to Injection Codes. IEEE Trans. Inf. Theory 66(11): 6898-6907 (2020)
2010 – 2019
- 2019
- [j38]Coen del Valle, Peter J. Dukes:
Some new block designs of dimension three. Bull. ICA 87: 85-102 (2019) - [j37]Peter J. Dukes, Esther R. Lamken:
Constructions and uses of incomplete pairwise balanced designs. Des. Codes Cryptogr. 87(12): 2729-2751 (2019) - 2018
- [j36]Peter J. Dukes, Garret Flowers:
Configurations containing a given linear hypergraph. J. Graph Theory 87(3): 356-361 (2018) - 2017
- [j35]Peter J. Dukes, Alan C. H. Ling:
Relative Difference Sets Partitioned by Cosets. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j34]Peter J. Dukes, Alan C. H. Ling, Amanda Malloch:
Thickly-resolvable block designs. Australas. J Comb. 64: 379-391 (2016) - [j33]Peter J. Dukes, Esther R. Lamken, Alan C. H. Ling:
Resolvable Group Divisible Designs with Large Groups. Electron. J. Comb. 23(4): 4 (2016) - [j32]Peter J. Dukes, Tao Feng, Alan C. H. Ling:
Matching divisible designs with block size four. Discret. Math. 339(2): 790-799 (2016) - 2015
- [j31]Peter J. Dukes, Joanna Niezen:
Pairwise balanced designs of dimension three. Australas. J Comb. 61: 98-113 (2015) - [j30]Peter J. Dukes, Kseniya Garaschuk:
Threefold triple systems with nonsingular N2. Discret. Math. 338(6): 835-838 (2015) - [j29]Peter J. Dukes, Tao Feng, Alan C. H. Ling:
A finite embedding theorem for partial Steiner 3-designs. Finite Fields Their Appl. 33: 29-36 (2015) - [j28]Peter J. Dukes, Alan C. H. Ling:
Graph Divisible Designs and Packing Constructions. Graphs Comb. 31(6): 2181-2191 (2015) - [j27]Peter J. Dukes:
Generalized Laminar Families and Certain Forbidden Matrices. Order 32(3): 401-408 (2015) - 2014
- [j26]Peter Dukes, Lea Howard:
Group divisible designs in MOLS of order ten. Des. Codes Cryptogr. 71(2): 283-291 (2014) - [j25]Peter Dukes, Alan C. H. Ling:
Pairwise Balanced Designs with Prescribed Minimum Dimension. Discret. Comput. Geom. 51(2): 485-494 (2014) - [j24]Mathieu Bogaerts, Peter Dukes:
Semidefinite programming for permutation codes. Discret. Math. 326: 34-43 (2014) - [j23]Peter Dukes, Steve Lowdon, Gary MacGillivray:
Conditional Colourings with Given Template. Discret. Math. Theor. Comput. Sci. 16(3): 61-76 (2014) - 2013
- [j22]Peter Dukes, Jared Howell:
The Orthogonality Spectrum for Latin Squares of Different Orders. Graphs Comb. 29(1): 71-78 (2013) - 2012
- [j21]Peter Dukes, Jesse Short-Gershman:
A complete existence theory for Sarvate-Beam triple systems. Australas. J Comb. 54: 261-272 (2012) - [j20]Peter Dukes:
Coding with injections. Des. Codes Cryptogr. 65(3): 213-222 (2012) - [i1]Mathieu Bogaerts, Peter Dukes:
Semidefinite programming for permutation codes. CoRR abs/1212.1185 (2012) - 2010
- [j19]Peter Dukes, Peter Hegarty, Sarada Herke:
On the Possible Orders of a Basis for a Finite Cyclic Group. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j18]Peter Dukes, Eric Mendelsohn:
Quasi-embeddings and intersections of latin squares of different orders. Australas. J Comb. 43: 197-210 (2009) - [j17]Peter Dukes, Alan C. H. Ling:
Linear spaces with small generated subspaces. J. Comb. Theory A 116(2): 485-493 (2009) - 2008
- [j16]Peter Dukes, Alan C. H. Ling:
Note edge-colourings of K n, n with no long two-coloured cycles. Comb. 28(3): 373-378 (2008) - [j15]Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk:
Directed complete bipartite graph decompositions: Indirect constructions. Discret. Math. 308(2-3): 367-374 (2008) - [j14]Peter Dukes, Lea Howard:
Small maximally disjoint union-free families. Discret. Math. 308(18): 4272-4275 (2008) - 2007
- [j13]Peter Dukes, Gary MacGillivray, Kristen Parton:
Bounds on the achromatic number of partial triple systems. Contributions Discret. Math. 2(1) (2007) - [j12]Peter Dukes, Richard M. Wilson:
The cone condition and t-designs. Eur. J. Comb. 28(6): 1610-1625 (2007) - [j11]Peter Dukes, Violet R. Syrotiuk, Charles J. Colbourn:
Ternary Schedules for Energy-Limited Sensor Networks. IEEE Trans. Inf. Theory 53(8): 2791-2798 (2007) - 2006
- [j10]Peter Dukes:
Disjoint Partial Triple Systems of Different Orders. Ars Comb. 80 (2006) - [j9]Wensong Chu, Charles J. Colbourn, Peter Dukes:
On constant composition codes. Discret. Appl. Math. 154(6): 912-929 (2006) - [j8]Jeffrey H. Dinitz, Peter Dukes:
On the structure of uniform one-factorizations from starters in finite fields. Finite Fields Their Appl. 12(2): 283-300 (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) - [c1]Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk:
Topology-Transparent Schedules for Energy Limited Ad hoc Networks. PerCom Workshops 2006: 85-90 - 2005
- [j6]Jeffrey H. Dinitz, Peter Dukes, Douglas R. Stinson:
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. Electron. J. Comb. 12 (2005) - 2004
- [j5]Wensong Chu, Charles J. Colbourn, Peter Dukes:
Constructions for Permutation Codes in Powerline Communications. Des. Codes Cryptogr. 32(1-3): 51-64 (2004) - [j4]Peter Dukes, Alan C. H. Ling:
A combinatorial error bound for t-point-based sampling. Theor. Comput. Sci. 310(1-3): 479-488 (2004) - 2003
- [j3]Jeffrey H. Dinitz, Peter Dukes, Alan C. H. Ling:
Sets of three pairwise orthogonal Steiner triple systems. J. Comb. Theory A 101(1): 90-116 (2003) - 2002
- [j2]Peter Dukes:
Orthogonal 3-GDDs with four groups. Australas. J Comb. 26: 225-232 (2002) - [j1]Peter Dukes:
On opposite orthogonal Steiner triple systems of non-prime-power order. Discret. Math. 252(1-3): 215-218 (2002)
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 21:26 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:
