Recent Advances in Graph Partitioning A Buluc, H Meyerhenke, I Safro, P Sanders, C Schulz Algorithm Engineering 9220, 117--158, 2016 | 623 | 2016 |
Think locally, act globally: Highly balanced graph partitioning P Sanders, C Schulz International Symposium on Experimental Algorithms, 164-175, 2013 | 280 | 2013 |
Engineering multilevel graph partitioning algorithms P Sanders, C Schulz Algorithms–ESA 2011, 469-480, 2011 | 244 | 2011 |
Benchmarking for Graph Clustering and Partitioning D Bader, A Kappes, H Meyerhenke, P Sanders, C Schulz, D Wagner Encyclopedia of Social Network Analysis and Mining, 2014 | 222* | 2014 |
Parallel graph partitioning for complex networks H Meyerhenke, P Sanders, C Schulz IEEE Transactions on Parallel and Distributed Systems 28 (9), 2625-2638, 2017 | 189 | 2017 |
The Future is Big Graphs! A Community View on Graph Processing Systems S Sakr, A Bonifati, H Voigt, A Iosup, K Ammar, R Angles, W Aref, M Arenas, ... Communications of the ACM, 2021 | 185 | 2021 |
Distributed Evolutionary Graph Partitioning P Sanders, C Schulz ALENEX 2012, 2012 | 153 | 2012 |
Engineering a scalable high quality graph partitioner M Holtgrewe, P Sanders, C Schulz Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium …, 2010 | 142 | 2010 |
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering H Meyerhenke, P Sanders, C Schulz Journal of Heuristics 22, 759-782, 2016 | 108* | 2016 |
Finding near-optimal independent sets at scale S Lamm, P Sanders, C Schulz, D Strash, RF Werneck 2016 Proceedings of the eighteenth workshop on algorithm engineering and …, 2016 | 106 | 2016 |
High-quality hypergraph partitioning S Schlag, T Heuer, L Gottesbüren, Y Akhremtsev, C Schulz, P Sanders ACM Journal of Experimental Algorithmics 27, 1-39, 2023 | 89 | 2023 |
Advanced coarsening schemes for graph partitioning I Safro, P Sanders, C Schulz Journal of Experimental Algorithmics (JEA) 19, 1-24, 2015 | 88 | 2015 |
Communication-free massively distributed graph generation D Funke, S Lamm, U Meyer, M Penschuck, P Sanders, C Schulz, D Strash, ... Journal of Parallel and Distributed Computing 131, 200-217, 2019 | 78 | 2019 |
k-way Hypergraph Partitioning via n-Level Recursive Bisection S Schlag, V Henne, T Heuer, H Meyerhenke, P Sanders, C Schulz 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016 | 71 | 2016 |
High quality graph partitioning P Sanders, C Schulz Graph Partitioning and Graph Clustering, 1-18, 2012 | 67 | 2012 |
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track∗ D Hespe, S Lamm, C Schulz, D Strash 2020 proceedings of the SIAM workshop on combinatorial scientific computing …, 2020 | 56* | 2020 |
Exactly solving the maximum weight independent set problem on large real-world graphs S Lamm, C Schulz, D Strash, R Williger, H Zhang 2019 proceedings of the twenty-first workshop on algorithm engineering and …, 2019 | 56 | 2019 |
Drawing Large Graphs by Multilevel Maxent-Stress Optimization H Meyerhenke, M Nöllenburg, C Schulz IEEE Transactions on Visualization and Computer Graphics 24 (5), 1814--1827, 2017 | 56 | 2017 |
Recent advances in fully dynamic graph algorithms K Hanauer, M Henzinger, C Schulz arXiv preprint arXiv:2102.11169, 2021 | 55* | 2021 |
High-quality shared-memory graph partitioning Y Akhremtsev, P Sanders, C Schulz IEEE Transactions on Parallel and Distributed Systems 31 (11), 2710-2722, 2020 | 55 | 2020 |