|
Search the dblp DataBase
Michael S. O. Molloy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou
Random Constraint Satisfaction: A More Accurate Picture. [Citation Graph (0, 0)][DBLP] CP, 1997, pp:107-120 [Conf]
- Dimitris Achlioptas, Michael S. O. Molloy
The Analysis of a List-Coloring Algorithm on a Random Graph. [Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:204-212 [Conf]
- Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel
Sampling Grid Colorings with Fewer Colors. [Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:80-89 [Conf]
- Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy
A sharp threshold in proof complexity. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:337-346 [Conf]
- Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc
Random Constraint Satisfaction: A More Accurate Picture. [Citation Graph (0, 0)][DBLP] Constraints, 2001, v:6, n:4, pp:329-344 [Journal]
- Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy
A sharp threshold in proof complexity yields lower bounds for satisfiability search. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:2, pp:238-268 [Journal]
- Babak Farzad, Michael S. O. Molloy, Bruce A. Reed
(Delta-k)-critical graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:173-185 [Journal]
- Michael S. O. Molloy, Bruce A. Reed
A Bound on the Strong Chromatic Index of a Graph, . [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:103-109 [Journal]
- Michael S. O. Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald
1-Factorizations of random regular graphs. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1997, v:10, n:3, pp:305-321 [Journal]
- Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy
The existence of uniquely -G colourable graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:179, n:1-3, pp:1-11 [Journal]
Search in 0.019secs, Finished in 0.020secs
|