Publications Related to Graph Partitioning

  1. A Parallel Hill-Climbing Refinement Algorithm for Graph Partitioning.

    Dominique LaSalle and George Karypis. 45th International Conference on Parallel Processing (ICPP), 2016.

  1. Improving Graph Partitioning for Modern Graphs and Architectures.

    Dominique LaSalle, Md Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Pradeep Dubey, and George Karypis. 5th Workshop on Irregular applications: Architectures and Algorithms, Supercomputing, 2015.

  1. Efficient Nested Dissection for Multicore Architectures.

    Dominique LaSalle and George Karypis. EuroPar, 2015.

  1. Multi-Threaded Graph Partitioning.

    Dominique LaSalle and George Karypis. 27th IEEE International Parallel & Distributed Processing Symposium, 2013.

  1. Architecture Aware Partitioning Algorithms.

    Irene Moulitsas and George Karypis. 8th Intl. Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), 2008.

  1. Interleaving of Gate Sizing and Constructive Placement for Predictable Performance.

    Sungjae Kim, Eugene Shragowitz, George Karypis, and Rung-Bin Lin . International Symposium on VLSI Design, Automation, and Test, pp. 1-4, 2007.

  1. Multilevel Algorithms for Partitioning Power-Law Graphs.

    Amine Abou-Rjeili and George Karypis. IEEE International Parallel & Distributed Processing Symposium (IPDPS), 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. 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. 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.