| Publication | Date of Publication | Type |
|---|
| Chasing the k-colorability threshold | 2025-05-20 | Paper |
Semirandom models as benchmarks for coloring algorithms
2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
| On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm | 2019-05-06 | Paper |
The chromatic number of random graphs for most average degrees
IMRN. International Mathematics Research Notices | 2018-12-12 | Paper |
Constructing cospectral graphs via a new form of graph product
Linear and Multilinear Algebra | 2018-08-13 | Paper |
| The condensation phase transition in random graph coloring | 2017-03-22 | Paper |
The condensation phase transition in random graph coloring
Communications in Mathematical Physics | 2016-02-23 | Paper |
The condensation phase transition in random graph coloring
Communications in Mathematical Physics | 2016-02-23 | Paper |
Do semidefinite relaxations solve sparse PCA up to the information limit?
The Annals of Statistics | 2015-07-06 | Paper |
Do semidefinite relaxations solve sparse PCA up to the information limit?
The Annals of Statistics | 2015-07-06 | Paper |
Complete convergence of message passing algorithms for some satisfiability problems
Theory of Computing | 2014-10-06 | Paper |
Constructing uniquely realizable graphs
Discrete & Computational Geometry | 2014-01-24 | Paper |
Delaying satisfiability for random 2SAT
Random Structures & Algorithms | 2013-10-09 | Paper |
How hard is counting triangles in the streaming model?
Automata, Languages, and Programming | 2013-08-06 | Paper |
| Chasing the k-colorability threshold | 2013-04-03 | Paper |
| Edge distribution in generalized graph products | 2012-11-07 | Paper |
Getting a directed Hamilton cycle two times faster
Combinatorics, Probability and Computing | 2012-09-12 | Paper |
On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Smoothed analysis of balancing networks
Random Structures & Algorithms | 2011-08-09 | Paper |
Delaying satisfiability for random 2SAT
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Solving random satisfiable 3CNF formulas in expected polynomial time
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Why almost all satisfiable k-CNF formulas are easy | 2010-08-02 | Paper |
Message passing for the coloring problem: Gallager meets Alon and Kahale
(available as arXiv preprint) | 2010-08-02 | Paper |
| Message passing for the coloring problem: Gallager meets Alon and Kahale | 2010-08-02 | Paper |
On the tractability of coloring semirandom graphs
Information Processing Letters | 2010-06-09 | Paper |
Why almost all k-colorable graphs are easy to color
Theory of Computing Systems | 2010-05-05 | Paper |
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
On the random satisfiable process
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Small Clique Detection and Approximate Nash Equilibria
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Smoothed analysis of balancing networks
Lecture Notes in Computer Science | 2009-07-14 | Paper |
| scientific article; zbMATH DE number 5287580 (Why is no real title available?) | 2008-06-11 | Paper |
Why Almost All k-Colorable Graphs Are Easy
STACS 2007 | 2007-09-03 | Paper |
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
