1) M. Atici, R. Crawford, And C. Ernst. Geodetic Number of 9-cage Graphs, 
Australasian Journal of Combinatorics, Volume 43(2009), pp 39-55.

2) M. Atici, Data Retrieval and Extremal Set, International Journal: Mathematical Manuscripts
(IJMM) Volume 1, Number 1(2007), pp 27-32.

3) M. Atici. (t,k)-Geodetic Set of a Graph. Ars Combinatoria 82 (2007), pp. 201-210.

4) M. Atici, R. Crawford, and C. Ernst. New Upper Bounds for the Integrity of Cubic Graphs.
International Journal of Computer Mathematics  Vol. 81, No.11, November 2004, pp.1341-1348.

5) M. Atici. On the Edge Geodetic Number of a Graph.  International Journal of Computer
Mathematics  80 (7) 2003), pp 853-861.

6)  M. Atici and A. Vince. Geodesics in graphs, an Extremel set problem, and Perfect Hash Families.
 Graphs and Combinatorics,   (18)(2002), 403-413.

7)  M. Atici. Computational Complexity of Geodetic Set.  International Journal of Computer
Mathematics 79(5)(2002), pp 587-591.

8)  M. Atici. Integrity of Regular Graphs and Integrity Graphs.  Journal of Combinatorial
Mathematics and Combinatorial Computing, Vol. 37 (2001) 27-42.

9) M. Atici. Information and Average Information Rates of the Graph Access Structure on Six Vertices.
 Turkish Journal of Electrical Engineering and Computer Sciences, Vol 8, Number 1(2000) 55-66.

10) M. Atici and A. Kirlangic. Counterexamples to the Theorems of Prisms and Ladders. Journal of
Combinatorial Mathematics and Combinatorial Computing, Vol 34 (2000) 119-127.

11) M. Atici, D. Stinson, and W. Wei. A New Practical Algorithm for the Construction of a Perfect Hash
Function. Journal of Combinatorial Mathematics and Combinatorial Computing, Vol 35(2000) 127-145.

12)  M. Atici. Small Hash Families,  Congressus Numerantium, Vol 139 (1999), 139-149.

13) M. Atici. Graph Operations and Their Geodetic Number,  Congressus Numerantium, Vol 141(1999), 95-110.

14) M. Atici, M. Magliveras, D. Stinson, and D. Wei. Some Recursive Constructions for Perfect Hash
Families.  Journal of Combinatorial Designs Vol. 4, No. 5(1996) 353-363.


CONFERENCE PAPERS and PRESENTATIONS


1) Complexity of Extremal Set, Kentucky Section Mathematical Association of America Annual Meeting.
March 31-April 1, 2006, Center College, Danville, KY.

2) New Upper Bound for Integrity of 3-regular Graphs. MIGHTY 41. September 24-25, 2005, Middle
Tennessee State University, Murfreesboro TN.

3) Integrity of 9-cage graphs. AMS sectional Conferences. March 18-19, 2005, Western Kentucky
University, Bowling Green, KY.

 4) Small Perfect Hash Families, 24-th Annual Mathematics Symposium, Department of Mathematics.
September 28-29, 2004, Western Kentucky University, Bowling Green, KY.

5) Integrity of Cubic Graphs. MIGHTY 36. September 19-20, 2003, Valparaiso University, Valparaiso IN.

6) Integrity of Regular Graphs. MIGHTY 35. September 27-28, 2002, Illinois Sate University,
Normal, IL.

 7) Graphs and Geodetic Numbers, Turkish Mathematical Society XI. National Mathematics Symposium.
September 7-11, 1998, Isparta Turkey.

8) Graph Operations and their Geodetic Numbers, Kolloquimuber Kombinatorik. November
13-14,  1998, Braunschweig Germany.

 9) Integrity of Regular Graphs and Integrity Graphs. Proceedings of the  Third Symposium on
Computer Networks  (1998) pp 231-240 (Preliminary version).

10) Universal Hashing and Multiple Authentication. Lecture Notes in Computer Science 1109
(1996) 16-30. (Advances in cryptology- CRYPTO'96).

11) Perfect Hash Families, R.C. Bose Memorial Conference. June 7-11, 1995, Colorado State University,
Forth Collins, Colorado.