Michele Zito

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 17

Top Topics

Neighboring Nodes

Controlled Environment

Allocation Problems

Betweenness Centrality

Top Venues

EuroVis (Short Papers)

Publications

Nicola Galesi, Fariba Ranjbar, Michele Zito
Vertex-connectivity for node failure identification in Boolean Network Tomography. Inf. Process. Lett. 184 (2024)
Hankang Gu, Michele Zito
Minimum Degree and Connectivity in 1-Dimensional Line-of-Sight Networks. ALGOWIN (2023)
Elektra Kypridemou, Michele Zito, Marco Bertamini
The Effect of Graph Layout on the Perception of Graph Density: An Empirical Study. EuroVis (Short Papers) (2022)
Elektra Kypridemou, Michele Zito, Marco Bertamini
Perception of Node-Link Diagrams: The Effect of Layout on the Perception of Graph Properties. Diagrams (2022)
Patrick Totzke, Michele Zito
Report on BCTCS 2021. Bull. EATCS 134 (2021)
Pavan Sangha, Prudence W. H. Wong, Michele Zito
Dynamic programming optimization in line of sight networks. Inf. Comput. 270 (2020)
Pavan Sangha, Michele Zito
Independent sets in Line of Sight networks. Discret. Appl. Math. 286 (2020)
Elektra Kypridemou, Michele Zito, Marco Bertamini
The Effect of Graph Layout on the Perception of Graph Properties. EuroVis (Short Papers) (2020)
Nicola Galesi, Fariba Ranjbar, Michele Zito
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography. ALGOSENSORS (2019)
Andrea Pazienza, Davide Grossi, Floriana Grasso, Rudi Palmieri, Michele Zito, Stefano Ferilli
An abstract argumentation approach for the prediction of analysts' recommendations following earnings conference calls. Intelligenza Artificiale 13 (2) (2019)
Nicola Galesi, Fariba Ranjbar, Michele Zito
Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography. CoRR (2018)
Theo Karaboghossian, Michele Zito
Easy knapsacks and the complexity of energy allocation problems in the smart grid. Optim. Lett. 12 (7) (2018)
Pavan Sangha, Prudence W. H. Wong, Michele Zito
Dynamic Programming Optimization in Line of Sight Networks. CoRR (2018)
Pavan Sangha, Michele Zito
Finding Large Independent Sets in Line of Sight Networks. CALDAM (2017)
Pavan Sangha, Prudence W. H. Wong, Michele Zito
Independent Sets in Restricted Line of Sight Networks. ALGOSENSORS (2017)
Mohamed K. Arikiez, Floriana Grasso, Michele Zito
Heuristics for the cost-effective management of a temperature controlled environment. ISGT Asia (2015)
Mohamed K. Arikiez, Floriana Grasso, Michele Zito
Heuristic algorithm for coordinating smart houses in MicroGrid. SmartGridComm (2015)
Andrew R. A. McGrae, Michele Zito
The Complexity of the Empire Colouring Problem. Algorithmica 68 (2) (2014)
Wen Yu, Frans Coenen, Michele Zito, Kwankamon Dittakan
Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs. ICDM Workshops (2014)
Mohamed K. Arikiez, Peter Gatens, Floriana Grasso, Michele Zito
Smart domestic renewable energy management using knapsack. ISGT Europe (2013)
Chuntao Jiang, Frans Coenen, Michele Zito
A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28 (1) (2013)
Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi
Vertex Unique Labelled Subgraph Mining for Vertex Label Classification. ADMA (1) (2013)
Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi
Minimal Vertex Unique Labelled Subgraph Mining. DaWaK (2013)
Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi
Vertex Unique Labelled Subgraph Mining. SGAI Conf. (2013)
Andrew R. A. McGrae, Michele Zito
The complexity of the empire colouring problem for linear forests. Discret. Math. 313 (11) (2013)
Andrew R. A. McGrae, Michele Zito
The Complexity of the Empire Colouring Problem CoRR (2011)
Andrew R. A. McGrae, Michele Zito
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. WG (2011)
Ayesh Alshukri, Frans Coenen, Michele Zito
Incremental Web-Site Boundary Detection Using Random Walks. MLDM (2011)
Ayesh Alshukri, Frans Coenen, Michele Zito
Web-Site Boundary Detection Using Incremental RandomWalk Clustering. SGAI Conf. (2011)
Chuntao Jiang, Frans Coenen, Michele Zito
Frequent Sub-graph Mining on Edge Weighted Graphs. DaWak (2010)
Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito
Text classification using graph mining-based feature extraction. Knowl. Based Syst. 23 (4) (2010)
Chuntao Jiang, Frans Coenen, Michele Zito
Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach. ADMA (1) (2010)
Ayesh Alshukri, Frans Coenen, Michele Zito
Web-Site Boundary Detection. ICDM (2010)
Colin Cooper, Michele Zito
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. Discret. Appl. Math. 157 (9) (2009)
Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito
Text Classification using Graph Mining-based Feature Extraction. SGAI Conf. (2009)
Colin Cooper, Andrew R. A. McGrae, Michele Zito
Martingales on Trees and the Empire Chromatic Number of Random Trees. FCT (2009)
William Duckworth, Michele Zito
Large independent sets in random regular graphs. Theor. Comput. Sci. 410 (50) (2009)
Andrew R. A. McGrae, Michele Zito
The Block Connectivity of Random Trees. Electron. J. Comb. 16 (1) (2009)
Mihalis Beis, William Duckworth, Michele Zito
Packing vertices and edges in random regular graphs. Random Struct. Algorithms 32 (1) (2008)
Andrew R. A. McGrae, Michele Zito
Colouring Random Empire Trees. MFCS (2008)
William Duckworth, Michele Zito
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. MFCS (2007)
Colin Cooper, Michele Zito
Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD (2007)
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
The unsatisfiability threshold revisited. Discret. Appl. Math. 155 (12) (2007)
Michele Zito, Colin Cooper
Dominating sets of random recursive trees. Electron. Notes Discret. Math. 27 (2006)
William Duckworth, David F. Manlove, Michele Zito
On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3 (1) (2005)
Colin Cooper, Ralf Klasing, Michele Zito
Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Math. 2 (3) (2005)
Mihalis Beis, William Duckworth, Michele Zito
Large k-Separated Matchings of Random Regular Graphs. ACSC (2005)
Mihalis Beis, William Duckworth, Michele Zito
Large k-independent sets of regular graphs. Electron. Notes Discret. Math. 19 (2005)
Colin Cooper, Ralf Klasing, Michele Zito
Dominating Sets in Web Graphs. WAW (2004)
Michele Zito
Small maximal matchings in random graphs. Theor. Comput. Sci. 297 (1-3) (2003)
William Duckworth, Nicholas C. Wormald, Michele Zito
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. Discrete Algorithms 1 (1) (2003)
Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302 (1-3) (2003)
William Duckworth, Michele Zito
Large 2-Independent Sets of Regular Graphs. Electron. Notes Theor. Comput. Sci. 78 (2003)
Michele Zito
An Upper Bound on the Space Complexity of Random Formulae in Resolution. RAIRO Theor. Informatics Appl. 36 (4) (2002)
Mihalis Beis, William Duckworth, Michele Zito
Packing Edges in Random Regular Graphs. MFCS (2002)
Michele Zito
An Upper Bound on the Space Complexity of Random Formulae in Resolution Electron. Colloquium Comput. Complex. (079) (2001)
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
The unsatisfiability threshold revisited. Electron. Notes Discret. Math. 9 (2001)
Michele Zito
Greedy Algorithms for Minimisation Problems in Random Regular Graphs. ESA (2001)
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
Efficient web searching using temporal factors. Theor. Comput. Sci. 262 (1) (2001)
William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito
Leafy spanning trees in hypercubes. Appl. Math. Lett. 14 (7) (2001)
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS (2001)
Salvatore Caporaso, Michele Zito, Nicola Galesi
A predicative and decidable characterization of the polynomial classes of languages. Theor. Comput. Sci. 250 (1-2) (2001)
William Duckworth, Michele Zito
Sparse Hypercube 3-spanners. Discret. Appl. Math. 103 (1-3) (2000)
Michele Zito
Linear Time Maximum Induced Matching Algorithm for Trees. Nord. J. Comput. 7 (1) (2000)
Michele Zito
Small Maximal Matchings in Random Graphs. LATIN (2000)
William Duckworth, Nicholas C. Wormald, Michele Zito
Maximum Induced Matchings of Random Cubic Graphs. COCOON (2000)
Paul E. Dunne, Alan Gibbons, Michele Zito
Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249 (2) (2000)
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
Efficient Web Searching Using Temporal Factors. WADS (1999)
Michele Zito
Induced Matchings in Regular Graphs and Trees. WG (1999)
Paul E. Dunne, Michele Zito
An Inproved Upper Bound on the Non-3-Colourability Threshold. Inf. Process. Lett. 65 (1) (1998)
Salvatore Caporaso, Michele Zito
). Acta Informatica 35 (8) (1998)
Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. CIAC (1997)
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
RNC Algorithms for the Uniform Generation of Combinatorial Structures. SODA (1996)