Inexpensive d-dimensional matchings
Random Structures & Algorithms
Perfect matchings in random graphs with prescribed minimal degree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Packing Edges in Random Regular Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Asymptotic enumeration of sparse graphs with a minimum degree constraint
Journal of Combinatorial Theory Series A
Linear phase transition in random linear constraint satisfaction problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Counting connected graphs inside-out
Journal of Combinatorial Theory Series B
Large k-separated matchings of random regular graphs
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
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
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
Push-relabel based algorithms for the maximum transversal problem
Computers and Operations Research
| Hi-index | 0.00 |