An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the complexity of approximating the independent set problem
Information and Computation
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
Journal of Algorithms
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Open problems around exact algorithms
Discrete Applied Mathematics
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Journal of Discrete Algorithms
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
ACM Transactions on Algorithms (TALG)
Journal of Discrete Algorithms
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
3-coloring in time O (1.3289n)
Journal of Algorithms
An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Solving NP-complete problems with quantum search
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the complexity of circuit satisfiability
Proceedings of the forty-second ACM symposium on Theory of computing
Discrete Applied Mathematics
Further improvement on maximum independent set in degree-4 graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A faster algorithm for the steiner tree problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Bounding the number of minimal dominating sets: a measure and conquer approach
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing optimal solutions for the MIN 3-SET COVERING problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Maximum independent set in graphs of average degree at most three in O(1.08537n)
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A bottom-up method and fast algorithms for MAX INDEPENDENT SET
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Exact algorithms for finding the minimum independent dominating set in graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A simple and fast algorithm for maximum independent set in 3-degree graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A faster algorithm for finding maximum independent sets in sparse graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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
Theoretical Computer Science
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.00 |