Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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
Average-case completeness of a word problem for groups
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Average-case intractability vs. worst-case intractability
Information and Computation
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Exponential-time approximation of weighted set cover
Information Processing Letters
Saving space by algebraization
Proceedings of the forty-second ACM symposium on Theory of computing
Evaluation of permanents in rings and semirings
Information Processing Letters
A space-time tradeoff for permutation problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Yuri, logic, and computer science
Fields of logic and computation
Bandwidth and distortion revisited
Discrete Applied Mathematics
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Exact algorithms for exact satisfiability and number of perfect matchings
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
Finding optimal Bayesian networks using precedence constraints
The Journal of Machine Learning Research
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |