Michele Zito

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