A generalization of Janson inequalities and its application to finding shortest paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Finding a large hidden clique in a random graph
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scalable analysis and design of ad hoc networks via random graph theory
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Complex Probabilistic Modeling with Recursive Relational Bayesian Networks
Annals of Mathematics and Artificial Intelligence
Buckets Strike Back: Improved Parallel Shortest Paths
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Coloring Sparse Random Graphs in Polynominal Average Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Finding Large Independent Sets in Polynomial Expected Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Choice Number of Random Hypergraphs
Combinatorics, Probability and Computing
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
On the typical case complexity of graph optimization
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An improved algorithm for approximating the chromatic number of Gn,p
Information Processing Letters
Finding Large Independent Sets in Polynomial Expected Time
Combinatorics, Probability and Computing
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Combinatorics, Probability and Computing
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms
Solving NP-hard semirandom graph problems in polynomial expected time
Journal of Algorithms
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Stochastic packing-market planning
Proceedings of the 8th ACM conference on Electronic commerce
Approximating almost all instances of MAX-CUT within a ratio above the håstad threshold
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
Improved random graph isomorphism
Journal of Discrete Algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximately Counting Embeddings into Random Graphs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Large independent sets in random regular graphs
Theoretical Computer Science
On the typical case complexity of graph optimization
Discrete Applied Mathematics
Max k-cut and approximating the chromatic number of random graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Average case analysis of algorithms
Algorithms and theory of computation handbook
Finding cliques by quantum adiabatic evolution
Quantum Information & Computation
The MAX-CUT of sparse random graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Boosting spectral partitioning by sampling and iteration
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On independent sets in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximating the statistics of various properties in randomly weighted graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The smoothed complexity of edit distance
ACM Transactions on Algorithms (TALG)
Uncover low degree vertices and minimise the mess: independent sets in random regular graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
All-pairs shortest paths in O(n2) time with high probability
Journal of the ACM (JACM)
Constructions of independent sets in random intersection graphs
Theoretical Computer Science
| Hi-index | 0.00 |