Infinite family of large complete arcs in PG(2, qn), with q odd and n > 1 odd. - Gábor Korchmáros; Nicola Pace (Des. Codes Cryptogr., 2010)

On the distribution of the elements of a finite group generated by covers. - Nicola Pace (Appl. Algebra Eng. Commun. Comput., 2011)

Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs. - Emre Kolotoglu; Nicola Pace; Spyros S. Magliveras (Australas. J Comb., 2012)

On small 3-nets embedded in a projective plane over a field. - Gábor Péter Nagy; Nicola Pace (J. Comb. Theory A, 2013)

Coset intersection of irreducible plane cubics. - Gábor Korchmáros; Nicola Pace (Des. Codes Cryptogr., 2014)

New ternary linear codes from projectivity groups. - Nicola Pace (Discret. Math., 2014)

k-nets embedded in a projective plane over a field. - Gábor Korchmáros; Gábor Péter Nagy; Nicola Pace (Comb., 2015)

Social media for clinical management of neurologic diseases: An HTA approach. - Emanuele Torri; Nicola Pace; Domenico Marco Bonifati; Giandomenico Nollo (ISC2, 2016)

On linear codes admitting large automorphism groups. - Nicola Pace; Angelo Sonnino (Des. Codes Cryptogr., 2017)

One-Overlapped Factorizations of Non-abelian Groups. - Nicola Pace (Graphs Comb., 2018)

One-factorisations of complete graphs arising from ovals in finite planes1. - Gábor Korchmáros; Nicola Pace; Angelo Sonnino (J. Comb. Theory A, 2018)

On circular-linear one-factorizations of the complete graph. - György Kiss; Nicola Pace; Angelo Sonnino (Discret. Math., 2019)

One-Factorisations of Complete Graphs Constructed in Desarguesian Planes of Certain Odd Square Orders. - Nicola Pace; Angelo Sonnino (Electron. J. Comb., 2020)

On the existence of PD-sets: Algorithms arising from automorphism groups of codes. - Nicola Pace; Angelo Sonnino (Adv. Math. Commun., 2021)