Almost all graphs with average degree 4 are 3-colorable
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Greedy Local Search and Vertex Cover in Sparse Random Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Finding a maximum matching in a sparse random graph in O(n) expected time
Journal of the ACM (JACM)
Parallel greedy graph matching using an edge partitioning approach
Proceedings of the fourth international workshop on High-level parallel programming and applications
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The rank of diluted random graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Independent sets in random graphs from the weighted second moment method
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Practical computation of optimal schedules in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
A new approach to the orientation of random hypergraphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On independent sets in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Karp-sipser on random graphs with a fixed degree sequence
Combinatorics, Probability and Computing
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Theoretical Computer Science
An analysis of one-dimensional schelling segregation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: The cook-book approach to the differential equation method
Computer Science Review
A GPU algorithm for greedy graph matching
Facing the Multicore-Challenge II
Stochastic matching with commitment
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A more reliable greedy heuristic for maximum matchings in sparse random graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Limits of local algorithms over sparse random graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |