Amin Coja-Oghlan
Loading Google Thumbnails...
| 2011 |
|---|
| 9 | On the solution-space geometry of random constraint satisfaction problems. Dimitris Achlioptas, Federico Ricci-Tersenghi, Federico Ricci-Tersenghi. Random Struct. Algorithms (38): 251-268 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 8 | Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht. SIAM J. Comput. (39): 2336-2362 (2010). Web SearchBibTeXDownload |
| 2008 |
|---|
| 7 | Algorithmic Barriers from Phase Transitions. Dimitris Achlioptas, Amin Coja-Oghlan. FOCS 2008, 793-802. Web SearchBibTeXDownload |
| 2007 |
|---|
| 6 | Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht. ICALP 2007, 789-800. Web SearchBibTeXDownload |
| 5 | Separating Populations with Wide Data: A Spectral Analysis. Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuheng Zhou. ISAAC 2007, 439-451. Web SearchBibTeXDownload |
| 4 | Counting connected graphs and hypergraphs via the probabilistic method. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Random Struct. Algorithms (31): 288-329 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 3 | MAX k-CUT and approximating the chromatic number of random graphs. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. Random Struct. Algorithms (28): 289-322 (2006). Web SearchBibTeXDownload |
| 2004 |
|---|
| 2 | Counting Connected Graphs and Hypergraphs via the Probabilistic Method. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. APPROX-RANDOM 2004, 322-333. Web SearchBibTeXDownload |
| 2003 |
|---|
| 1 | MAX k-CUT and Approximating the Chromatic Number of Random Graphs. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani. ICALP 2003, 200-211. Web SearchBibTeXDownload |
from DBLP and Google Scholar
