Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Zito 0001
Person information
- affiliation: University of Liverpool, Department of Computer Science, United Kingdom
Other persons with the same name
- Michele Zito 0002 — University G. d'Annunzio of Chieti-Pescara, Department of Medicine and Science of Ageing, Chieti, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1999
[b1]Michele A. A. Zito:
Randomised techniques in combinatorial algorithmics. University of Warwick, Coventry, UK, 1999
Journal Articles
- 2024
- [j32]Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-connectivity for node failure identification in Boolean Network Tomography. Inf. Process. Lett. 184: 106450 (2024) - 2021
- [j31]Patrick Totzke, Michele Zito:
Report on BCTCS 2021. Bull. EATCS 134 (2021) - 2020
- [j30]Pavan Sangha, Michele Zito:
Independent sets in Line of Sight networks. Discret. Appl. Math. 286: 100-115 (2020) - [j29]Pavan Sangha, Prudence W. H. Wong, Michele Zito:
Dynamic programming optimization in line of sight networks. Inf. Comput. 270 (2020) - 2019
- [j28]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): 173-188 (2019) - 2018
- [j27]Theo Karaboghossian, Michele Zito:
Easy knapsacks and the complexity of energy allocation problems in the smart grid. Optim. Lett. 12(7): 1553-1568 (2018) - 2014
- [j26]Andrew R. A. McGrae, Michele Zito:
The Complexity of the Empire Colouring Problem. Algorithmica 68(2): 483-503 (2014) - 2013
- [j25]Andrew R. A. McGrae, Michele Zito:
The complexity of the empire colouring problem for linear forests. Discret. Math. 313(11): 1248-1255 (2013) - [j24]Chuntao Jiang, Frans Coenen, Michele Zito:
A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28(1): 75-105 (2013) - 2010
- [j23]Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito:
Text classification using graph mining-based feature extraction. Knowl. Based Syst. 23(4): 302-308 (2010) - 2009
- [j22]Andrew R. A. McGrae, Michele Zito:
The Block Connectivity of Random Trees. Electron. J. Comb. 16(1) (2009) - [j21]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): 2010-2014 (2009) - [j20]William Duckworth, Michele Zito:
Large independent sets in random regular graphs. Theor. Comput. Sci. 410(50): 5236-5243 (2009) - 2008
- [j19]Mihalis Beis, William Duckworth, Michele Zito:
Packing vertices and edges in random regular graphs. Random Struct. Algorithms 32(1): 20-37 (2008) - 2007
- [j18]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. Discret. Appl. Math. 155(12): 1525-1538 (2007) - 2006
- [j17]Michele Zito, Colin Cooper:
Dominating sets of random recursive trees. Electron. Notes Discret. Math. 27: 107-108 (2006) - 2005
- [j16]Mihalis Beis, William Duckworth, Michele Zito:
Large k-independent sets of regular graphs. Electron. Notes Discret. Math. 19: 321-327 (2005) - [j15]Colin Cooper, Ralf Klasing, Michele Zito:
Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Math. 2(3): 275-300 (2005) - [j14]William Duckworth, David F. Manlove, Michele Zito:
On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1): 79-91 (2005) - 2003
- [j13]William Duckworth, Nicholas C. Wormald, Michele Zito:
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. Discrete Algorithms 1(1): 67-76 (2003) - [j12]Michele Zito:
Small maximal matchings in random graphs. Theor. Comput. Sci. 297(1-3): 487-507 (2003) - [j11]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): 489-495 (2003) - 2002
- [j10]Michele Zito:
An Upper Bound on the Space Complexity of Random Formulae in Resolution. RAIRO Theor. Informatics Appl. 36(4): 329-339 (2002) - 2001
- [j9]William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito:
Leafy spanning trees in hypercubes. Appl. Math. Lett. 14(7): 801-804 (2001) - [j8]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. Electron. Notes Discret. Math. 9: 81-95 (2001) - [j7]Salvatore Caporaso, Michele Zito, Nicola Galesi:
A predicative and decidable characterization of the polynomial classes of languages. Theor. Comput. Sci. 250(1-2): 83-99 (2001) - [j6]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): 569-582 (2001) - 2000
- [j5]William Duckworth, Michele Zito:
Sparse Hypercube 3-spanners. Discret. Appl. Math. 103(1-3): 289-295 (2000) - [j4]Michele Zito:
Linear Time Maximum Induced Matching Algorithm for Trees. Nord. J. Comput. 7(1): 58- (2000) - [j3]Paul E. Dunne, Alan Gibbons, Michele Zito:
Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249(2): 243-263 (2000) - 1998
- [j2]Salvatore Caporaso, Michele Zito:
On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F). Acta Informatica 35(8): 665-672 (1998) - [j1]Paul E. Dunne, Michele Zito:
An Inproved Upper Bound on the Non-3-Colourability Threshold. Inf. Process. Lett. 65(1): 17-23 (1998)
Conference and Workshop Papers
- 2023
- [c37]Hankang Gu, Michele Zito:
Minimum Degree and Connectivity in 1-Dimensional Line-of-Sight Networks. ALGOWIN 2023: 58-73 - 2022
- [c36]Elektra Kypridemou, Michele Zito, Marco Bertamini:
Perception of Node-Link Diagrams: The Effect of Layout on the Perception of Graph Properties. Diagrams 2022: 364-367 - [c35]Elektra Kypridemou, Michele Zito, Marco Bertamini:
The Effect of Graph Layout on the Perception of Graph Density: An Empirical Study. EuroVis (Short Papers) 2022: 31-35 - 2020
- [c34]Elektra Kypridemou, Michele Zito, Marco Bertamini:
The Effect of Graph Layout on the Perception of Graph Properties. EuroVis (Short Papers) 2020: 1-5 - 2019
- [c33]Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography. ALGOSENSORS 2019: 79-95 - 2017
- [c32]Pavan Sangha, Prudence W. H. Wong, Michele Zito:
Independent Sets in Restricted Line of Sight Networks. ALGOSENSORS 2017: 211-222 - [c31]Pavan Sangha, Michele Zito:
Finding Large Independent Sets in Line of Sight Networks. CALDAM 2017: 332-343 - 2015
- [c30]Mohamed K. Arikiez, Floriana Grasso, Michele Zito:
Heuristics for the cost-effective management of a temperature controlled environment. ISGT Asia 2015: 1-6 - [c29]Mohamed K. Arikiez, Floriana Grasso, Michele Zito:
Heuristic algorithm for coordinating smart houses in MicroGrid. SmartGridComm 2015: 49-54 - 2014
- [c28]Wen Yu, Frans Coenen, Michele Zito, Kwankamon Dittakan:
Classification of 3D Surface Data Using the Concept of Vertex Unique Labelled Subgraphs. ICDM Workshops 2014: 47-54 - 2013
- [c27]Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi:
Vertex Unique Labelled Subgraph Mining for Vertex Label Classification. ADMA (1) 2013: 542-553 - [c26]Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi:
Minimal Vertex Unique Labelled Subgraph Mining. DaWaK 2013: 317-326 - [c25]Mohamed K. Arikiez, Peter Gatens, Floriana Grasso, Michele Zito:
Smart domestic renewable energy management using knapsack. ISGT Europe 2013: 1-5 - [c24]Wen Yu, Frans Coenen, Michele Zito, Subhieh El-Salhi:
Vertex Unique Labelled Subgraph Mining. SGAI Conf. 2013: 21-37 - 2011
- [c23]Ayesh Alshukri, Frans Coenen, Michele Zito:
Incremental Web-Site Boundary Detection Using Random Walks. MLDM 2011: 414-427 - [c22]Ayesh Alshukri, Frans Coenen, Michele Zito:
Web-Site Boundary Detection Using Incremental RandomWalk Clustering. SGAI Conf. 2011: 255-268 - [c21]Andrew R. A. McGrae, Michele Zito:
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. WG 2011: 179-190 - 2010
- [c20]Chuntao Jiang, Frans Coenen, Michele Zito:
Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach. ADMA (1) 2010: 405-416 - [c19]Chuntao Jiang, Frans Coenen, Michele Zito:
Frequent Sub-graph Mining on Edge Weighted Graphs. DaWak 2010: 77-88 - [c18]Ayesh Alshukri, Frans Coenen, Michele Zito:
Web-Site Boundary Detection. ICDM 2010: 529-543 - 2009
- [c17]Colin Cooper, Andrew R. A. McGrae, Michele Zito:
Martingales on Trees and the Empire Chromatic Number of Random Trees. FCT 2009: 74-83 - [c16]Chuntao Jiang, Frans Coenen, Robert Sanderson, Michele Zito:
Text Classification using Graph Mining-based Feature Extraction. SGAI Conf. 2009: 21-34 - 2008
- [c15]Andrew R. A. McGrae, Michele Zito:
Colouring Random Empire Trees. MFCS 2008: 515-526 - 2007
- [c14]William Duckworth, Michele Zito:
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. MFCS 2007: 56-66 - [c13]Colin Cooper, Michele Zito:
Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD 2007: 398-405 - 2005
- [c12]Mihalis Beis, William Duckworth, Michele Zito:
Large k-Separated Matchings of Random Regular Graphs. ACSC 2005: 175-182 - 2004
- [c11]Colin Cooper, Ralf Klasing, Michele Zito:
Dominating Sets in Web Graphs. WAW 2004: 31-43 - 2003
- [c10]William Duckworth, Michele Zito:
Large 2-Independent Sets of Regular Graphs. CATS 2003: 223-235 - 2002
- [c9]Mihalis Beis, William Duckworth, Michele Zito:
Packing Edges in Random Regular Graphs. MFCS 2002: 118-130 - 2001
- [c8]Michele Zito:
Greedy Algorithms for Minimisation Problems in Random Regular Graphs. ESA 2001: 524-536 - [c7]Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS 2001: 328-338 - 2000
- [c6]William Duckworth, Nicholas C. Wormald, Michele Zito:
Maximum Induced Matchings of Random Cubic Graphs. COCOON 2000: 34-43 - [c5]Michele Zito:
Small Maximal Matchings in Random Graphs. LATIN 2000: 18-27 - 1999
- [c4]Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305 - [c3]Michele Zito:
Induced Matchings in Regular Graphs and Trees. WG 1999: 89-100 - 1997
- [c2]Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino:
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. CIAC 1997: 61-73 - 1996
- [c1]Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons:
RNC Algorithms for the Uniform Generation of Combinatorial Structures. SODA 1996: 429-437
Parts in Books or Collections
- 2006
- [p1]Lefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito:
The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements. Computational Complexity and Statistical Physics 2006: 159-178
Reference Works
- 2009
- [r1]Colin Cooper, Michele Zito:
Realistic Data for Testing Rule Mining Algorithms. Encyclopedia of Data Warehousing and Mining 2009: 1653-1658
Informal and Other Publications
- 2018
- [i4]Pavan Sangha, Prudence W. H. Wong, Michele Zito:
Dynamic Programming Optimization in Line of Sight Networks. CoRR abs/1806.01581 (2018) - [i3]Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography. CoRR abs/1812.01637 (2018) - 2011
- [i2]Andrew R. A. McGrae, Michele Zito:
The Complexity of the Empire Colouring Problem. CoRR abs/1109.2162 (2011) - 2001
- [i1]Michele Zito:
An Upper Bound on the Space Complexity of Random Formulae in Resolution. Electron. Colloquium Comput. Complex. TR01 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-20 00:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
