Michele Zito

According to our database, Michele Zito authored at least 68 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Vertex-connectivity for node failure identification in Boolean Network Tomography.

Nicola Galesi, Fariba Ranjbar, Michele Zito

Inf. Process. Lett., February, 2024

2023

Minimum Degree and Connectivity in 1-Dimensional Line-of-Sight Networks.

Hankang Gu, Michele Zito

Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2022

The Effect of Graph Layout on the Perception of Graph Density: An Empirical Study.

Elektra Kypridemou, Michele Zito, Marco Bertamini

Proceedings of the 24th Eurographics Conference on Visualization, 2022

Perception of Node-Link Diagrams: The Effect of Layout on the Perception of Graph Properties.

Elektra Kypridemou, Michele Zito, Marco Bertamini

Proceedings of the Diagrammatic Representation and Inference, 2022

2021

Report on BCTCS 2021.

Patrick Totzke, Michele Zito

Bull. EATCS, 2021

2020

Dynamic programming optimization in line of sight networks.

Pavan Sangha, Prudence W. H. Wong, Michele Zito

Inf. Comput., 2020

Independent sets in Line of Sight networks.

Pavan Sangha, Michele Zito

Discret. Appl. Math., 2020

The Effect of Graph Layout on the Perception of Graph Properties.

Elektra Kypridemou, Michele Zito, Marco Bertamini

Proceedings of the 22nd Eurographics Conference on Visualization, 2020

2019

An abstract argumentation approach for the prediction of analysts' recommendations following earnings conference calls.

Andrea Pazienza, Davide Grossi, Floriana Grasso, Rudi Palmieri, Michele Zito, Stefano Ferilli

Intelligenza Artificiale, 2019

2018

Easy knapsacks and the complexity of energy allocation problems in the smart grid.

Theo Karaboghossian, Michele Zito

Optim. Lett., 2018

Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography.

Nicola Galesi, Fariba Ranjbar, Michele Zito

CoRR, 2018

2017

Finding Large Independent Sets in Line of Sight Networks.

Pavan Sangha, Michele Zito

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Independent Sets in Restricted Line of Sight Networks.

Pavan Sangha, Prudence W. H. Wong, Michele Zito

Proceedings of the Algorithms for Sensor Systems, 2017

2015

Heuristic algorithm for coordinating smart houses in MicroGrid.

Mohamed K. Arikiez, Floriana Grasso, Michele Zito

Proceedings of the 2015 IEEE International Conference on Smart Grid Communications, 2015

Heuristics for the cost-effective management of a temperature controlled environment.

Mohamed K. Arikiez, Floriana Grasso, Michele Zito

Proceedings of the 2015 IEEE Innovative Smart Grid Technologies, 2015

2014

The Complexity of the Empire Colouring Problem.

Andrew R. A. McGrae, Michele Zito

Algorithmica, 2014

Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs.

Wen Yu, Frans Coenen, Michele Zito, Kwankamon Dittakan

Proceedings of the 2014 IEEE International Conference on Data Mining Workshops, 2014

2013

A survey of frequent subgraph mining algorithms.

Chuntao Jiang, Frans Coenen, Michele Zito

Knowl. Eng. Rev., 2013

The complexity of the empire colouring problem for linear forests.

Andrew R. A. McGrae, Michele Zito

Discret. Math., 2013

Vertex Unique Labelled Subgraph Mining.

Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi

Proceedings of the Research and Development in Intelligent Systems XXX, 2013

Smart domestic renewable energy management using knapsack.

Mohamed K. Arikiez, Peter Gatens, Floriana Grasso, Michele Zito

Proceedings of the 4th IEEE PES Innovative Smart Grid Technologies Europe, 2013

Minimal Vertex Unique Labelled Subgraph Mining.

Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi

Proceedings of the Data Warehousing and Knowledge Discovery, 2013

Vertex Unique Labelled Subgraph Mining for Vertex Label Classification.

Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi

Proceedings of the Advanced Data Mining and Applications, 9th International Conference, 2013

2011

Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem.

Andrew R. A. McGrae, Michele Zito

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Web-Site Boundary Detection Using Incremental RandomWalk Clustering.

Ayesh Alshukri, Frans Coenen, Michele Zito

Proceedings of the Research and Development in Intelligent Systems XXVIII, 2011

Incremental Web-Site Boundary Detection Using Random Walks.

Ayesh Alshukri, Frans Coenen, Michele Zito

Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2011

2010

Text classification using graph mining-based feature extraction.

Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito

Knowl. Based Syst., 2010

Web-Site Boundary Detection.

Ayesh Alshukri, Frans Coenen, Michele Zito

Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2010

Frequent Sub-graph Mining on Edge Weighted Graphs.

Chuntao Jiang, Frans Coenen, Michele Zito

Proceedings of the Data Warehousing and Knowledge Discovery, 12th International Conference, 2010

Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach.

Chuntao Jiang, Frans Coenen, Michele Zito

Proceedings of the Advanced Data Mining and Applications - 6th International Conference, 2010

2009

Realistic Data for Testing Rule Mining Algorithms.

Colin Cooper, Michele Zito

Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Large independent sets in random regular graphs.

William Duckworth, Michele Zito

Theor. Comput. Sci., 2009

An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.

Colin Cooper, Michele Zito

Discret. Appl. Math., 2009

The Block Connectivity of Random Trees.

Andrew R. A. McGrae, Michele Zito

Electron. J. Comb., 2009

Martingales on Trees and the Empire Chromatic Number of Random Trees.

Colin Cooper, Andrew R. A. McGrae, Michele Zito

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

Packing vertices and edges in random regular graphs.

Mihalis Beis, William Duckworth, Michele Zito

Random Struct. Algorithms, 2008

Colouring Random Empire Trees.

Andrew R. A. McGrae, Michele Zito

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases.

Colin Cooper, Michele Zito

Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs.

William Duckworth, Michele Zito

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Dominating sets of random recursive trees.

Michele Zito, Colin Cooper

Electron. Notes Discret. Math., 2006

The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements.

Lefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito

Proceedings of the Computational Complexity and Statistical Physics., 2006

2005

On the approximability of the maximum induced matching problem.

William Duckworth, David F. Manlove, Michele Zito

J. Discrete Algorithms, 2005

Lower Bounds and Algorithms for Dominating Sets in Web Graphs.

Colin Cooper, Ralf Klasing, Michele Zito

Internet Math., 2005

Large k-independent sets of regular graphs.

Mihalis Beis, William Duckworth, Michele Zito

Electron. Notes Discret. Math., 2005

Large k-Separated Matchings of Random Regular Graphs.

Mihalis Beis, William Duckworth, Michele Zito

Proceedings of the Computer Science 2005, 2005

2004

Dominating Sets in Web Graphs.

Colin Cooper, Ralf Klasing, Michele Zito

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2003

Small maximal matchings in random graphs.

Michele Zito

Theor. Comput. Sci., 2003

On polynomial-time approximation algorithms for the variable length scheduling problem.

Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito

Theor. Comput. Sci., 2003

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.

William Duckworth, Nicholas C. Wormald, Michele Zito

J. Discrete Algorithms, 2003

Large 2-Independent Sets of Regular Graphs.

William Duckworth, Michele Zito

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

2002

Packing Edges in Random Regular Graphs.

Mihalis Beis, William Duckworth, Michele Zito

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Efficient web searching using temporal factors.

Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito

Theor. Comput. Sci., 2001

A predicative and decidable characterization of the polynomial classes of languages.

Salvatore Caporaso, Michele Zito, Nicola Galesi

Theor. Comput. Sci., 2001

The unsatisfiability threshold revisited.

Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito

Electron. Notes Discret. Math., 2001

An Upper Bound on the Space Complexity of Random Formulae in Resolution

Michele Zito

Electron. Colloquium Comput. Complex., 2001

Leafy spanning trees in hypercubes.

William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito

Appl. Math. Lett., 2001

Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold.

Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Greedy Algorithms for Minimisation Problems in Random Regular Graphs.

Michele Zito

Proceedings of the Algorithms, 2001

2000

Complexity-theoretic models of phase transitions in search problems.

Paul E. Dunne, Alan Gibbons, Michele Zito

Theor. Comput. Sci., 2000

Linear Time Maximum Induced Matching Algorithm for Trees.

Michele Zito

Nord. J. Comput., 2000

Sparse Hypercube 3-spanners.

William Duckworth, Michele Zito

Discret. Appl. Math., 2000

Maximum Induced Matchings of Random Cubic Graphs.

William Duckworth, Nicholas C. Wormald, Michele Zito

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Randomised techniques in combinatorial algorithmics.

Michele A. A. Zito

PhD thesis, 1999

Induced Matchings in Regular Graphs and Trees.

Michele Zito

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

An Inproved Upper Bound on the Non-3-Colourability Threshold.

Paul E. Dunne, Michele Zito

Inf. Process. Lett., 1998

On a Relation Between Uniform Coding and Problems of the Form DTIMEF(<i>F</i>) =? DSPACEF(<i>F</i>).

Salvatore Caporaso, Michele Zito

Acta Informatica, 1998

1997

Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.

Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

RNC Algorithms for the Uniform Generation of Combinatorial Structures.

Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996