Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Zito, Michele"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of the empire colouring problem
Andrew R.A. McGrae
,
Michele Zito
Algorithmica
68
(2), 2014, pp. 483-503
Empires make cartography hard: The complexity of the empire colouring problem
Andrew R.A. McGrae
,
Michele Zito
Lecture Notes in Computer Science
6986
, 2011, pp. 179-190
Large independent sets in random regular graphs
William Duckworth
,
Michele Zito
Theoretical Computer Science
410
(50), 2009, pp. 5236-5243
Colouring random empire trees
Andrew R. McGrae
,
Michele Zito
Lecture Notes in Computer Science
5162
, 2008, pp. 515-526
Uncover low degree vertices and minimise the mess: Independent sets in random regular graphs
William Duckworth
,
Michele Zito
Lecture Notes in Computer Science
4708
, 2007, pp. 56-66
On polynomial-time approximation algorithms for the variable length scheduling problem
Artur Czumaj
,
Leszek Ga̧sieniec
,
Daya Ram Gaur
,
Ramesh Krishnamurti
,
Wojciech Rytter
,
Michele Zito
Theoretical Computer Science
302
(1-3), 2003, pp. 489-495
Smalll maximal matchings in random graphs
Michele Zito
Theoretical Computer Science
297
(1-3), 2003, pp. 487-507
Packing edges in random regular graphs
Mihalis Beis
,
William Duckworth
,
Michele Zito
Lecture Notes in Computer Science
2420
, 2002, pp. 118-130
Efficient web searching using temporal factors
Artur Czumaj
,
Ian Finch
,
Leszek Ga̧sieniec
,
Alan Gibbons
,
Paul Leng
,
Wojciech Rytter
,
Michele Zito
Theoretical Computer Science
262
(1-2), 2001, pp. 569-582
Greedy algorithms for minimisation problems in random regular graphs
Michele Zito
Lecture Notes in Computer Science
2161
, 2001, pp. 524-536
An upper bound on the space complexity of random formulae in resolution
Michele Zito
Technical Report (TR01-079), 2001
Maximum induced matchings of random cubic graphs
William Duckworth
,
Nicholas C. Wormald
,
Michele Zito
Lecture Notes in Computer Science
1858
, 2000, pp. 34-43
Complexity-theoretic models of phase transitions in search problems
Paul E. Dunne
,
Alan Gibbons
,
Michele Zito
Theoretical Computer Science
249
(2), 2000, pp. 243-263
Efficient Web searching using temporal factors
Artur Czumaj
,
Ian Finch
,
Leszek Ga̧sieniec
,
Alan Gibbons
,
Paul Leng
,
Wojciech Rytter
,
Michele Zito
Lecture Notes in Computer Science
1663
, 1999, pp. 294-305
Induced matchings in regular graphs and trees
Michele Zito
Lecture Notes in Computer Science
1665
, 1999, pp. 89-100
On a relation between uniform coding and problems of the form DTIMEF(
\cal F
)=?DSPACEF(
\cal F
)
Salvatore Caporaso
,
Michele Zito
Acta Informatica
35
(8), 1998, pp. 665-672
An improved upper bound on the non-3-colourability threshold
Paul E. Dunne
,
Michele Zito
Information Processing Letters
65
(1), 1998, pp. 17-23
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
RNC algorithms for the uniform generation of combinatorial structures
Michele Zito
,
Ida Pu
,
Martyn Amos
,
Alan Gibbons
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 429-437