1. Abatangelo, V.: A class of complete [(q + 8)/3]-arcs of PG(2,q), with q = 2 h and h ( ≥ 6) even. Ars Combin. 16, 103–111 (1983)
2. Ball, S.: On small complete arcs in a finite plane. Discrete Math. 174, 29–34 (1997)
3. Bartoli, D., Davydov, A., Faina, G., Kreshchuk, A., Marcugini, S., Pambianco, F.: Two types of upper bounds on the smallest size of a complete arc in the plane PG(2,q). In: Proceedings of 7th international workshop on optimal codes and related topics, OC2013, Albena, Bulgaria, pp. 19–25, http://www.moi.math.bas.bg/oc2013/a4 (2013)
4. Bartoli, D., Davydov, A.A., Faina, G., Kreshchuk, A.A., Marcugini, S., Pambianco, F.:Tables of sizes of small complete arcs in the plane PG(2,q), q ≤ 410009. arXiv:1312.2155v2 [math.CO] (2014)
5. Bartoli, D., Davydov, A.A., Faina, G., Kreshchuk, A.A., Marcugini, S., Pambianco, F.:Conjectural upper bounds on the smallest size of a complete arc in PG(2,q) based on an analysis of step-by-step greedy algorithms. In: Proceedings of the 14th international workshop on algebraic and combinatorial coding theory, ACCT2014, Svetlogosk, Russia, pp. 24–31, http://www.moi.math.bas.bg/acct2014/a4 (2014)