Zito, Michele - Department of Computer Science, University of Liverpool

Advanced Search

Browse by Discipline

Scientific Societies

E-print Network

FAQ • HELP • SITE MAP • CONTACT US

Powered by Explorit

Advanced Search

Zito, Michele - Department of Computer Science, University of Liverpool

Greedy algorithms for minimisation problems in random regular graphs
RNC Algorithms for the Uniform Generation of Combinatorial Structures
THE LIBRARY Tel: +44 1203 523523
Dominating Sets in Web Graphs Colin Cooper1
Coupon collectors, -binomial coefficients and the
The unsatisfiability threshold conjecture: the techniques behind upper bound improvements
On the Approximability of the Maximum Induced Matching Problem
On the Complexity of the Empire Colouring Michele Zito

Website Policies/Important Links