Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Algorithms for the Random Cluster Graph Model
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Finding Large Independent Sets in Polynomial Expected Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Max Cut for Random Graphs with a Planted Partition
Combinatorics, Probability and Computing
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
How randomized search heuristics find maximum cliques in planar graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Smoothed analysis of binary search trees
Theoretical Computer Science
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Spectral clustering with limited independence
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
On the tractability of coloring semirandom graphs
Information Processing Letters
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding mount everest and handling voids
Evolutionary Computation
Finding a maximum independent set in a sparse random graph
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Coloring random 3-colorable graphs with non-uniform edge probabilities
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The smoothed complexity of edit distance
ACM Transactions on Algorithms (TALG)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.03 |