| 2005 |
|---|
| 12 | EE | Vojtech Rödl,
Lubos Thoma:
On Cover Graphs and Dependent Arcs in Acyclic Orientations.
Combinatorics, Probability & Computing 14(4): 585-617 (2005) |
| 2004 |
|---|
| 11 | EE | Jozef Skokan,
Lubos Thoma:
Bipartite Subgraphs and Quasi-Randomness.
Graphs and Combinatorics 20(2): 255-262 (2004) |
| 2003 |
|---|
| 10 | EE | Yoshiharu Kohayakawa,
Vojtech Rödl,
Lubos Thoma:
An Optimal Algorithm for Checking Regularity.
SIAM J. Comput. 32(5): 1210-1235 (2003) |
| 2002 |
|---|
| 9 | EE | Yoshiharu Kohayakawa,
Vojtech Rödl,
Lubos Thoma:
An optimal algorithm for checking regularity (extended abstract).
SODA 2002: 277-286 |
| 2001 |
|---|
| 8 | EE | Tom Bohman,
Alan M. Frieze,
Miklós Ruszinkó,
Lubos Thoma:
Vertex Covers by Edge Disjoint Cliques.
Combinatorica 21(2): 171-197 (2001) |
| 7 | | Tom Bohman,
Alan M. Frieze,
Miklós Ruszinkó,
Lubos Thoma:
G-Intersecting Families.
Combinatorics, Probability & Computing 10(5): (2001) |
| 2000 |
|---|
| 6 | EE | Alan M. Frieze,
Miklós Ruszinkó,
Lubos Thoma:
A Note on Random Minimum Length Spanning Trees.
Electr. J. Comb. 7: (2000) |
| 5 | EE | Tom Bohman,
Alan M. Frieze,
Miklós Ruszinkó,
Lubos Thoma:
Note on Sparse Random Graphs and Cover Graphs.
Electr. J. Comb. 7: (2000) |
| 1999 |
|---|
| 4 | EE | Alan M. Frieze,
Michal Karonski,
Lubos Thoma:
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees.
SIAM J. Discrete Math. 12(2): 208-216 (1999) |
| 1997 |
|---|
| 3 | EE | Vojtech Rödl,
Lubos Thoma:
On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems.
J. Comb. Theory, Ser. A 80(1): 166-173 (1997) |
| 2 | | Tomasz Luczak,
Lubos Thoma:
Convergence of probabilities for the second order monadic properties of a random mapping.
Random Struct. Algorithms 11(3): 277-295 (1997) |
| 1996 |
|---|
| 1 | | Vojtech Rödl,
Lubos Thoma:
Asymptotic packing and the random greedy algorithm.
Random Struct. Algorithms 8(3): 161-177 (1996) |
