Travelled to:1 × Finland
1 × Greece
1 × Italy
1 × Poland
1 × Switzerland
1 × The Netherlands
3 × USA
Collaborated with:∅ K.Panagiotou A.Y.Pachon-Pinzon A.Lanka A.Steger C.Moore V.Sanwalani N.Alon H.Hàn M.Kang V.Rödl M.Schacht
Talks about:random (7) graph (6) sat (4) threshold (3) algorithm (2) spectral (2) chromat (2) number (2) degre (2) semirandom (1)
Person: Amin Coja-Oghlan
DBLP: Coja-Oghlan:Amin
Contributed to:
201420132012
201120092007200620042003Wrote 11 papers:
- STOC-2014-Coja-Oghlan #satisfiability
- The asymptotic k-SAT threshold (ACO), pp. 804–813.
- STOC-2013-Coja-OghlanP #satisfiability
- Going after the k-SAT threshold (ACO, KP), pp. 705–714.
- STOC-2012-Coja-OghlanP #satisfiability
- Catching the k-NAESAT threshold (ACO, KP), pp. 899–908.
- ICALP-v1-2011-Coja-OghlanP #process #random #satisfiability
- The Decimation Process in Random k-SAT (ACO, AYPP), pp. 305–316.
- ICALP-v1-2009-Coja-Oghlan #algorithm #random #satisfiability
- A Better Algorithm for Random k-SAT (ACO), pp. 292–303.
- ICALP-2007-AlonCHKRS #algorithm #graph
- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.
- ICALP-2007-Coja-OghlanPS #graph #on the #random
- On the Chromatic Number of Random Graphs (ACO, KP, AS), pp. 777–788.
- ICALP-v1-2006-Coja-Oghlan #adaptation #clustering #graph #heuristic #random
- An Adaptive Spectral Heuristic for Partitioning Random Graphs (ACO), pp. 691–702.
- ICALP-v1-2006-Coja-OghlanL #graph #random
- The Spectral Gap of Random Graphs with Given Expected Degrees (ACO, AL), pp. 15–26.
- ICALP-2004-Coja-Oghlan #graph
- Coloring Semirandom Graphs Optimally (ACO), pp. 383–395.
- ICALP-2003-Coja-OghlanMS #approximate #graph #random
- MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.