Lubos Thoma Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2005
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vojtech Rödl, Lubos Thoma: On Cover Graphs and Dependent Arcs in Acyclic Orientations. Combinatorics, Probability & Computing 14(4): 585-617 (2005)
2004
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jozef Skokan, Lubos Thoma: Bipartite Subgraphs and Quasi-Randomness. Graphs and Combinatorics 20(2): 255-262 (2004)
2003
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma: An Optimal Algorithm for Checking Regularity. SIAM J. Comput. 32(5): 1210-1235 (2003)
2002
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma: An optimal algorithm for checking regularity (extended abstract). SODA 2002: 277-286
2001
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Vertex Covers by Edge Disjoint Cliques. Combinatorica 21(2): 171-197 (2001)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: G-Intersecting Families. Combinatorics, Probability & Computing 10(5): 367-384 (2001)
2000
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Note on Sparse Random Graphs and Cover Graphs. Electr. J. Comb. 7 (2000)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: A Note on Random Minimum Length Spanning Trees. Electr. J. Comb. 7 (2000)
1999
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vojtech Rödl, Lubos Thoma: Asymptotic packing and the random greedy algorithm. Random Struct. Algorithms 8(3): 161-177 (1996)

Coauthor Index

1Tom Bohman
[j8] [j7] [j6]
2Alan M. Frieze
[j8] [j7] [j6] [j5] [j4]
3Michal Karonski
[j4]
4Yoshiharu Kohayakawa
[j9] [c1]
5Tomasz Luczak
[j2]
6Miklós Ruszinkó
[j8] [j7] [j6] [j5]
7Vojtech Rödl
[j11] [j9] [c1] [j3] [j1]
8Jozef Skokan
[j10]
Last update Wed May 22 22:15:16 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page