Home » Research » Publications

Chemical Informatics

  1. Acyclic Subgraph-based Descriptor Spaces for Chemical Compound Retrieval and Classification.

    Nikil Wale and George Karypis. IEEE International Conference on Data Mining (ICDM), 2006.

  1. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.

    Navaratnasothie Selvakkumaran and George Karypis. IEEE Transactions on CAD, 25(3), pp. 504-517, 2006.

  1. Frequent Sub-structure Based Approaches for Classifying Chemical Compounds.

    Mukund Deshpande, Michihiro Kuramochi, Nikil Wale, and George Karypis. IEEE Trans. Knowl. Data Eng. 17(8): 1036-1050, 2005.

  1. An Efficient Algorithm for Discovering Frequent Subgraphs.

    Michihiro Kuramochi and George Karypis. IEEE Trans. Knowl. Data Eng. 16(9): 1038-1051, 2004.

  1. Multi-Resource Aware Partitioning Algorithms for FPGAs with Heterogeneous Resources.

    Navaratnasothie Selvakkumaran, Abhishek Ranjan, Salil Raje, and George Karypis. 41st Design Automation Conference, pp. 741-746, 2004.

  1. Frequent Sub-structure Based Approaches for Classifying Chemical Compounds.

    Mukund Deshpande, Michihiro Kuramochi, and George Karypis. 3nd IEEE Conference on Data Mining (ICDM), pp. 35-42, 2003.

  1. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.

    Navaratnasothie Selvakkumaran and George Karypis. IEEE/ACM International Conference on Computer Aided Design (ICCAD), 726-733, 2003.

  1. Perimeter Degree: A Priori Metric for Directly Measuring and Homogenizing Interconnection Complexity in Multilevel Placement.

    Navaratnasothie Selvakkumaran, Phiroze Parakh, and George Karypis. IEEE Conference on System Level Interconnect Prediction (SLIP), pp. 53 - 59, 2003.

  1. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.

    Navaratnasothie Selvakkumaran and George Karypis. Proceedings of IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 726-733, 2003.

  1. Discovering Frequent Geometric Subgraphs.

    Michihiro Kuramochi and George Karypis. 2nd IEEE Conference on Data Mining (ICDM), pp. 258 - 265, 2002.

  1. Automated Approaches for Classifying Structures.

    Mukund Deshpande, Michihiro Kuramochi, and George Karypis. SIGKDD Workshop on Bioinformatics, BIOKDD, 2002.

  1. Multi-objective Circuit Partitioning for Cutsize and Path-based Delay Minimization.

    Cristinei Ababel, Navaratnosothie Selvakkumaran, Kia Bazargan, and George Karypis. IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 181 - 185, 2002.