A survey of frequent subgraph mining algorithms C Jiang, F Coenen, M Zito The Knowledge Engineering Review 28 (1), 75-105, 2013 | 468 | 2013 |
Text classification using graph mining-based feature extraction C Jiang, F Coenen, R Sanderson, M Zito Research and Development in Intelligent Systems XXVI, 2010 | 173 | 2010 |
On the complexity and accuracy of geographic profiling strategies B Snook, M Zito, C Bennell, PJ Taylor Journal of Quantitative Criminology 21, 1-26, 2005 | 171 | 2005 |
On the approximability of the maximum induced matching problem W Duckworth, DF Manlove, M Zito Journal of Discrete Algorithms 3 (1), 79-91, 2005 | 112 | 2005 |
Induced matchings in regular graphs and trees M Zito International Workshop on Graph-Theoretic Concepts in Computer Science, 89-101, 1999 | 69 | 1999 |
Lower bounds and algorithms for dominating sets in web graphs C Cooper, R Klasing, M Zito Internet Mathematics 2 (3), 275-300, 2005 | 65 | 2005 |
Frequent sub-graph mining on edge weighted graphs C Jiang, F Coenen, M Zito Data Warehousing and Knowledge Discovery: 12th International Conference …, 2010 | 62 | 2010 |
Randomised techniques in combinatorial algorithmics M Zito Department of Computer Science, 1999 | 48 | 1999 |
Spatial clustering and its effect on perceived clustering, numerosity, and dispersion M Bertamini, M Zito, NE Scott-Samuel, J Hulleman Attention, Perception, & Psychophysics 78, 1460-1471, 2016 | 36 | 2016 |
Realistic synthetic data for testing association rule mining algorithms for market basket databases C Cooper, M Zito Knowledge Discovery in Databases: PKDD 2007: 11th European Conference on …, 2007 | 34 | 2007 |
Small maximal matchings in random graphs M Zito Theoretical computer science 297 (1-3), 487-507, 2003 | 25 | 2003 |
Sparse hypercube 3-spanners W Duckworth, M Zito Discrete Applied Mathematics 103 (1-3), 289-295, 2000 | 25 | 2000 |
Greedy algorithms for minimisation problems in random regular graphs M Zito European Symposium on Algorithms, 524-536, 2001 | 24 | 2001 |
Linear time maximum induced matching algorithm for trees M Zito Nord. J. Comput. 7 (1), 58-, 2000 | 24 | 2000 |
Finding frequent subgraphs in longitudinal social network data using a weighted graph mining approach C Jiang, F Coenen, M Zito Advanced Data Mining and Applications: 6th International Conference, ADMA …, 2010 | 23 | 2010 |
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold A Restivo, SR Della Rocca, L Roversi, AC Kaporis, LM Kirousis, ... Theoretical Computer Science: 7th Italian Conference, ICTCS 2001 Torino …, 2001 | 21 | 2001 |
Maximum induced matchings of random cubic graphs W Duckworth, NC Wormald, M Zito Journal of Computational and Applied Mathematics 142 (1), 39-50, 2002 | 18 | 2002 |
Large independent sets in random regular graphs W Duckworth, M Zito Theoretical Computer Science 410 (50), 5236-5243, 2009 | 17 | 2009 |
Large 2-independent sets of regular graphs W Duckworth, M Zito Electronic Notes in Theoretical Computer Science 78, 223-235, 2003 | 16 | 2003 |
An improved upper bound on the non-3-colourability threshold PE Dunne, M Zito Information Processing Letters 65 (1), 17-23, 1998 | 16 | 1998 |