# Lubos Thoma

According to our database

Collaborative distances:

^{1}, Lubos Thoma authored at least 13 papers between 1996 and 2005.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2005

On Cover Graphs and Dependent Arcs in Acyclic Orientations.

Combinatorics, Probability & Computing, 2005

2004

Bipartite Subgraphs and Quasi-Randomness.

Graphs and Combinatorics, 2004

2003

An Optimal Algorithm for Checking Regularity.

SIAM J. Comput., 2003

2002

An optimal algorithm for checking regularity (extended abstract).

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

G-Intersecting Families.

Combinatorics, Probability & Computing, 2001

Vertex Covers by Edge Disjoint Cliques.

Combinatorica, 2001

2000

A Note on Random Minimum Length Spanning Trees.

Electr. J. Comb., 2000

Note on Sparse Random Graphs and Cover Graphs.

Electr. J. Comb., 2000

1999

On Perfect Matchings and Hamilton Cycles in Sums of Random Trees.

SIAM J. Discrete Math., 1999

1997

Convergence of probabilities for the second order monadic properties of a random mapping.

Random Struct. Algorithms, 1997

On the Size of Set Systems on [n] Not Containing Weak (r, Delta)-Systems.

J. Comb. Theory, Ser. A, 1997

On the limit values of probabilities for the first order properties of graphs.

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Asymptotic packing and the random greedy algorithm.

Random Struct. Algorithms, 1996