Computing and Drawing Isomorphic Subgraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
An algorithm for reporting maximal c-cliques
Theoretical Computer Science
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
Multiple Graph Alignment for the Structural Analysis of Protein Active Sites
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Data reduction and exact algorithms for clique cover
Journal of Experimental Algorithmics (JEA)
Enumerating Isolated Cliques in Synthetic and Financial Networks
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Note: A note on the problem of reporting maximal cliques
Theoretical Computer Science
A scalable, parallel algorithm for maximal clique enumeration
Journal of Parallel and Distributed Computing
Migration motif: a spatial - temporal pattern mining approach for financial markets
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Isolation concepts for clique enumeration: Comparison and computational experiments
Theoretical Computer Science
Irregular Community Discovery for Social CRM in Cloud Computing
CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
RunTest: assuring integrity of dataflow processing in cloud computing infrastructures
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Technical Section: Fast construction of the Vietoris-Rips complex
Computers and Graphics
Finding maximal cliques in massive networks by H*-graph
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Listing all maximal cliques in large sparse real-world graphs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Finding maximal cliques in massive networks
ACM Transactions on Database Systems (TODS)
High efficiency and quality: large graphs matching
Proceedings of the 20th ACM international conference on Information and knowledge management
Information Sciences: an International Journal
A new approach and faster exact methods for the maximum common subgraph problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A direct algorithm to find a largest common connected induced subgraph of two graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
A clustering approach using weighted similarity majority margins
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
Assignment-minimum clique coverings
Journal of Experimental Algorithmics (JEA)
Fast algorithms for maximal clique enumeration with limited memory
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
All roads lead to Rome---New search methods for the optimal triangulation problem
International Journal of Approximate Reasoning
High efficiency and quality: large graphs matching
The VLDB Journal — The International Journal on Very Large Data Bases
Discrete Applied Mathematics
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters
Maximal clique enumeration for large graphs on hadoop framework
Proceedings of the first workshop on Parallel programming for analytics applications
Annals of Mathematics and Artificial Intelligence
| Hi-index | 5.23 |