An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
Facet: A procedure for the automated synthesis of digital systems
25 years of DAC Papers on Twenty-five years of electronic design automation
The Diclique Representation and Decomposition of Binary Relations
Journal of the ACM (JACM)
An Algorithm for the Chromatic Number of a Graph
Journal of the ACM (JACM)
Some approaches to best-match file searching
Communications of the ACM
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Scalable Algorithms for Association Mining
IEEE Transactions on Knowledge and Data Engineering
Facet: A procedure for the automated synthesis of digital systems
DAC '83 Proceedings of the 20th Design Automation Conference
Joint routing and flow rate optimization in multi-rate ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient algorithms for mining maximal valid groups
The VLDB Journal — The International Journal on Very Large Data Bases
A scalable, parallel algorithm for maximal clique enumeration
Journal of Parallel and Distributed Computing
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Discovery and analysis of tightly knit communities in telecom social networks
IBM Journal of Research and Development
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Computational Optimization and Applications
Finding similar patterns in microarray data
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Utility-based bandwidth adaptation in mission-oriented wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Mining co-locations under uncertainty
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.04 |