Algorithmic barriers from phase transitions D Achlioptas, A Coja-Oghlan 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 793-802, 2008 | 219 | 2008 |

Graph partitioning via adaptive spectral techniques A Coja-Oghlan Combinatorics, Probability & Computing 19 (2), 227, 2010 | 153 | 2010 |

The asymptotic k-SAT threshold A Coja-Oghlan, K Panagiotou Advances in Mathematics 288, 985-1068, 2016 | 87 | 2016 |

On the solution‐space geometry of random constraint satisfaction problems D Achlioptas, A Coja‐Oghlan, F Ricci‐Tersenghi Random Structures & Algorithms 38 (3), 251-268, 2011 | 80 | 2011 |

A spectral heuristic for bisecting random graphs A Coja‐Oghlan Random Structures & Algorithms 29 (3), 351-398, 2006 | 69 | 2006 |

The condensation transition in random hypergraph 2-coloring A Coja-Oghlan, L Zdeborová Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 66 | 2012 |

On independent sets in random graphs A Coja‐Oghlan, C Efthymiou Random Structures & Algorithms 47 (3), 436-486, 2015 | 64 | 2015 |

Information-theoretic thresholds from the cavity method A Coja-Oghlan, F Krzakala, W Perkins, L Zdeborová Advances in Mathematics 333, 694-795, 2018 | 62 | 2018 |

Chasing the k-colorability threshold A Coja-Oghlan, D Vilenchik 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 380-389, 2013 | 60 | 2013 |

On the Laplacian eigenvalues of Gn, p A Coja-Oghlan Combinatorics, Probability & Computing 16 (6), 923, 2007 | 56 | 2007 |

Finding planted partitions in random graphs with general degree distributions A Coja-Oghlan, A Lanka SIAM Journal on Discrete Mathematics 23 (4), 1682-1714, 2010 | 52 | 2010 |

A Better Algorithm for Random *k*-SATA Coja-Oghlan SIAM Journal on Computing 39 (7), 2823-2864, 2010 | 51 | 2010 |

A Better Algorithm for Random *k*-SATA Coja-Oghlan SIAM Journal on Computing 39 (7), 2823-2864, 2010 | 51 | 2010 |

Going after the k-SAT threshold A Coja-Oghlan, K Panagiotou Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 47 | 2013 |

The condensation phase transition in random graph coloring V Bapst, A Coja-Oghlan, S Hetterich, F Raßmann, D Vilenchik Communications in Mathematical Physics 341 (2), 543-606, 2016 | 45 | 2016 |

Catching the k-NAESAT threshold A Coja-Oglan, K Panagiotou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 43 | 2012 |

Contagious sets in expanders A Coja-Oghlan, U Feige, M Krivelevich, D Reichman Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 42 | 2014 |

Upper-bounding the k-colorability threshold by counting covers A Coja-Oghlan arXiv preprint arXiv:1305.0177, 2013 | 39 | 2013 |

The Lovász number of random graphs A Coja-Oghlan Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003 | 39 | 2003 |

The Lovász number of random graphs A Coja-Oghlan Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003 | 39 | 2003 |