Nicola Pace, Ph.D. - Publications
Affiliations: | 2012 | Florida Atlantic University, Boca Raton, FL, United States |
Area:
Mathematics, Theoretical MathematicsYear | Citation | Score | |||
---|---|---|---|---|---|
2019 | Kiss G, Pace N, Sonnino A. On circular–linear one-factorizations of the complete graph Discrete Mathematics. 342: 111622. DOI: 10.1016/J.Disc.2019.111622 | 0.347 | |||
2019 | Pace N, Sonnino A. One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane Journal of Geometry. 110: 1-19. DOI: 10.1007/S00022-019-0470-6 | 0.331 | |||
2018 | Korchmáros G, Pace N, Sonnino A. One-factorisations of complete graphs arising from ovals in finite planes Journal of Combinatorial Theory, Series A. 160: 62-83. DOI: 10.1016/J.Jcta.2018.06.006 | 0.365 | |||
2018 | Pace N. One-Overlapped Factorizations of Non-abelian Groups Graphs and Combinatorics. 34: 1459-1467. DOI: 10.1007/S00373-018-1937-1 | 0.311 | |||
2017 | Pace N, Sonnino A. On linear codes admitting large automorphism groups Designs, Codes and Cryptography. 83: 115-143. DOI: 10.1007/S10623-016-0207-6 | 0.334 | |||
2015 | Korchmáros G, Nagy GP, Pace N. k-nets embedded in a projective plane over a field Combinatorica. 35: 63-74. DOI: 10.1007/S00493-011-3055-Z | 0.31 | |||
2014 | Pace N. New ternary linear codes from projectivity groups Discrete Mathematics. 331: 22-26. DOI: 10.1016/J.Disc.2014.04.027 | 0.316 | |||
2014 | Korchmáros G, Nagy GP, Pace N. 3-Nets realizing a group in a projective plane Journal of Algebraic Combinatorics. 39: 939-966. DOI: 10.1007/S10801-013-0474-5 | 0.357 | |||
2014 | Korchmáros G, Pace N. Coset intersection of irreducible plane cubics Designs, Codes and Cryptography. 72: 53-75. DOI: 10.1007/S10623-013-9806-7 | 0.315 | |||
2011 | Pace N. On the distribution of the elements of a finite group generated by covers Applicable Algebra in Engineering, Communications and Computing. 22: 367-373. DOI: 10.1007/S00200-011-0156-2 | 0.324 | |||
2010 | Korchmáros G, Pace N. Infinite family of large complete arcs in PG(2, qn), with q odd and n > 1 odd Designs, Codes and Cryptography. 55: 285-296. DOI: 10.1007/S10623-009-9343-6 | 0.326 | |||
Show low-probability matches. |