An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Corrections to Bierstone's Algorithm for Generating Cliques
Journal of the ACM (JACM)
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster exact solutions for some NP-hard problems
Theoretical Computer Science
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
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
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
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
3-coloring in time O (1.3289n)
Journal of Algorithms
The buffered work-pool approach for search-tree based optimization algorithms
PPAM'07 Proceedings of the 7th international conference on Parallel processing and 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
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
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
Theoretical Computer Science
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 14.99 |
A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski [7]. A technique to further accelerate this algorithm is also described.