Photo of Dr Michele Zito

Dr Michele Zito Ph.D.

Lecturer Computer Science

    Publications

    2019

    Dynamic Programming Optimization in Line of Sight Networks (Journal article)

    Sangha, P., Wong, P., & Zito, M. (n.d.). Dynamic Programming Optimization in Line of Sight Networks. Information and Computation. doi:10.1016/j.ic.2019.104460

    DOI: 10.1016/j.ic.2019.104460

    Independent sets in Line of Sight networks (Journal article)

    Sangha, P., & Zito, M. (2019). Independent sets in Line of Sight networks. Discrete Applied Mathematics. doi:10.1016/j.dam.2019.03.029

    DOI: 10.1016/j.dam.2019.03.029

    The Solitaire Illusion Generalises to Large Numerosities and Brief Presentation, but Not to Grouping Based Only on Proximity (Conference Paper)

    Bertamini, M., Guest, M., & Zito, M. (2019). The Solitaire Illusion Generalises to Large Numerosities and Brief Presentation, but Not to Grouping Based Only on Proximity. In PERCEPTION Vol. 48 (pp. 82). Retrieved from http://gateway.webofknowledge.com/

    2018

    Dynamic Programming Optimization in Line of Sight Networks (Journal article)

    Sangha, P., Wong, P. W. H., & Zito, M. (n.d.). Dynamic Programming Optimization in Line of Sight Networks. Retrieved from http://arxiv.org/abs/1806.01581v1

    2017

    Independent Sets in Restricted Line of Sight Networks (Conference Paper)

    Sangha, P., Wong, P. W., & Zito, M. (2017). Independent Sets in Restricted Line of Sight Networks. In The 13th International Symposium on Algorithms and Experiments for Wireless Networks.

    Easy knapsacks and the complexity of energy allocation problems in the smart grid (Journal article)

    Karaboghossian, T., & Zito, M. (2018). Easy knapsacks and the complexity of energy allocation problems in the smart grid. Optimization Letters, 12(7), 1553-1568. doi:10.1007/s11590-017-1209-7

    DOI: 10.1007/s11590-017-1209-7

    Finding Large Independent Sets in Line of Sight Networks (Conference Paper)

    Sangha, P., & Zito, M. (2017). Finding Large Independent Sets in Line of Sight Networks. In Unknown Conference (pp. 332-343). Springer International Publishing. doi:10.1007/978-3-319-53007-9_29

    DOI: 10.1007/978-3-319-53007-9_29

    2016

    Spatial clustering and its effect on perceived clustering, numerosity, and dispersion (Journal article)

    Bertamini, M., Zito, M., Scott-Samuel, N. E., & Hulleman, J. (2016). Spatial clustering and its effect on perceived clustering, numerosity, and dispersion. ATTENTION PERCEPTION & PSYCHOPHYSICS, 78(5), 1460-1471. doi:10.3758/s13414-016-1100-0

    DOI: 10.3758/s13414-016-1100-0

    Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid (Conference Paper)

    Arikiez, M., Grasso, F., Kowalski, D., Zito, M., & IEEE. (2016). Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid. In 2016 IEEE INTERNATIONAL ENERGY CONFERENCE (ENERGYCON). Retrieved from http://gateway.webofknowledge.com/

    2015

    The effect of proximity in numerosity judgements (Conference Paper)

    Zito, M., & Bertamini, M. (2015). The effect of proximity in numerosity judgements. In PERCEPTION Vol. 44 (pp. 229-230). Retrieved from http://gateway.webofknowledge.com/

    Heuristic Algorithm for Coordinating Smart Houses in MicroGrid (Conference Paper)

    Arikiez, M., Grasso, F., Zito, M., & IEEE. (2015). Heuristic Algorithm for Coordinating Smart Houses in MicroGrid. In 2015 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM) (pp. 49-54). Retrieved from http://gateway.webofknowledge.com/

    Heuristics for the Cost-Effective Management of a Temperature Controlled Environment (Conference Paper)

    Arikiez, M., Grasso, F., Zito, M., & IEEE. (2015). Heuristics for the Cost-Effective Management of a Temperature Controlled Environment. In 2015 IEEE INNOVATIVE SMART GRID TECHNOLOGIES - ASIA (ISGT ASIA). Retrieved from http://gateway.webofknowledge.com/

    2014

    Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs (Conference Paper)

    Yu, W., Coenen, F., Zito, M., & Dittakan, K. (2014). Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs. In 2014 IEEE International Conference on Data Mining Workshop. IEEE. doi:10.1109/icdmw.2014.125

    DOI: 10.1109/icdmw.2014.125

    The Complexity of the Empire Colouring Problem (Journal article)

    McGrae, A. R. A., & Zito, M. (2014). The Complexity of the Empire Colouring Problem. ALGORITHMICA, 68(2), 483-503. doi:10.1007/s00453-012-9680-0

    DOI: 10.1007/s00453-012-9680-0

    2013

    A survey of frequent subgraph mining algorithms (Journal article)

    Jiang, C., Coenen, F., & Zito, M. (2013). A survey of frequent subgraph mining algorithms. KNOWLEDGE ENGINEERING REVIEW, 28(1), 75-105. doi:10.1017/S0269888912000331

    DOI: 10.1017/S0269888912000331

    Minimal Vertex Unique Labelled Subgraph Mining (Conference Paper)

    Yu, W., Coenen, F., Zito, M., & El Salhi, S. (2013). Minimal Vertex Unique Labelled Subgraph Mining. In Unknown Conference (pp. 317-326). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40131-2_28

    DOI: 10.1007/978-3-642-40131-2_28

    Smart Domestic Renewable Energy Management Using Knapsack (Conference Paper)

    Arikiez, M. K., Gatens, P., Grasso, H., Zito, M., & IEEE. (2013). Smart Domestic Renewable Energy Management Using Knapsack. In 2013 4TH IEEE/PES INNOVATIVE SMART GRID TECHNOLOGIES EUROPE (ISGT EUROPE). Retrieved from http://gateway.webofknowledge.com/

    Smart domestic renewable energy management using knapsack (Conference Paper)

    Arikiez, M., Gatens, P., Zito, M., & Grasso, F. (2013). Smart domestic renewable energy management using knapsack. In Innovative Smart Grid Technologies Europe (ISGT EUROPE) (pp. 1-5). doi:10.1109/ISGTEurope.2013.6695345

    DOI: 10.1109/ISGTEurope.2013.6695345

    Vertex Unique Labelled Subgraph Mining (Conference Paper)

    Wen, Y., Coenen, F., Zito, M., & Salhi, S. (2013). Vertex Unique Labelled Subgraph Mining. In BCS-SGSI AI 20-13 (pp. TBA). Cambridge, UK: Springer.

    Vertex Unique Labelled Subgraph Mining for Vertex Label Classification (Conference Paper)

    Yu, W., Coenen, F., & Zito, M. (2013). Vertex Unique Labelled Subgraph Mining for Vertex Label Classification. In ADMA'13 (pp. TBA). Hangzhou, China: Springer.

    2012

    The complexity of the empire colouring problem for linear forests (Journal article)

    McGrae, A. R. A., & Zito, M. (2013). The complexity of the empire colouring problem for linear forests. DISCRETE MATHEMATICS, 313(11), 1248-1255. doi:10.1016/j.disc.2012.06.010

    DOI: 10.1016/j.disc.2012.06.010

    2011

    Web-site boundary detection using incremental randomwalk clustering (Conference Paper)

    Alshukri, A., Coenen, F., & Zito, M. (2011). Web-site boundary detection using incremental randomwalk clustering. In Res. and Dev. in Intelligent Syst. XXVIII: Incorporating Applications and Innovations in Intel. Sys. XIX - AI 2011, 31st SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel. (pp. 255-268). doi:10.1007/978-1-4471-2318-7-20

    DOI: 10.1007/978-1-4471-2318-7-20

    Graph-Theoretic Concepts in Computer Science (Conference Paper)

    Graph-Theoretic Concepts in Computer Science (2011). Springer Berlin Heidelberg. doi:10.1007/978-3-642-25870-1

    DOI: 10.1007/978-3-642-25870-1

    Incremental Web-Site Boundary Detection Using Random Walks (Conference Paper)

    Alshukri, A., Coenen, F., & Zito, M. (2011). Incremental Web-Site Boundary Detection Using Random Walks. In Unknown Conference (pp. 414-427). Springer Berlin Heidelberg. doi:10.1007/978-3-642-23199-5_31

    DOI: 10.1007/978-3-642-23199-5_31

    2010

    Text classification using graph mining-based feature extraction (Conference Paper)

    Jiang, C., Coenen, F., Sanderson, R., & Zito, M. (2010). Text classification using graph mining-based feature extraction. In Research and Development in Intelligent Systems XXVI: Incorporating Applications and Innovations in Intelligent Systems XVII (pp. 21-34). doi:10.1007/978-1-84882-983-1-2

    DOI: 10.1007/978-1-84882-983-1-2

    Text classification using graph mining-based feature extraction (Journal article)

    Jiang, C., Coenen, F., Sanderson, R., & Zito, M. (2010). Text classification using graph mining-based feature extraction. KNOWLEDGE-BASED SYSTEMS, 23(4), 302-308. doi:10.1016/j.knosys.2009.11.010

    DOI: 10.1016/j.knosys.2009.11.010

    Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach (Conference Paper)

    Jiang, C., Coenen, F., & Zito, M. (2010). Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach. In ADVANCED DATA MINING AND APPLICATIONS, ADMA 2010, PT I Vol. 6440 (pp. 405-416). Retrieved from http://gateway.webofknowledge.com/

    Frequent Sub-graph Mining on Edge Weighted Graphs (Conference Paper)

    Jiang, C., Coenen, F., & Zito, M. (2010). Frequent Sub-graph Mining on Edge Weighted Graphs. In DATA WAREHOUSING AND KNOWLEDGE DISCOVERY Vol. 6263 (pp. 77-88). Retrieved from http://gateway.webofknowledge.com/

    Web-Site Boundary Detection (Conference Paper)

    Alshukri, A., Coenen, F., & Zito, M. (2010). Web-Site Boundary Detection. In ADVANCES IN DATA MINING: APPLICATIONS AND THEORETICAL ASPECTS Vol. 6171 (pp. 529-543). Retrieved from http://gateway.webofknowledge.com/

    2009

    An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Journal article)

    Cooper, C., & Zito, M. (2009). An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. DISCRETE APPLIED MATHEMATICS, 157(9), 2010-2014. doi:10.1016/j.dam.2008.06.024

    DOI: 10.1016/j.dam.2008.06.024

    Large independent sets in random regular graphs (Journal article)

    Duckworth, W., & Zito, M. (2009). Large independent sets in random regular graphs. THEORETICAL COMPUTER SCIENCE, 410(50), 5236-5243. doi:10.1016/j.tcs.2009.08.025

    DOI: 10.1016/j.tcs.2009.08.025

    Martingales on Trees and the Empire Chromatic Number of Random Trees (Conference Paper)

    Cooper, C., McGrae, A. R. A., & Zito, M. (2009). Martingales on Trees and the Empire Chromatic Number of Random Trees. In Unknown Conference (pp. 74-83). Springer Berlin Heidelberg. doi:10.1007/978-3-642-03409-1_8

    DOI: 10.1007/978-3-642-03409-1_8

    Realistic Data for Testing Rule Mining Algorithms (Chapter)

    Cooper, C., & Zito, M. (2009). Realistic Data for Testing Rule Mining Algorithms. In J. Wang (Ed.), Encyclopedia of Data Warehousing and Mining (pp. 1653-1658). New York: ICI.

    The Block Connectivity of Random Trees (Journal article)

    McGrae, A. R. A., & Zito, M. (2009). The Block Connectivity of Random Trees. ELECTRONIC JOURNAL OF COMBINATORICS, 16(1). Retrieved from http://gateway.webofknowledge.com/

    2008

    Colouring random empire trees (Conference Paper)

    McGrae, A. R., & Zito, M. (2008). Colouring random empire trees. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS Vol. 5162 (pp. 515-526). Retrieved from http://gateway.webofknowledge.com/

    Packing vertices and edges in random regular graphs (Journal article)

    Beis, M., Duckworth, W., & Zito, M. (2008). Packing vertices and edges in random regular graphs. RANDOM STRUCTURES & ALGORITHMS, 32(1), 20-37. doi:10.1002/rsa.20165

    DOI: 10.1002/rsa.20165

    2007

    Realistic synthetic data for testing association rule mining algorithms for market basket databases (Conference Paper)

    Cooper, C., & Zito, M. (2007). Realistic synthetic data for testing association rule mining algorithms for market basket databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4702 LNAI (pp. 398-405).

    Uncover low degree vertices and minimise the mess: Independent sets in random regular graphs (Conference Paper)

    Duckworth, W., & Zito, M. (2007). Uncover low degree vertices and minimise the mess: Independent sets in random regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4708 LNCS (pp. 56-66).

    'Realistic synthetic data for rule mining' (Conference Paper)

    Cooper, C., & Zito, M. (2007). 'Realistic synthetic data for rule mining'. In J. Roth, J. Gutierrez, & A. P. Abraham (Eds.), 1st IADIS European Conference on Data Mining (pp. 140-144). N.A.: IADIS Press.

    The unsatisfiability threshold revisited (Journal article)

    Kaporis, A. C., Kirousis, L. M., Stamatiou, Y. C., Vamvakari, M., & Zito, M. (2007). The unsatisfiability threshold revisited. DISCRETE APPLIED MATHEMATICS, 155(12), 1525-1538. doi:10.1016/j.dam.2005.10.017

    DOI: 10.1016/j.dam.2005.10.017

    2006

    Dominating sets of random recursive trees (Conference Paper)

    Zito, M., & Cooper, C. (2006). Dominating sets of random recursive trees. In Electronic Notes in Discrete Mathematics Vol. 27 (pp. 107-108). Elsevier BV. doi:10.1016/j.endm.2006.08.078

    DOI: 10.1016/j.endm.2006.08.078

    'The satisfiability threshold conjecture: techniques behind upper bound improvements' (Chapter)

    Kirousis, L. M., Stamatiou, Y. C., & Zito, M. (2006). 'The satisfiability threshold conjecture: techniques behind upper bound improvements'. In A. Percus, G. Istrate, & C. Moore (Eds.), Computational Complexity and Statistical Physics (pp. 159-177). New York: Oxford University Press.

    2005

    Large κ-separated matchings of random regular graphs (Conference Paper)

    Beis, M., Duckworth, W., & Zito, M. (2005). Large κ-separated matchings of random regular graphs. In Conferences in Research and Practice in Information Technology Series Vol. 38 (pp. 175-182).

    'Large k-independent sets of regular graphs' (Conference Paper)

    Beis, M., Duckworth, W., & Zito, M. (2005). 'Large k-independent sets of regular graphs'. In P. Feofiloff, C. M. H. de Figueiredo, & Y. Wakabayashi (Eds.), 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics (pp. 321-327). Amsterdam: Elsevier.

    Lower Bounds and Algorithms for Dominating Sets in Web Graphs (Journal article)

    Cooper, C., Klasing, R., & Zito, M. (2005). Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics, 2(3), 275-300. doi:10.1080/15427951.2005.10129105

    DOI: 10.1080/15427951.2005.10129105

    On the approximability of the maximum induced matching problem (Journal article)

    Duckworth, W., Manlove, D. F., & Zito, M. (2005). On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms, 3(1), 79-91. doi:10.1016/j.jda.2004.05.001

    DOI: 10.1016/j.jda.2004.05.001

    On the complexity and accuracy of geographic profiling strategies (Journal article)

    Snook, B., Zito, M., Bennell, C., & Taylor, P. J. (2005). On the complexity and accuracy of geographic profiling strategies. JOURNAL OF QUANTITATIVE CRIMINOLOGY, 21(1), 1-26. doi:10.1007/s10940-004-1785-4

    DOI: 10.1007/s10940-004-1785-4

    2004

    Dominating sets in web graphs (Conference Paper)

    Cooper, C., Klasing, R., & Zito, M. (2004). Dominating sets in web graphs. In ALGORITHMS AND MODELS FOR THE WEB-GRAPHS, PROCEEDINGS Vol. 3243 (pp. 31-43). Retrieved from http://gateway.webofknowledge.com/

    2003

    Large 2-Independent Sets of Regular Graphs (Conference Paper)

    Duckworth, W., & Zito, M. (2003). Large 2-Independent Sets of Regular Graphs. In Electronic Notes in Theoretical Computer Science Vol. 78 (pp. 223-235). Elsevier BV. doi:10.1016/s1571-0661(04)81015-6

    DOI: 10.1016/s1571-0661(04)81015-6

    A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Journal article)

    Duckworth, W., Wormald, N. C., & Zito, M. (2003). A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. Journal of Discrete Algorithms, 1(1), 67-76. doi:10.1016/s1570-8667(03)00007-8

    DOI: 10.1016/s1570-8667(03)00007-8

    On polynomial-time approximation algorithms for the variable length scheduling problem (Journal article)

    Czumaj, A., Gasieniec, L., Gaur, D. R., Krishnamurti, R., Rytter, W., & Zito, M. (2003). On polynomial-time approximation algorithms for the variable length scheduling problem. THEORETICAL COMPUTER SCIENCE, 302(1-3), 489-495. doi:10.1016/S0304-3975(03)00141-5

    DOI: 10.1016/S0304-3975(03)00141-5

    Small maximal matchings in random graphs (Journal article)

    Zito, M. (2003). Small maximal matchings in random graphs. THEORETICAL COMPUTER SCIENCE, 297(1-3), 487-507. doi:10.1016/S0304-3975(02)00653-9

    DOI: 10.1016/S0304-3975(02)00653-9

    2002

    An upper bound on the space complexity of random formulae in resolution (Journal article)

    Zito, M. (2002). An upper bound on the space complexity of random formulae in resolution. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 36(4), 329-339. doi:10.1051/ita:2003003

    DOI: 10.1051/ita:2003003

    Maximum induced matchings of random cubic graphs (Journal article)

    Duckworth, W., Wormald, N. C., & Zito, M. (2002). Maximum induced matchings of random cubic graphs. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 142(1), 39-50. doi:10.1016/S0377-0427(01)00457-5

    DOI: 10.1016/S0377-0427(01)00457-5

    Packing edges in random regular graphs (Conference Paper)

    Beis, M., Duckworth, W., & Zito, M. (2002). Packing edges in random regular graphs. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002 Vol. 2420 (pp. 118-130). Retrieved from http://gateway.webofknowledge.com/

    2001

    A predicative and decidable characterization of the polynomial classes of languages (Journal article)

    Caporaso, S., Zito, M., & Galesi, N. (2001). A predicative and decidable characterization of the polynomial classes of languages. Theoretical Computer Science, 250(1-2), 83-99. doi:10.1016/s0304-3975(99)00116-4

    DOI: 10.1016/s0304-3975(99)00116-4

    Efficient web searching using temporal factors (Journal article)

    Czumaj, A., Finch, I., Gasieniec, L., Gibbons, A., Leng, P., Rytter, W., & Zito, M. (2001). Efficient web searching using temporal factors. THEORETICAL COMPUTER SCIENCE, 262(1-2), 569-582. doi:10.1016/S0304-3975(00)00366-2

    DOI: 10.1016/S0304-3975(00)00366-2

    Greedy algorithms for minimisation problems in random regular graphs (Conference Paper)

    Zito, M. (2001). Greedy algorithms for minimisation problems in random regular graphs. In F. Meyer auf der Heide (Ed.), Ninth Annual European Symposium on Algorithms (pp. 13). Berlin: Springer-Verlag.

    Leafy spanning trees in hypercubes (Journal article)

    Duckworth, W., Dunne, P. E., Gibbons, A. M., & Zito, M. (2001). Leafy spanning trees in hypercubes. APPLIED MATHEMATICS LETTERS, 14(7), 801-804. doi:10.1016/S0893-9659(01)00047-7

    DOI: 10.1016/S0893-9659(01)00047-7