Nicola Pace

According to our database, Nicola Pace authored at least 14 papers between 2010 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

On the existence of PD-sets: Algorithms arising from automorphism groups of codes.

Nicola Pace, Angelo Sonnino

Adv. Math. Commun., 2021

2020

One-Factorisations of Complete Graphs Constructed in Desarguesian Planes of Certain Odd Square Orders.

Nicola Pace, Angelo Sonnino

Electron. J. Comb., 2020

2019

On circular-linear one-factorizations of the complete graph.

György Kiss, Nicola Pace, Angelo Sonnino

Discret. Math., 2019

2018

One-factorisations of complete graphs arising from ovals in finite planes¹.

Gábor Korchmáros, Nicola Pace, Angelo Sonnino

J. Comb. Theory, Ser. A, 2018

One-Overlapped Factorizations of Non-abelian Groups.

Nicola Pace

Graphs Comb., 2018

2017

On linear codes admitting large automorphism groups.

Nicola Pace, Angelo Sonnino

Des. Codes Cryptogr., 2017

2016

Social media for clinical management of neurologic diseases: An HTA approach.

Emanuele Torri, Nicola Pace, Domenico Marco Bonifati, Giandomenico Nollo

Proceedings of the IEEE International Smart Cities Conference, 2016

2015

k-nets embedded in a projective plane over a field.

Gábor Korchmáros, Gábor Péter Nagy, Nicola Pace

Comb., 2015

2014

New ternary linear codes from projectivity groups.

Nicola Pace

Discret. Math., 2014

Coset intersection of irreducible plane cubics.

Gábor Korchmáros, Nicola Pace

Des. Codes Cryptogr., 2014

2013

On small 3-nets embedded in a projective plane over a field.

Gábor Péter Nagy, Nicola Pace

J. Comb. Theory, Ser. A, 2013

2012

Related decompositions and new constructions of the Higman-Sims and Hall-Janko graphs.

Emre Kolotoglu, Nicola Pace, Spyros S. Magliveras

Australas. J Comb., 2012

2011

On the distribution of the elements of a finite group generated by covers.

Nicola Pace

Appl. Algebra Eng. Commun. Comput., 2011

2010

Infinite family of large complete arcs in PG(2, <i>q</i>^<i>n</i>), with <i>q</i> odd and <i>n</i> > 1 odd.

Gábor Korchmáros, Nicola Pace

Des. Codes Cryptogr., 2010