Finding hidden Hamiltonian cycles
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Mixing time and long paths in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Hamilton cycles in random subgraphs of pseudo-random graphs
Discrete Mathematics
The cover time of sparse random graphs.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Many hard examples in exact phase transitions
Theoretical Computer Science
High-performance adaptive routing for networks with arbitrary topology
Journal of Systems Architecture: the EUROMICRO Journal
Controlled Markov chains, graphs, and Hamiltonicity
Foundations and Trends® in Stochastic Systems
Random Structures & Algorithms
The Gn,mphase transition is not hard for the Hamiltonian cycle problem
Journal of Artificial Intelligence Research
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A distributed algorithm to find hamiltonian cycles in g(np) random graphs
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
A SAT based effective algorithm for the directed hamiltonian cycle problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
| Hi-index | 0.00 |