Michele Zito

2007
30	EE	William Duckworth, Michele Zito: Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. MFCS 2007: 56-66
29	EE	Colin Cooper, Michele Zito: Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. PKDD 2007: 398-405
28	EE	Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito: The unsatisfiability threshold revisited. Discrete Applied Mathematics 155(12): 1525-1538 (2007)
2005
27	EE	Mihalis Beis, William Duckworth, Michele Zito: Large k-Separated Matchings of Random Regular Graphs. ACSC 2005: 175-182
26		Colin Cooper, Ralf Klasing, Michele Zito: Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics 2(3): (2005)
25	EE	William Duckworth, David Manlove, Michele Zito: On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3(1): 79-91 (2005)
2004
24	EE	Colin Cooper, Ralf Klasing, Michele Zito: Dominating Sets in Web Graphs. WAW 2004: 31-43
2003
23	EE	William Duckworth, Michele Zito: Large 2-Independent Sets of Regular Graphs. Electr. Notes Theor. Comput. Sci. 78: (2003)
22	EE	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)
21	EE	Michele Zito: Small maximal matchings in random graphs. Theor. Comput. Sci. 1-3(297): 487-507 (2003)
20	EE	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
19	EE	Mihalis Beis, William Duckworth, Michele Zito: Packing Edges in Random Regular Graphs. MFCS 2002: 118-130
18	EE	Michele Zito: An Upper Bound on the Space Complexity of Random Formulae in Resolution. ITA 36(4): 329-339 (2002)
2001
17	EE	Michele Zito: Greedy Algorithms for Minimisation Problems in Random Regular Graphs. ESA 2001: 524-536
16	EE	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
15	EE	William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito: Leafy spanning trees in hypercubes. Appl. Math. Lett. 14(7): 801-804 (2001)
14	EE	Michele Zito: An Upper Bound on the Space Complexity of Random Formulae in Resolution Electronic Colloquium on Computational Complexity (ECCC)(079): (2001)
13	EE	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)
12	EE	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
11	EE	William Duckworth, Nicholas C. Wormald, Michele Zito: Maximum Induced Matchings of Random Cubic Graphs. COCOON 2000: 34-43
10		Michele Zito: Small Maximal Matchings in Random Graphs. LATIN 2000: 18-27
9		William Duckworth, Michele Zito: Sparse Hypercube 3-spanners. Discrete Applied Mathematics 103(1-3): 289-295 (2000)
8		Michele Zito: Linear Time Maximum Induced Matching Algorithm for Trees. Nord. J. Comput. 7(1): 58- (2000)
7	EE	Paul E. Dunne, Alan Gibbons, Michele Zito: Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249(2): 243-263 (2000)
1999
6	EE	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
5	EE	Michele Zito: Induced Matchings in Regular Graphs and Trees. WG 1999: 89-100
1998
4	EE	Salvatore Caporaso, Michele Zito: On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F). Acta Inf. 35(8): 665-672 (1998)
3	EE	Paul E. Dunne, Michele Zito: An Inproved Upper Bound on the Non-3-Colourability Threshold. Inf. Process. Lett. 65(1): 17-23 (1998)
1997
2		Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino: Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. CIAC 1997: 61-73
1996
1		Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons: RNC Algorithms for the Uniform Generation of Combinatorial Structures. SODA 1996: 429-437

Coauthor Index

1	Martyn Amos	[1]
2	Mihalis Beis	[19] [27]
3	Salvatore Caporaso	[2] [4] [13]
4	Colin Cooper	[24] [26] [29]
5	Emanuele Covino	[2]
6	Artur Czumaj	[6] [12] [20]
7	William Duckworth	[9] [11] [15] [19] [22] [23] [25] [27] [30]
8	Paul E. Dunne (Paul E. S. Dunne)	[3] [7] [15]
9	Ian Finch	[6] [12]
10	Nicola Galesi	[2] [13]
11	Leszek Gasieniec	[6] [12] [20]
12	Daya Ram Gaur	[20]
13	Alan Gibbons	[1] [6] [7] [12] [15]
14	Alexis C. Kaporis	[16] [28]
15	Lefteris M. Kirousis	[16] [28]
16	Ralf Klasing	[24] [26]
17	Ramesh Krishnamurti	[20]
18	Paul H. Leng	[6] [12]
19	David Manlove	[25]
20	Ida Pu	[1]
21	Wojciech Rytter	[6] [12] [20]
22	Yannis C. Stamatiou	[16] [28]
23	Malvina Vamvakari	[16] [28]
24	Nicholas C. Wormald	[11] [22]

Colors in the list of coauthors