52 citations · 224 across the 34 of their papers we have counts for
Showing 2011 · cs.DMShow all
2 papers · 2 filters
cs.DM2011★ 52 cited
Catching the k-NAESAT Threshold
Amin Coja-Oghlan, Konstantinos Panagiotou
The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment m…
cs.DM2011
Explosive Percolation in Erdös-Rényi-Like Random Graph Processes
Konstantinos Panagiotou, Reto Spöhel, Angelika Steger +1
The evolution of the largest component has been studied intensely in a variety of random graph processes, starting in 1960 with the Erdös-Rényi process. It is well known that this…