2024
Galesi, N., Ranjbar, F., & Zito, M. (2024). Vertex-connectivity for node failure identification in Boolean Network Tomography. Information Processing Letters, 184, 106450. doi:10.1016/j.ipl.2023.106450DOI: 10.1016/j.ipl.2023.106450
2023
Bertamini, M., Guest, M., Contemori, G., & Zito, M. (2023). What the Solitaire illusion tells us about perception of numerosity. BRITISH JOURNAL OF PSYCHOLOGY, 114(2), 393-414. doi:10.1111/bjop.12627DOI: 10.1111/bjop.12627
2022
Guest, M., Zito, M., Hulleman, J., & Bertamini, M. (n.d.). On the usefulness of graph-theoretic properties in the study of perceived numerosity. Behavior Research Methods. doi:10.3758/s13428-021-01733-zDOI: 10.3758/s13428-021-01733-z
Kypridemou, E., Zito, M., & Bertamini, M. (2022). Perception of Node-Link Diagrams: The Effect of Layout on the Perception of Graph Properties. In V. Giardino, S. Linker, R. Burns, F. Bellucci, J. -M. Boucheix, & P. Viana (Eds.), Lecture Notes in Artificial Intelligence Vol. 13462 (pp. 364-367). Rome: Springer, Cham. doi:10.1007/978-3-031-15146-0_32DOI: 10.1007/978-3-031-15146-0_32
Perception of node-link diagrams: the effect of layout on the perception of graph properties (Conference Paper)
Bertamini, M., Kypridemou, E., & Zito, M. (2022). Perception of node-link diagrams: the effect of layout on the perception of graph properties. In PERCEPTION Vol. 51 (pp. 83-84). Retrieved from https://www.webofscience.com/
Kypridemou, E., Zito, M., & Bertamini, M. (2022, June 13). The Effect of Graph Layout on the Perception of Graph Density: An Empirical Study. In T. Hollt, W. Aigner, & M. Agus (Eds.), EuroVis 2022 - Short Papers (pp. 31-35). Rome, Italy: The Eurographics Association.
2020
Sangha, P., & Zito, M. (n.d.). Independent sets in Line of Sight networks. Discrete Applied Mathematics. doi:10.1016/j.dam.2019.03.029DOI: 10.1016/j.dam.2019.03.029
Pazienza, A., Grossi, D., Grasso, F., Palmieri, R., Zito, M., & Ferilli, S. (2019). An abstract argumentation approach for the prediction of analysts' recommendations following earnings conference calls. INTELLIGENZA ARTIFICIALE, 13(2), 173-188. doi:10.3233/IA-190026DOI: 10.3233/ia-190026
The Effect of Graph Layout on the Perception of Graph Properties. (Conference Paper)
Kypridemou, E., Zito, M., & Bertamini, M. (2020). The Effect of Graph Layout on the Perception of Graph Properties.. In A. Kerren, C. Garth, & G. E. Marai (Eds.), EuroVis (Short Papers) (pp. 1-5). Eurographics Association. Retrieved from https://diglib.eg.org/handle/10.2312/2632897
2019
Galesi, N., Ranjbar, F., & Zito, M. (2019). Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography. In ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2019 Vol. 11931 (pp. 79-95). doi:10.1007/978-3-030-34405-4_5DOI: 10.1007/978-3-030-34405-4_5
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 https://www.webofscience.com/
2018
Karaboghossian, T., & Zito, M. (2018). Easy knapsacks and the complexity of energy allocation problems in the smart grid. Optimization Letters, 12, 1553-1568. doi:10.1007/s11590-017-1209-7DOI: 10.1007/s11590-017-1209-7
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
Dynamic Programming Optimization in Line of Sight Networks (Journal article)
Sangha, P., Wong, P., & Zito, M. (2020). Dynamic Programming Optimization in Line of Sight Networks. Information and Computation, 270. doi:10.1016/j.ic.2019.104460DOI: 10.1016/j.ic.2019.104460
2017
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 Vol. 10718 (pp. 211-222). doi:10.1007/978-3-319-72751-6_16DOI: 10.1007/978-3-319-72751-6_16
Sangha, P., & Zito, M. (2017). Finding Large Independent Sets in Line of Sight Networks. In Lecture Notes in Computer Science Vol. 10156 (pp. 332-343). Goa: Springer Verlag. doi:10.1007/978-3-319-53007-9_29DOI: 10.1007/978-3-319-53007-9_29
2016
Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid (Conference Paper)
Arikiez, M., Grasso, F., Kowalski, D., & Zito, M. (2016). Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid. In 2016 IEEE INTERNATIONAL ENERGY CONFERENCE (ENERGYCON). Retrieved from https://www.webofscience.com/
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-0DOI: 10.3758/s13414-016-1100-0
Heuristic Algorithm for Coordinating Smart Houses in MicroGrid (Conference Paper)
Arikiez, M., Grasso, F., & Zito, M. (2015). Heuristic Algorithm for Coordinating Smart Houses in MicroGrid. In 2015 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM) (pp. 49-54). Retrieved from https://www.webofscience.com/
Heuristics for the Cost-Effective Management of a Temperature Controlled Environment (Conference Paper)
Arikiez, M., Grasso, F., & Zito, M. (2015). Heuristics for the Cost-Effective Management of a Temperature Controlled Environment. In 2015 IEEE INNOVATIVE SMART GRID TECHNOLOGIES - ASIA (ISGT ASIA). Retrieved from https://www.webofscience.com/
2015
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 (ICDMW) (pp. 47-54). doi:10.1109/ICDMW.2014.125DOI: 10.1109/ICDMW.2014.125
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 https://www.webofscience.com/
2014
McGrae, A. R. A., & Zito, M. (2014). The Complexity of the Empire Colouring Problem. Algorithmica, 68, 483-503. doi:10.1007/s00453-012-9680-0DOI: 10.1007/s00453-012-9680-0
2013
Smart Domestic Renewable Energy Management Using Knapsack (Conference Paper)
Arikiez, M. K., Gatens, P., Grasso, H., & Zito, M. (2013). Smart Domestic Renewable Energy Management Using Knapsack. In 2013 4TH IEEE/PES INNOVATIVE SMART GRID TECHNOLOGIES EUROPE (ISGT EUROPE). Retrieved from https://www.webofscience.com/
Vertex Unique Labelled Subgraph Mining for Vertex Label Classification (Conference Paper)
Yu, W., Coenen, F., Zito, M., & El Salhi, S. (2013). Vertex Unique Labelled Subgraph Mining for Vertex Label Classification. In Unknown Conference (pp. 542-553). Springer Berlin Heidelberg. doi:10.1007/978-3-642-53914-5_46DOI: 10.1007/978-3-642-53914-5_46
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_28DOI: 10.1007/978-3-642-40131-2_28
Jiang, C., Coenen, F., & Zito, M. (2013). A survey of frequent subgraph mining algorithms. KNOWLEDGE ENGINEERING REVIEW, 28(1), 75-105. doi:10.1017/S0269888912000331DOI: 10.1017/S0269888912000331
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.6695345DOI: 10.1109/ISGTEurope.2013.6695345
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.010DOI: 10.1016/j.disc.2012.06.010
Vertex Unique Labelled Subgraph Mining (Chapter)
Yu, W., Coenen, F., Zito, M., & Salhi, S. E. (2013). Vertex Unique Labelled Subgraph Mining. In Research and Development in Intelligent Systems XXX (pp. 21-37). Springer International Publishing. doi:10.1007/978-3-319-02621-3_2DOI: 10.1007/978-3-319-02621-3_2
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.
2011
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Conference Paper)
McGrae, A. R. A., & Zito, M. (2011). Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. In GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE Vol. 6986 (pp. 179-190). Retrieved from https://www.webofscience.com/
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_31DOI: 10.1007/978-3-642-23199-5_31
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_20DOI: 10.1007/978-1-4471-2318-7_20
2010
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 https://www.webofscience.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 https://www.webofscience.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 https://www.webofscience.com/
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.010DOI: 10.1016/j.knosys.2009.11.010
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_2DOI: 10.1007/978-1-84882-983-1_2
2009
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.025DOI: 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 FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS Vol. 5699 (pp. 74-+). Retrieved from https://www.webofscience.com/
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.024DOI: 10.1016/j.dam.2008.06.024
Realistic Data for Testing Rule Mining Algorithms (Chapter)
Cooper, C., & Zito, M. (2009). Realistic Data for Testing Rule Mining Algorithms. In Encyclopedia of Data Warehousing and Mining, Second Edition (pp. 1653-1658). IGI Global. doi:10.4018/978-1-60566-010-3.ch252DOI: 10.4018/978-1-60566-010-3.ch252
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 https://www.webofscience.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 https://www.webofscience.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.20165DOI: 10.1002/rsa.20165
2007
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.017DOI: 10.1016/j.dam.2005.10.017
'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.
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 KNOWLEDGE DISCOVERY IN DATABASES: PKDD 2007, PROCEEDINGS Vol. 4702 (pp. 398-+). Retrieved from https://www.webofscience.com/
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 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS Vol. 4708 (pp. 56-+). Retrieved from https://www.webofscience.com/
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.078DOI: 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 Electronic Notes in Discrete Mathematics Vol. 19 (pp. 321-327). Elsevier BV. doi:10.1016/j.endm.2005.05.043DOI: 10.1016/j.endm.2005.05.043
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.001DOI: 10.1016/j.jda.2004.05.001
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.10129105DOI: 10.1080/15427951.2005.10129105
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-4DOI: 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 https://www.webofscience.com/
2003
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-5DOI: 10.1016/S0304-3975(03)00141-5
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-8DOI: 10.1016/s1570-8667(03)00007-8
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-6DOI: 10.1016/s1571-0661(04)81015-6
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-9DOI: 10.1016/S0304-3975(02)00653-9
2002
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-5DOI: 10.1016/S0377-0427(01)00457-5
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:2003003DOI: 10.1051/ita:2003003
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 https://www.webofscience.com/
2001
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-7DOI: 10.1016/S0893-9659(01)00047-7
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-2DOI: 10.1016/S0304-3975(00)00366-2
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-4DOI: 10.1016/S0304-3975(99)00116-4
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.
2000
Complexity-theoretic models of phase transitions in search problems (Journal article)
Dunne, P. E., Gibbons, A., & Zito, M. (2000). Complexity-theoretic models of phase transitions in search problems. THEORETICAL COMPUTER SCIENCE, 249(2), 243-263. doi:10.1016/S0304-3975(00)00061-XDOI: 10.1016/S0304-3975(00)00061-X
Duckworth, W., & Zito, M. (2000). Sparse hypercube 3-spanners. DISCRETE APPLIED MATHEMATICS, 103(1-3), 289-295. doi:10.1016/S0166-218X(99)00246-2DOI: 10.1016/S0166-218X(99)00246-2
Small maximal matchings in random graphs (Conference Paper)
Zito, M. (2000). Small maximal matchings in random graphs. In LATIN 2000: THEORETICAL INFORMATICS Vol. 1776 (pp. 18-27). doi:10.1007/10719839_2DOI: 10.1007/10719839_2
1999
Algorithms and complexity issues concerning phase-transition phenomena in combinatorial problems (Conference Paper)
Dunne, P., Gibbons, A., & Zito, M. (1999). Algorithms and complexity issues concerning phase-transition phenomena in combinatorial problems. In R. Raman, & J. Simpson (Eds.), Unknown Conference (pp. 76-90).
Approximation algorithms for finding sparse 2-spanners of 4-connected planar triangulations (Conference Paper)
Duckworth, W., Wormald, N. C., & Zito, M. (1999). Approximation algorithms for finding sparse 2-spanners of 4-connected planar triangulations. In R. Raman, & J. Simpson (Eds.), Tenth Australasian Workshop on Combinatorial Algorithms.
1998
On a relation between uniform coding and problems of the form DTIMEF(F) =? DSPACEF(F) (Journal article)
Caporaso, S., & Zito, M. (1998). On a relation between uniform coding and problems of the form DTIMEF(F) =? DSPACEF(F). ACTA INFORMATICA, 35(8), 665-672. doi:10.1007/s002360050137DOI: 10.1007/s002360050137
An improved upper bound on the non-3-colourability threshold (Journal article)
Dunne, P. E., & Zito, M. (1998). An improved upper bound on the non-3-colourability threshold. INFORMATION PROCESSING LETTERS, 65(1), 17-23. doi:10.1016/S0020-0190(97)00193-2DOI: 10.1016/S0020-0190(97)00193-2
1997
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy (Conference Paper)
Caporaso, S., Zito, M., Galesi, N., & Covino, E. (1997). Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy. In Unknown Conference (pp. 61-73). Springer Berlin Heidelberg. doi:10.1007/3-540-62592-5_61DOI: 10.1007/3-540-62592-5_61