C. Jiang, F. Coenen, R. Sanderson, M. Zito - Text classification using graph mining-based feature extraction. Knowledge-Based Systems (2010) 23(4), p.302--308.

W. Duckworth, M. Zito - Large independent sets in random regular graphs. Theoretical Computer Science (2009) 410(50), p.5236--5243.

A. R. McGrae, M. Zito - The block connectivity of random trees. The Electronic Journal of Combinatorics (2009) 16, #R8.

C. Cooper, M. Zito - An analysis of the size of the optimal dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. Discrete Applied Mathematics (2009) 157(9), p.2010--2014.

M. Beis, W. Duckworth, M. Zito - Packing Vertices and Edges in Random Regular Graphs. Random Structures and Algorithms (2008) 32(1), p.20--37.

A. C. Kaporis, L. M. Kirousis, Y. C. Stamatiou, M. Vamvakari, M. Zito - The Unsatisfiability Threshold Revisited. Discrete Applied Mathematics (2007) 155, p. 1525-1538.

C. Cooper, R. Klasing, M. Zito - Lower Bounds and Algorithms for Dominating sets in Web Graphs. Internet Mathematics (2005) 2(3), p.275--300.

B. Snook, M. Zito, C. Bennell, P. Taylor - On the complexity and accuracy of geographic profiling strategies. Journal of Quantitative Criminology (2005) 21(1), p. 1-26.

W. Duckworth, D. Manlove, M. Zito - On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms (2005) 3, p. 79-91.

A. Czumaj, L. Gasieniec, D. R. Gaur, R. Krishnamurti, W. Rytter, and M. Zito - On Polynomial-time Approximation Algorithms for the Variable Length Scheduling Problem. Theoretical Computer Science (2003) 302(1-3), p. 489-495.

M. Zito - Small maximal matchings in random graphs. Theoretical Computer Science (2003) 297(1-3), p. 487-507.

W. Duckworth, N. C. Wormald, M. Zito - A PTAS for the Sparsest 2-Spanner Problem in 4-Connected Planar Triangulations. Journal of Discrete Algorithms (2003) 1(1), p. 67-76.

M. Zito - An upper bound on the space complexity of random formulae in resolution. RAIRO - Theoretical Informatics and Applications (2002) 36(4), p. 329-340.

W. Duckworth, N. C. Wormald, M. Zito - Maximum Induced Matchings of Random Cubic Graphs. Journal of Computational and Applied Mathematics (2002) 142/1, p. 39-50.

A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons, P. Leng, W. Rytter, M. Zito - Efficient Web Searching Using Temporal Factors. Theoretical Computer Science (2001) 262/1-2, p. 569-582

W. Duckworth, P. E. Dunne, A. Gibbons, and M. Zito - Leafy Spanning Trees in Hypercubes. Applied Mathematics Letters (2001) 14/7, p. 801-804.

S. Caporaso, M. Zito, N. Galesi - A Predicative and Decidable Characterization of the Polynomial Classes of Languages. Theoretical Computer Science (2001) 250/1-2, p. 83-99.

P.E. Dunne, A. Gibbons, M. Zito - Complexity-Theoretic Models of Phase Transitions in Search Problems. Theoretical Computer Science (2000) 249/2, p. 243-263.

M. Zito - Linear Time Maximum Induced Matching Algorithm for Trees. Nordic Journal of Computing (2000) 7, p. 58-63

W. Duckworth, M. Zito - Sparse Hypercube 3-Spanners. Discrete Applied Mathematics (2000) 103/1-3, p. 289-295

S. Caporaso, M. Zito - On a Relation Between Uniform Coding and Problems of the Form DTIME(F) =? DSPACE(F). Acta Informatica (1998) 35:8 p. 665-672

P.E. Dunne, M. Zito - An Improved Upper Bound on the Non-3-Colourability Threshold. Information Processing Letters (1998) 65:1, p. 17-23

A. Alshukri, F. Coenen, M. Zito - Incremental Web-Site Boundary Detection Using Random Walks. In P. Perner editor, Machine Learning and Data Mining in Pattern Recognition; 7th International Conference, MLDM 2011, volume 6871 of Lecture Notes in Computer Science, pages 414--427. Springer Verlag, 2011.

C. Jiang, F. Coenen, and M. Zito - Finding frequent subgraphs in longitudinal social network data using a weighted graph mining approach. In L. Cao, J. Zhong, and Y. Feng, editors, Advanced Data Mining and Applications: 6th International Conference, ADMA 2010, volume 6440 of Lecture Notes in Computer Science, pages 405--416. Springer Verlag, 2010.

C. Jiang, F. Coenen, M. Zito - Frequent sub-graph mining on edge weighted graphs. In T. B. Pedersen, M. K. Mohania, and A. Min Tjoa, editors, Data Warehousing and Knowledge Discovery: 12th International Conference, DaWaK 2010, volume 6263 of Lecture Notes in Computer Science, pages 77--88. Springer-Verlag, 2010.

A. Alshukri, F. Coenen, M. Zito - Web-site boundary detection. In P. Perner, editor, Advances in Data Mining. Applications and Theoretical Aspects: 10th Industrial Conference, ICDM 2010, volume 6171 of Lecture Notes in Computer Science, pages 529--543. Springer-Verlag, 2010.

C. Jiang, F. Coenen, R. Sanderson, M. Zito - Text classification using graph mining-based feature extraction. In M. Bramer, R. Ellis, and M. Petridis editors, Research and Development in Intelligent Systems XXVI, Incorporating Applications and Innovations in Intelligent Systems XVII (2009), pages 21--34. Springer-Verlag, 2010.

C. Cooper, A. R. McGrae, M. Zito - Martingales on Trees and the Empire Chromatic Number of Random Trees . In M. Kutylowksi, W. Charatonik, and M. Gebala editors, Fundamentals of Computation Theory 17th International Symposium, FCT 2009, volume 5699 of Lecture Notes in Computer Science, pages 74--83. Springer Verlag, 2009.

A. R. McGrae, M. Zito - Colouring random empire trees. Presented at Mathematical Foundations of Computer Science 2008. (Presentation video). In E. Ochmanski, and J. Tyszkiewicz editors, Mathematical Foundations of Computer Science 2008 33rd International Symposium, MFCS 2008, volume 5162 of Lecture Notes in Computer Science, pages 515--526. Springer Verlag, 2008.

C. Cooper, M. Zito - Realistic synthetic data for testing association rule mining algorithms for market basket databases. ECML - PKDD 2007, Warsaw. (Poster and presentation video)

W. Duckworth, M. Zito - Uncover low degree vertices and minimise the mess: independent sets in random regular graphs . Mathematical Foundations of Computer Science 2007.

C. Cooper, M. Zito - Realistic synthetic data for rule mining. (Short presentation) IADIS European Conference on Data Mining 2007, Lisbon.

C. Cooper, M. Zito - Dominating sets of random recursive trees. ODSA 2006 - Conference on Optimal Discrete Structures and Algorithms'. Rostock. Published in Vol. 27 of the Electronic Notes in Discrete Mathematics pages 107-108

M. Beis, W. Duckworth, M. Zito - Large k-independent sets of Regular Graphs. Proceedings of GRACO 2005. Published in Vol 19 of the Electronic Notes in Discrete Mathematics pages 321--327.

M. Beis, W. Duckworth, M. Zito - Large k-Separated Matchings of Random Regular Graphs. Australasian Computer Science Conference, 2005.

C. Cooper, R. Klasing, M. Zito - Dominating sets in web graphs. In S. Leonardi, editor. Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, volume 3243 of Lecture Notes in Computer Science, pages 31--43. Springer-Verlag, 2004.

W. Duckworth, M. Zito - Large 2-Independent Sets of Regular Graphs. Computing: the Australasian Theory Symposium, 2003. Published in the Electronic Notes in Theoretical Computer Science, vol 78.

M. Beis, W. Duckworth, M. Zito - Packing edges in random regular graphs. In K. Diks, and W. Rytter, eds. Mathematical Foundations of Computer Science 2002, volume 2420 of Lecture Notes in Computer Science, pages 118-130. Springer-Verlag, 2002.

A. C. Kaporis, L. M. Kirousis, Y. C. Stamatiou, M. Vamvakari, M. Zito - Coupon collectors, q-binomial coefficients and the unsatisfiability threshold. VII Italian Conference on Theoretical Computer Science.

A. C. Kaporis, L. M. Kirousis, Y. C. Stamatiou, M. Vamvakari, M. Zito - The Unsatisfiability Threshold Revisited. Presented at LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001).

M. Zito - Greedy Algorithms for Minimisation Problems in Random Regular Graphs. In F. Meyer auf der Heide, editor. Algorithms - ESA 2001; 9th Annual European Symposium, volume 2161 of Lecture Notes in Computer Science, pages 524--536. Springer-Verlag, 2001.

W. Duckworth, N. C. Wormald, M. Zito - Maximum Induced Matchings of Random Cubic Graphs. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, editors, Computing and Combinatorics; 6th Annual International Conference, COCOON 2000 volume 1858 of Lecture Notes in Computer Science, pages 34-43. Springer-Verlag, 2000.

M. Zito - Small Maximal Matchings in Random Graphs. In G. H. Gonnet, D. Panario, and A. Viola, editors, LATIN 2000: Theoretical Informatics; 4th Latin American Symposium, volume 1776 of Lecture Notes in Computer Science, pages 18-27. Springer-Verlag, 2000.

P.E. Dunne, A. Gibbons, M. Zito - Algorithmic and Complexity Issues Concerning Phase-Transitions Phenomena in Combinatorial Problems. In R. Raman and J. Simpson, editors, Combinatorial Algorithms; Proceedings, Tenth Australiasian Workshop on Combinatorial Algorithms (AWOCA'99), pages 76-86. Curtin University Press, 1999.

W. Duckworth, N. C. Wormald, M. Zito - Approximation algorithms for finding sparse 2-spanners of 4-connected planar triangulations. In R. Raman and J. Simpson, editors, Combinatorial Algorithms; Proceedings, Tenth Australiasian Workshop on Combinatorial Algorithms (AWOCA'99), pages 63-75. Curtin University Press, 1999.

A. Czumaj, I. Finch, L. Gasieniec, A. Gibbons, P. Leng, W. Rytter, M. Zito - Efficient Web Searching Using Temporal Factors. In F. Dehne, A. Gupta, J. R. Sack, and R. Tamassia, editors, Algorithms and Data Structures; 6th International Workshop, WADS, volume 1663 of Lecture Notes in Computer Science, pages 294-305. Springer-Verlag, 1999.

M. Zito - Induced Matchings In Regular Graphs and Trees. In P. Widmayer, G. Neyer, and S. Eidenbenz, editors, Graph Theoretic Concepts in Computer Science; 25th International Workshop, WG'99, volume 1665 of Lecture Notes in Computer Science, pages 89-100. Springer-Verlag, 1999. (The APX-completeness proof for 4-regular graphs in the proceedings is faulty. Here is a copy of the paper with a fixed proof).

P.E. Dunne, A. Gibbons, M. Zito - On Complexity-Theoretic Models of Phase Transitions in Search Problems. Proceedings of the 9th Australasian Workshop on Combinatorial Algorithms July 27-30, 1998, Curtin University, Perth, Western Australia. Costas S. Iliopolous (editor), pp. 85-96.

S. Caporaso, M. Zito, N. Galesi, E. Covino - Syntactic Characterization in LISP of the Polynomial Complexity Classes and Hierarchy. In Algorithms and Complexity; Third Italian Conference, CIAC'97, volume 1203 of Lecture Notes in Computer Science, pages 61--73. Springer-Verlag, March 1997.

M. Zito, I. Pu, M. Amos, A. Gibbons - RNC Algorithms for the Uniform Generation of Combinatorial Structures. Proceedings of the 7th ACM-SIAM Annual Symposium on Discrete Algorithms - 1996.

L. M. Kirousis, Y. C. Stamatiou, M. Zito - The unsatisfiability threshold conjecture: the techniques behind upper bound improvements. In A.G. Percus, G. Istrate and C. Moore, eds., Computational Complexity and Statistical Physics (Oxford University Press, New York, 2006).

L. M. Kirousis, Y. C. Stamatiou, M. Zito - The unsatisfiability threshold conjecture: techniques behind upper bound improvements. Technical report DELIS TR-0096, 2004.

C. Cooper, R. Klasing, M. Zito - On-line Dominating Sets in Web Graphs. Technical report ULCS-03-019, Department of Computer Science, University of Liverpool, 2003.

M. Zito - An upper bound on the space complexity of random formulae in resolution. Report TR01-079. Electronic Colloquium on Computational Complexity, 2001.

W. Duckworth, D. Manlove, M. Zito - On the Approximability of the Maximum Induced Matching Problem. Technical Report no. TR-2000-56 of the Department of Computing Science of Glasgow University, April 2000.

P. E. Dunne, A. Gibbons, M. Zito - Towards Complexity-Theoretic Models of Phase-Transitions in Search Problems. Technical Report CTAG-98001. Department of Computer Science, University of Liver pool (UK).

M. Zito - Efficient and Fast RNC Algorithms for the Uniform Generation of Unlabelled Graphs. Technical Report CTAG-98002. Department of Computer Science, University of Liverpool (UK).

S. Caporaso, N. Galesi, M. Zito - Recursion Schemes in Lisp and Complexity Classes. Dipartimento di Informatica - Universita' di Bari (Italy) 1993.

A. McGrae, M. Zito - Colouring random empires in random trees. BCC 2007.

C. Cooper, M. Zito - Dominating sets of random recursive trees. Electronic Notes in Discrete Mathematics 27, p. 1-110 (2006). ODSA 2006 - Conference on Optimal Discrete Structures and Algorithms Rostock (Germany) 04-06 September 2006.

C. Cooper, R. Klasing, M. Zito - Lower bounds for dominating sets in web graphs. Presented at the 22nd British Colloquium on Theoretical Computer Science - 2006

W. Duckworth, D. Manlove, M. Zito - Approximability Results for Induced Matchings in Graphs. Presented at 20th British Colloquium on Theoretical Computer Science - 2004

M. Beis, W. Duckworth, M. Zito - Algorithms for k-separated matchings in random graphs. Presented at 19th British Colloquium on Theoretical Computer Science - 2003

C. Cooper, M. Zito - Keeping everybody under control: domination in web graphs. Presented at 19th British Colloquium on Theoretical Computer Science - 2003

M. Beis, W. Duckworth, M. Zito - Large k-Independent Sets of Regular Graphs. Presented at the 27th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, (ACCMCC 2002), Newcastle, Australia, December 2002.

M. Zito - A Remark on the Space Complexity of Random Formulae in Resolution. Presented at 17th British Colloquium on Theoretical Computer Science - 2001

P. E. Dunne, A. Gibbons, M. Zito - Towards Complexity-Theoretic Models of Phase Transitions in Search Problems. Presented at 14th British Colloquium on Theoretical Computer Science - 1998

P. Dunne, M. Zito - On the 3-Colourability Threshold. Presented at 13th British Colloquium on Theoretical Computer Science - 1997.

M. Zito, I. Pu, A. Gibbons - Uniform Parallel Generation of Combinatorial Structures. Presented at 11th British Colloquium on Theoretical Computer Science - 1995.

I. Pu, M. Zito, M. Amos, A. Gibbons - RNC Algorithms for the Uniform Generations of Paths and Trees in Graphs. Presented at 11th British Colloquium on Theoretical Computer Science - 1995.

Routing on Optical Parallel Computers. (Master thesis) Department of Computer Science - University of Edinburgh. September 1993.

Rappresentazione delle Funzioni Ricorsive Primitive Mediante Formule Atomiche. (Tesi di Laurea) Istituto di Scienze dell'Informazione, Universita' di Bari. March 1991.