Michele Zito

According to our database1, Michele Zito
  • authored at least 59 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Finding Large Independent Sets in Line of Sight Networks.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2015
Heuristic algorithm for coordinating smart houses in MicroGrid.
Proceedings of the 2015 IEEE International Conference on Smart Grid Communications, 2015

2014
The Complexity of the Empire Colouring Problem.
Algorithmica, 2014

Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs.
Proceedings of the 2014 IEEE International Conference on Data Mining Workshops, 2014

2013
A survey of frequent subgraph mining algorithms.
Knowledge Eng. Review, 2013

The complexity of the empire colouring problem for linear forests.
Discrete Mathematics, 2013

Vertex Unique Labelled Subgraph Mining.
Proceedings of the Research and Development in Intelligent Systems XXX, 2013

Smart domestic renewable energy management using knapsack.
Proceedings of the 4th IEEE PES Innovative Smart Grid Technologies Europe, 2013

Minimal Vertex Unique Labelled Subgraph Mining.
Proceedings of the Data Warehousing and Knowledge Discovery, 2013

Vertex Unique Labelled Subgraph Mining for Vertex Label Classification.
Proceedings of the Advanced Data Mining and Applications, 9th International Conference, 2013

2011
The Complexity of the Empire Colouring Problem
CoRR, 2011

Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Web-Site Boundary Detection Using Incremental RandomWalk Clustering.
Proceedings of the Research and Development in Intelligent Systems XXVIII, 2011

Incremental Web-Site Boundary Detection Using Random Walks.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2011

2010
Text classification using graph mining-based feature extraction.
Knowl.-Based Syst., 2010

Web-Site Boundary Detection.
Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2010

Frequent Sub-graph Mining on Edge Weighted Graphs.
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.
Proceedings of the Advanced Data Mining and Applications - 6th International Conference, 2010

2009
Realistic Data for Testing Rule Mining Algorithms.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Large independent sets in random regular graphs.
Theor. Comput. Sci., 2009

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

The Block Connectivity of Random Trees.
Electr. J. Comb., 2009

Text Classification using Graph Mining-based Feature Extraction.
Proceedings of the Research and Development in Intelligent Systems XXVI, 2009

Martingales on Trees and the Empire Chromatic Number of Random Trees.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008
Packing vertices and edges in random regular graphs.
Random Struct. Algorithms, 2008

Colouring Random Empire Trees.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
The unsatisfiability threshold revisited.
Discrete Applied Mathematics, 2007

Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases.
Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Dominating sets of random recursive trees.
Electronic Notes in Discrete Mathematics, 2006

2005
On the approximability of the maximum induced matching problem.
J. Discrete Algorithms, 2005

Lower Bounds and Algorithms for Dominating Sets in Web Graphs.
Internet Mathematics, 2005

Large k-independent sets of regular graphs.
Electronic Notes in Discrete Mathematics, 2005

Large k-Separated Matchings of Random Regular Graphs.
Proceedings of the Computer Science 2005, 2005

2004
Dominating Sets in Web Graphs.
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2003
Small maximal matchings in random graphs.
Theor. Comput. Sci., 2003

On polynomial-time approximation algorithms for the variable length scheduling problem.
Theor. Comput. Sci., 2003

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.
J. Discrete Algorithms, 2003

Large 2-Independent Sets of Regular Graphs.
Electr. Notes Theor. Comput. Sci., 2003

2002
An Upper Bound on the Space Complexity of Random Formulae in Resolution.
ITA, 2002

Packing Edges in Random Regular Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
Efficient web searching using temporal factors.
Theor. Comput. Sci., 2001

A predicative and decidable characterization of the polynomial classes of languages.
Theor. Comput. Sci., 2001

The unsatisfiability threshold revisited.
Electronic Notes in Discrete Mathematics, 2001

An Upper Bound on the Space Complexity of Random Formulae in Resolution
Electronic Colloquium on Computational Complexity (ECCC), 2001

Leafy spanning trees in hypercubes.
Appl. Math. Lett., 2001

Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Greedy Algorithms for Minimisation Problems in Random Regular Graphs.
Proceedings of the Algorithms, 2001

2000
Complexity-theoretic models of phase transitions in search problems.
Theor. Comput. Sci., 2000

Linear Time Maximum Induced Matching Algorithm for Trees.
Nord. J. Comput., 2000

Sparse Hypercube 3-spanners.
Discrete Applied Mathematics, 2000

Small Maximal Matchings in Random Graphs.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Maximum Induced Matchings of Random Cubic Graphs.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
Induced Matchings in Regular Graphs and Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Efficient Web Searching Using Temporal Factors.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
An Inproved Upper Bound on the Non-3-Colourability Threshold.
Inf. Process. Lett., 1998

On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F).
Acta Inf., 1998

1997
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
RNC Algorithms for the Uniform Generation of Combinatorial Structures.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996


  Loading...