Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
3-coloring in time O (1.3289n)
Journal of Algorithms
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Finding maximal cliques in massive networks by H*-graph
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Dominating set based exact algorithms for 3-coloring
Information Processing Letters
Finding maximal cliques in massive networks
ACM Transactions on Database Systems (TODS)
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Enumerating maximal independent sets with applications to graph colouring
Operations Research Letters
| Hi-index | 0.00 |