VLDB 2026 Research / reviewers in the wild / expert
Michele Zito 0001
dblp:99/1319 · also Michele A. A. Zito
· DBLP profile ↗
37ranked-venue papers
5as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 28 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 7 · 1 since 2021Databases, data management, data science and information retrieval · 7 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Vertex-connectivity for node failure identification in Boolean Network Tomography
Nicola Galesi, Fariba Ranjbar, Michele Zito 0001 |
Inf. Process. Lett. | 3 |
| 2022 | Perception of Node-Link Diagrams: The Effect of Layout on the Perception of Graph Properties
Elektra Kypridemou, Michele Zito 0001, Marco Bertamini |
Diagrams | 2 |
| 2020 | Independent sets in Line of Sight networks
Pavan Sangha, Michele Zito 0001 |
Discret. Appl. Math. | 2 |
| 2020 | Dynamic programming optimization in line of sight networks
Pavan Sangha, Prudence W. H. Wong, Michele Zito 0001 |
Inf. Comput. | 3 |
| 2019 | Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography
Nicola Galesi, Fariba Ranjbar, Michele Zito 0001 |
ALGOSENSORS | 3 |
| 2017 | Independent Sets in Restricted Line of Sight Networks
Pavan Sangha, Prudence W. H. Wong, Michele Zito 0001 |
ALGOSENSORS | 3 |
| 2014 | The Complexity of the Empire Colouring Problem
Andrew R. A. McGrae, Michele Zito 0001 |
Algorithmica | 2 |
| 2013 | Vertex Unique Labelled Subgraph Mining for Vertex Label Classification
Wen Yu 0003, Frans Coenen, Michele Zito 0001, Subhieh El-Salhi |
ADMA (1) | 3 |
| 2013 | Minimal Vertex Unique Labelled Subgraph Mining
Wen Yu 0003, Frans Coenen, Michele Zito 0001, Subhieh El-Salhi |
DaWaK | 3 |
| 2011 | Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
Andrew R. A. McGrae, Michele Zito 0001 |
WG | 2 |
| 2010 | Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach
Chuntao Jiang, Frans Coenen, Michele Zito 0001 |
ADMA (1) | 3 |
| 2010 | Frequent Sub-graph Mining on Edge Weighted Graphs
Chuntao Jiang, Frans Coenen, Michele Zito 0001 |
DaWak | 3 |
| 2010 | Text classification using graph mining-based feature extraction
Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito 0001 |
Knowl. Based Syst. | 4 |
| 2009 | Martingales on Trees and the Empire Chromatic Number of Random Trees
Colin Cooper, Andrew R. A. McGrae, Michele Zito 0001 |
FCT | 3 |
| 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 0001 |
Discret. Appl. Math. | 2 |
| 2009 | Large independent sets in random regular graphs
William Duckworth, Michele Zito 0001 |
Theor. Comput. Sci. | 2 |
| 2008 | Colouring Random Empire Trees
Andrew R. A. McGrae, Michele Zito 0001 |
MFCS | 2 |
| 2007 | Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
William Duckworth, Michele Zito 0001 |
MFCS | 2 |
| 2007 | Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases
Colin Cooper, Michele Zito 0001 |
PKDD | 2 |
| 2007 | The unsatisfiability threshold revisited
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito 0001 |
Discret. Appl. Math. | 5 |
| 2004 | Dominating Sets in Web Graphs
Colin Cooper, Ralf Klasing, Michele Zito 0001 |
WAW | 3 |
| 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 0001 |
Theor. Comput. Sci. | 6 |
| 2003 | Small maximal matchings in random graphs
Michele Zito 0001 |
Theor. Comput. Sci. | 1 |
| 2002 | Packing Edges in Random Regular Graphs
Mihalis Beis, William Duckworth, Michele Zito 0001 |
MFCS | 3 |
| 2001 | Greedy Algorithms for Minimisation Problems in Random Regular Graphs
Michele Zito 0001 |
ESA | 1 |
| 2001 | A predicative and decidable characterization of the polynomial classes of languages
Salvatore Caporaso, Michele Zito 0001, Nicola Galesi |
Theor. Comput. Sci. | 2 |
| 2001 | Efficient web searching using temporal factors
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito 0001 |
Theor. Comput. Sci. | 7 |
| 2000 | Maximum Induced Matchings of Random Cubic Graphs
William Duckworth, Nicholas C. Wormald, Michele Zito 0001 |
COCOON | 3 |
| 2000 | Small Maximal Matchings in Random Graphs
Michele Zito 0001 |
LATIN | 1 |
| 2000 | Sparse Hypercube 3-spanners
William Duckworth, Michele Zito 0001 |
Discret. Appl. Math. | 2 |
| 2000 | Complexity-theoretic models of phase transitions in search problems
Paul E. Dunne, Alan Gibbons, Michele Zito 0001 |
Theor. Comput. Sci. | 3 |
| 1999 | Efficient Web Searching Using Temporal Factors
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito 0001 |
WADS | 7 |
| 1999 | Induced Matchings in Regular Graphs and Trees
Michele Zito 0001 |
WG | 1 |
| 1998 | On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F)
Salvatore Caporaso, Michele Zito 0001 |
Acta Informatica | 2 |
| 1998 | An Inproved Upper Bound on the Non-3-Colourability Threshold
Paul E. Dunne, Michele Zito 0001 |
Inf. Process. Lett. | 2 |
| 1997 | Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy
Salvatore Caporaso, Michele Zito 0001, Nicola Galesi, Emanuele Covino |
CIAC | 2 |
| 1996 | RNC Algorithms for the Uniform Generation of Combinatorial Structures
Michele Zito 0001, Ida Pu, Martyn Amos, Alan Gibbons |
SODA | 1 |