Overview

This is a list of my publications including the DOI or in case of a TR the arxiv link. Moreover, for each publication the pdf is provided. The papers are provided for internal use only (are only accessible with a password).

Dissertation: High-Quality Graph Partitioning. As handed in. [ PDF ]
Habilitation: Scalable Graph Algorithms. As handed in. [ PDF ]
Me on Google Scholar: [ here ]
Curriculum vitae [ PDF ]
Office Hours: by arrangement
Email: firstname.lastname at informatik.uni-heidelberg.de
Group Website: https://ae.ifi.uni-heidelberg.de

At the moment my focus is on engeering scalable graph algorithms in particular for graph partitioning, process mapping, practical kernelization, and dynamic problems.


Short Bio

Christian Schulz received his Ph.D. in computer science from Karlsruhe Institute of Technology, Germany in 2013. Afterwards he was leading the graph partitioning & parallel processing subgroup in the group of Peter Sanders and later on leading the algorithm engineering subgroup of the group of Monika Henzinger in Vienna. Christian Schulz obtained a habilitation in computer science in 2019 and returned to Germany as a full professor at Heidelberg University. He has more than 80 publications, mostly on algorithms in the context of scalable graph algorithms. This includes multilevel algorithms [(hyper)graph partitioning, clustering, etc.], parallel algorithms [sorting, graph generation, etc.], streaming algorithms, support vector machines, data reductions algorithms as well as dynamic graph algorithms. He received various awards for his research, e.g. the Heinz Billing Prize, the KIT doctoral award, as well as a best paper award at IPDPS and at IEEE CLUSTER. His codes won several competitions such as the DIMACS Implementation Challenge on Graph Partitioning and Clustering and the PACE Implementation Challenge on Vertex Cover.


Open Source

  1. DynGraphLab -- Dynamic Graph Algorithms
  2. VieCut -- Vienna Minimum Cuts
  3. VieClus -- Vienna Graph Clustering
  4. VieM -- Vienna Mapping and Sparse Quadratic Assignment
  5. DyReach -- Dynamic Reachability
  6. KaSVM -- Karlsruhe Support Vector Machine
  7. KaGen -- Karlsruhe Graph Generation
  8. KaHIP -- Karlsruhe High Quality Partitioning
  9. KaHyPar -- Karlsruhe Hypergraph Partitioning
  10. KaDraw -- Karlsruhe Graph Drawing
  11. KaLP -- Karlsruhe Longest Paths
  12. KaMIS -- Karlsruhe Maximum Independent Sets
  13. DMAX -- Data Reduction for Maximum Cut

Book Chapters and Lecture Notes

  1. Benchmarking for Graph Clustering and Partitioning. David Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz and Dorothea Wagner. Encyclopedia of Social Network Analysis and Mining, 201. Updated article appeared 2018. https://doi.org/10.1007/978-1-4614-6170-8_23. [ paper ]
  2. Graph Partitioning and Graph Clustering in Theory and Practice. Christian Schulz and Sebastian Korbinian Bayer, Fellipe Bernardes-Lima, Jan Jacob, Robert Hangu, Sergey Hayrapetyan, Demian Hespe, Christoph Hess, Sebastian Lamm, Eike Röhrs, Henning Schulz, Christian Steiger, Matthias Stumpp, Marvin Teichmann. Lecture Notes. Karlsruhe Institute of Technology and Vienna PhD School of Informatics. 2015. [ PDF ].
  3. Recent Advances in Graph Partitioning. Aydin Buluc, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz. Algorithm Engineering: Selected Results and Surveys. Volume 9220 of LNCS. Springer-Verlag. 2016. https://doi.org/10.1007/978-3-319-49487-6_4. [ paper ]
  4. Graph Partitioning: Formulations and Applications to Big Data. Christian Schulz and Darren Strash. In Encyclopedia on Big Data Technologies, Springer, 2018. https://doi.org/10.1007/978-3-319-63962-8_312-2. [ paper ]
  5. Vienna Graph Clustering. Sonja Biedermann, Monika Henzinger, Christian Schulz and Bernhard Schuster. Invited chapter for Methods in Molecular Biology: Protein-Protein Interaction Networks, Volume 2074 of Methods in Molecular Biology, pages 215--231. Springer, 2020. https://doi.org/10.1007/978-1-4939-9873-9_16 [ paper ]
  6. Recent Advances in Scalable Network Generation. Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, and Christian Schulz. Book chapter for Massive Graph Analytics, 2021, to appear. [ preprint ]

Journal Articles

  1. Advanced Coarsening Schemes for Graph Partitioning. Ilya Safro, Peter Sanders, and Christian Schulz. ACM Journal of Experimental Algorithms. Volume 19, Article No. 2.2, 2015. http://doi.acm.org/10.1145/2670338. [ paper ]
  2. Turbo für Graphdatenbanken: Graphpartitionierung mit KaHIP. Heiko Papenfuß, Peter Sanders, and Christian Schulz. JavaSPEKTRUM 01/2015. [ paper ]
  3. Tree-based Coarsening and Partitioning of Complex Networks. Roland Glantz, Henning Meyerhenke, and Christian Schulz. ACM Journal of Experimental Algorithms. Volume 21, Article No. 1, 2016. http://doi.acm.org/10.1145/2851496. [ paper ]
  4. Scalable Generation of Scale-free Graphs. Peter Sanders and Christian Schulz. Information Processing Letters. Volume 116, Article No. 7, pages 489--491, 2016. https://doi.org/10.1016/j.ipl.2016.02.004. [ paper ]
  5. Partitioning (Hierarchically Clustered) Complex Networks via Size-Constrained Graph Clustering. Henning Meyerhenke, Peter Sanders and Christian Schulz. ACM Journal of Heuristics, Volume 22, Issue 5, pages 759--782, 2016. https://doi.org/10.1007/s10732-016-9315-8. [ paper ]
  6. Parallel Graph Partitioning for Complex Networks. Henning Meyerhenke, Peter Sanders and Christian Schulz. IEEE Transactions on Parallel and Distributed Systems, Volume 28, Issue 9, pages 2625--2638, 2017. https://doi.org/10.1109/TPDS.2017.2671868. [ paper ]
  7. Finding Near-Optimal Independent Sets at Scale. Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, and Renato F. Werneck. ACM Journal of Heuristics, Volume 23, Issue 4, pages 207--229, 2017. https://doi.org/10.1007/s10732-017-9337-x. [ paper ]
  8. Drawing Large Graphs by Multilevel Maxent-Stress Optimization. Henning Meyerhenke, Martin Nöllenburg and Christian Schulz. IEEE Transactions on Visualization and Computer Graphics, Volume 24, Issue 5, pages 1814--1827. 2018. https://doi.org/10.1109/TVCG.2017.2689016. [ paper ]
  9. Practical Minimum Cut Algorithms. Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash. Invited to special issue of ACM Journal of Experimental Algorithms (ACM JEA) for ALENEX 2018, Volume 23, pages 1.9:1--1.8:22, 2018. https://doi.org/10.1145/3274662. [ paper ]
  10. Communication-free Massively Distributed Graph Generation. Daniel Funke, Sebastian Lamm, Ulrich Meyer, Peter Sanders, Christian Schulz, Darren Strash and Moritz von Looz. Invited to special issue of Journal of Parallel and Distributed Computing for IPDPS'18, Volume 131, pages 200--217, 2019. https://doi.org/10.1016/j.jpdc.2019.03.011 [ paper ]
  11. Scalable Kernelization for Maximum Independent Sets. Demian Hespe, Christian Schulz and Darren Strash. ACM Journal of Experimental Algorithms. Volume 21, Article No. 1, 2019. http://doi.acm.org/10.1145/3355502. [ paper ]
  12. ILP-based Local Search for Graph Partitioning. Alexandra Henzinger, Alexander Noe and Christian Schulz. ACM Journal of Experimental Algorithms. Volume 25, Article No. 1.9, 2020. https://doi.org/10.1145/3398634. [ paper ]
  13. High-Quality Shared-Memory Graph Partitioning. Yaroslav Akhremtsev, Peter Sanders and Christian Schulz. In IEEE Transactions on Parallel and Distributed Systems, Volume 31, Issue 11, pages 2710--2722, 2020. https://doi.org/10.1109/TPDS.2020.3001645 [ paper ]
  14. Better Process Mapping and Sparse Quadratic Assignment. Christian Schulz, Jesper Larsson Träff and Konrad von Kirchbach. In ACM Journal of Experimental Algorithms (ACM JEA), Volume 25, Article No 1.11, 2020. https://doi.org/10.1145/3409667. [ paper ]
  15. Evolutionary Multi-Level Acyclic Graph Partitioning. Orlando Moreira, Merten Popp and Christian Schulz. In ACM Journal of Heuristics, Volume 29, pages 771--799, 2020. https://doi.org/10.1007/s10732-020-09448-8. [ paper ]
  16. The Future is Big Graphs! A Community View on Graph Processing Systems. Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei R. Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gabor Szarnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki. In Communictions of ACM (CACM), Vol 64, No. 9, Pages 62--71, 2021. https://doi.org/10.1145/3434642 [ paper ]
  17. Faster Support Vector Machines. Sebastian Schlag, Matthias Schmidt, and Christian Schulz. In ACM Journal of Experimental Algorithms (ACM JEA), to appear, 2021.

Conference Articles

  1. Orca Reduction and ContrAction Graph Clustering. Daniel Delling, Robert Görke, Christian Schulz and Dorothea Wagner. In Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM), volume 5564 of LNCS, pages 152--165. Springer, 2009. https://doi.org/10.1007/978-3-642-02158-9_14. [ paper ]
  2. Engineering a Scalable High Quality Graph Partitioner. Manuel Holtgrewe, Peter Sanders and Christian Schulz. In 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2010. https://doi.org/10.1109/IPDPS.2010.5470485. [ paper ]
  3. Engineering State-of-the-Art Graph Partitioning Libraries @KIT. Vitaly Osipov, Peter Sanders, Christian Schulz and Manuel Holtgrewe. In Proceedings of the Workshop on Computational Methods in Science and Engineering (SimLabs@KIT), KIT Scientific Publishing, pages 117--130. 2010. [ paper ]
  4. Engineering Multilevel Graph Partitioning Algorithms. Peter Sanders and Christian Schulz. In Proceedings of the 19th European Symposium on Algorithms (ESA), volume 6942 of LNCS, pages 469--480. Springer, 2011. https://doi.org/10.1007/978-3-642-23719-5_40. [ paper ]
  5. Distributed Evolutionary Graph Partitioning. Peter Sanders and Christian Schulz. In Proceedings of the 14th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 16-19, 2012. https://doi.org/10.1137/1.9781611972924.2. [ paper ]
  6. Advanced Coarsening Schemes for Graph Partitioning. Ilya Safro, Peter Sanders and Christian Schulz. In Proceedings of the 11th Symposium on Experimental Algorithms (SEA), volume 7276 of LNCS, pages 369--380. Springer, 2012. https://doi.org/10.1007/978-3-642-30850-5_32. [ paper ]
  7. Engineering Graph Partitioning Algorithms. Vitaly Osipov, Peter Sanders and Christian Schulz. In Proceedings of the 11th Symposium on Experimental Algorithms (SEA), volume 7276 of LNCS, pages 18--26. Springer, 2012. https://doi.org/10.1007/978-3-642-30850-5_3. [ paper ]
  8. Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. Jonas Fietz, Matthias Krause, Peter Sanders, Christian Schulz and Vincent Heuveline. In Proceedings of the 18th International European Conference on Parallel Computing (Euro-Par), volume 7484 of LNCS, pages 818--829. Springer, 2012. https://doi.org/10.1007/978-3-642-32820-6_81. [ paper ]
  9. High Quality Graph Partitioning. Peter Sanders and Christian Schulz. In Proceedings of the 10th DIMACS Implementation Challenge Workshop: Graph Partitioning and Clustering, pages 1--17, AMS, 2013. [ paper ]
  10. Think Locally, Act Globally: Highly Balanced Graph Partitioning. Peter Sanders and Christian Schulz. In Proceedings of the 12th Symposium on Experimental Algorithms (SEA), volume 7933 of LNCS, pages 164--175. Springer, 2013. https://doi.org/10.1007/978-3-642-38527-8_16. [ paper ]
  11. Efficient Parallel and External Matchings. Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz and Nodari Sitchinava. In Proceedings of the 19th International European Conference on Parallel Computing (Euro-Par), volume 8097 of LNCS, pages 659--670. Springer, 2013. https://doi.org/10.1007/978-3-642-40047-6_66. [ paper ]
  12. Tree-based Coarsening and Partitioning of Complex Networks. Roland Glantz, Henning Meyerhenke and Christian Schulz. In Proceedings of the 13th Symposium on Experimental Algorithms (SEA), volume 8504 of LNCS, pages 364--375. Springer, 2014. https://doi.org/10.1007/978-3-319-07959-2_31. [ paper ]
  13. Partitioning Complex Networks via Size-constrained Clustering. Henning Meyerhenke, Peter Sanders and Christian Schulz. In Proceedings of the 13th Symposium on Experimental Algorithms (SEA), volume 8504 of LNCS, pages 351--363. Springer, 2014. https://doi.org/10.1007/978-3-319-07959-2_30. [ paper ]
  14. (Semi-)External Algorithms for Graph Partitioning and Clustering. Yaroslav Akhremtsev, Peter Sanders and Christian Schulz. In Proceedings of the 17th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 33-43, 2015. https://doi.org/10.1137/1.9781611973754.4. [ paper ]
  15. Parallel Graph Partitioning for Complex Networks. Henning Meyerhenke, Peter Sanders and Christian Schulz. In 29th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2015. https://doi.org/10.1109/IPDPS.2015.18. [ paper ]
  16. Practical Massively Parallel Sorting. Michael Axtmann, Timo Bingmann, Peter Sanders and Christian Schulz. In Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 13-23. ACM, 2015. https://doi.org/10.1145/2755573.2755595. [ paper ]
  17. Graph Partitioning for Independent Sets. Sebastian Lamm, Peter Sanders and Christian Schulz. In Proceedings of the 14th Symposium on Experimental Algorithms (SEA), volume 8504 of LNCS, pages 68--81. Springer, 2015. https://doi.org/10.1007/978-3-319-20086-6_6. [ paper ]
  18. Drawing Large Graphs by Multilevel Maxent-Stress Optimization. Henning Meyerhenke, Martin Nöllenburg and Christian Schulz. In Proceedings of the 23rd International Symposium on Graph Drawing & Network Visualization (GD), volume 9411 of LNCS, pages 30-43. Springer, 2015. https://doi.org/10.1007/978-3-319-27261-0_3. [ paper ]
  19. Incorporating Road Networks into Territory Design. Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz and Andreas Wagner. In Proceedings of the 23rd International Conference on Advances in Geographic Information Systems (GIS). ACM Press, 2015. https://doi.org/10.1145/2820783.2820800. [ paper ]
  20. k-way Hypergraph Partitioning via n-Level Recursive Bisection. Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders and Christian Schulz. In Proceedings of the 18th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 53-67. 2016. https://doi.org/10.1137/1.9781611974317.5. [ paper ]
  21. Finding Near-Optimal Independent Sets at Scale. Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck In Proceedings of the 18th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 138-150. 2016. https://doi.org/10.1137/1.9781611974317.12. [ paper ]
  22. Accelerating Local Search for the Maximum Independent Set Problem. Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck. In Proceedings of the 15th Symposium on Experimental Algorithms (SEA), volume 9685 of LNCS, pages 118--133. Springer, 2016. https://doi.org/10.1007/978-3-319-38851-9_9. [ paper ]
  23. Advanced Multilevel Node Separator Algorithms. Peter Sanders and Christian Schulz. In Proceedings of the 15th Symposium on Experimental Algorithms (SEA), volume 9685 of LNCS, pages 294--309. Springer, 2016. https://doi.org/10.1007/978-3-319-38851-9_20. [ paper ]
  24. Distributed Evolutionary k-way Node Separators. Peter Sanders, Christian Schulz, Darren Strash and Robert Williger. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 345--252, 2017. Best Paper Nominee. https://doi.org/10.1145/3071178.3071204. [ paper ]
  25. Better Process Mapping and Sparse Quadratic Assignment. Christian Schulz and Jesper Larsson Träff. In Proceedings of the 16th Symposium on Experimental Algorithms (SEA), volume 75 of LIPIcs, pages 4:1--4:15, 2017. https://doi.org/10.4230/LIPIcs.SEA.2017.4. [ paper ]
  26. Graph Partitioning with Acyclicity Constraints. Orlando Moreira, Merten Popp and Christian Schulz. In Proceedings of the 16th Symposium on Experimental Algorithms (SEA), volume 75 of LIPIcs, pages 30:1--30:15, 2017. https://doi.org/10.4230/LIPIcs.SEA.2017.30. [ paper ]
  27. Practical Minimum Cut Algorithms. Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash. In Proceedings of the 20th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 48--61, 2018. https://doi.org/10.1137/1.9781611975055.5. [ paper ]
  28. Scalable Kernelization for Maximum Independent Sets. Demian Hespe, Christian Schulz and Darren Strash. In Proceedings of the 20th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 223--237, 2018. https://doi.org/10.1137/1.9781611975055.19. [ paper ]
  29. Communication-free Massively Distributed Graph Generation. Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Moritz von Looz. In 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 336--347, 2018. Best Paper Award. https://doi.org/10.1109/IPDPS.2018.00043. [ paper ]
  30. Memetic Multilevel Hypergraph Partitioning. Robin Andre, Sebastian Schlag and Christian Schulz. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 347--354, ACM, 2018. https://doi.org/10.1145/3205455.3205475. [ paper ]
  31. Evolutionary Multi-level Acyclic Graph Partitioning. Orlando Moreira, Merten Popp and Christian Schulz. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 331--339, ACM, 2018. https://doi.org/10.1145/3205455.3205464. [ paper ]
  32. ILP-based Local Search for Graph Partitioning. Alexandra Henzinger, Alexander Noe and Christian Schulz. In Proceedings of the 17th Symposium on Experimental Algorithms (SEA), volume 103 of LIPIcs, pages 4:1--4:15, 2018. https://doi.org/10.4230/LIPIcs.SEA.2018.4. [ paper ]
  33. Memetic Graph Clustering. Sonja Biedermann, Monika Henzinger, Christian Schulz and Bernhard Schuster. In Proceedings of the 17th Symposium on Experimental Algorithms (SEA), volume 103 of LIPIcs, pages 3:1--3:15, 2018. https://doi.org/10.4230/LIPIcs.SEA.2018.3. [ paper ]
  34. High-Quality Shared-Memory Graph Partitioning. Yaroslav Akhremtsev, Peter Sanders and Christian Schulz. In Proceedings of the 24th International European Conference on Parallel Computing (Euro-Par), volume 11014 of LNCS, pages 659--671, 2018. https://doi.org/10.1007/978-3-319-96983-1_47. [ paper ]
  35. Faster Support Vector Machines. Sebastian Schlag, Matthias Schmitt and Christian Schulz. In Proceedings of the 21th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 199--210, SIAM, 2019. https://doi.org/10.1137/1.9781611975499.16 [ paper ]
  36. Scalable Edge Partitioning. Sebastian Schlag, Christian Schulz, Daniel Seemaier and Darren Strash. In Proceedings of the 21th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 211--2225, SIAM, 2019. https://doi.org/10.1137/1.9781611975499.17 [ paper ]
  37. Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger and Huashuo Zhang. In Proceedings of the 21th Workshop on Algorithm Engineering and Experimentation (ALENEX), pages 144--158, SIAM, 2019. https://doi.org/10.1137/1.9781611975499.12 [ paper ]
  38. Shared-Memory Exact Minimum Cuts. Monika Henzinger, Alexander Noe and Christian Schulz. In 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019. http://doi.org/10.1109/IPDPS.2019.00013 [ paper ]
  39. Finding Optimal Longest Paths by Dynamic Programming in Parallel. Tomas Balyo, Kai Fieger, Dominik Schreiber and Christian Schulz. In 12th Symposium on Combinatorial Search (SoCS’19), pages 61–69, AAAI Press, 2019. https://doi.org/10.1137/1.9781611975499.12 [ paper ]
  40. Shared-Memory Branch-and-Reduce for Multiterminal Cuts. Monika Henzinger, Alexander Noe and Christian Schulz. In Algorithm Engineering and Experimentation (ALENEX), 2020. https://doi.org/10.1137/1.9781611976007.4 [ paper ]
  41. Engineering Kernelization for Maximum Cut. Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz and Darren Strash. In Algorithm Engineering and Experimentation (ALENEX), 2020. https://doi.org/10.1137/1.9781611976007.3 [ paper ]
  42. Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. Kathrin Hanauer, Monika Henzinger, and Christian Schulz. In Algorithm Engineering and Experimentation (ALENEX), 2020. https://doi.org/10.1137/1.9781611976007.9 [ paper ]
  43. WeGotYouCovered: The Winning Solver from the 2019 PACE Implementation Challenge, Vertex Cover Track. Demian Hespe, Sebastian Lamm, Christian Schulz and Darren Strash. In Combinatorial Scientific Computing (CSC), 2020. https://doi.org/10.1137/1.9781611976229.1 [ paper ]
  44. High-Quality Hierarchical Process Mapping. Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff and Christian Schulz. In Proceedings of the 18th Symposium on Experimental Algorithms (SEA), 2020. https://doi.org/10.4230/LIPIcs.SEA.2020.4 [ paper ]
  45. Faster Fully Dynamic Transitive Closure in Practice. Kathrin Hanauer, Monika Henzinger and Christian Schulz. In Proceedings of the 18th Symposium on Experimental Algorithms (SEA), 2020. https://doi.org/10.4230/LIPIcs.SEA.2020.14 [ paper ]
  46. Dynamic Matching Algorithms in Practice. Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz, In Proceedings of the 28th European Symposium on Algorithms (ESA), 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.58 [ paper ]
  47. Finding All Global Minimum Cuts In Practice. Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash. In Proceedings of the 28th European Symposium on Algorithms (ESA), 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.59 [ paper ]
  48. Efficient Process-to-Node Mapping Algorithms for Stencil Computations. Konrad von Kirchbach, Markus Lehr, Sascha Hunold, Christian Schulz, Jesper Larsson Träff. In Proceedings of the IEEE International Conference on Cluster Computing (CLUSTER) 2020, https://doi.org/10.1109/CLUSTER49012.2020.00011. Best Paper Award. [ paper ]
  49. Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdan Zavalnij. In Algorithm Engineering and Experimentation (ALENEX), 2021. https://doi.org/10.1137/1.9781611976472.10 [ paper ]
  50. Multilevel Acyclic Hypergraph Partitioning. Merten Popp, Sebastian Schlag, Christian Schulz and Daniel Seemaier. In Algorithm Engineering and Experimentation (ALENEX), 2021. https://doi.org/10.1137/1.9781611976472.1 [ paper ]
  51. Fully Dynamic k-Center Clustering in Doubling Metrics. Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil. In Algorithm Engineering and Experimentation (ALENEX), 2021. https://doi.org/10.1137/1.9781611976472.11 [ paper ]
  52. Engineering Data Reduction for Nested Dissection. Wolfgang Ost, Christian Schulz and Darren Strash. In Algorithm Engineering and Experimentation (ALENEX), 2021. https://doi.org/10.1137/1.9781611976472.9 [ paper ]
  53. O'Reach: Even Faster Reachability in Large Graphs. Kathrin Hanauer, Christian Schulz and Jonathan Trummer. In Proceedings of the 19th Symposium on Experimental Algorithms (SEA), volume 190 of LIPIcs, pages 13:1--13:24, 2021. https://doi.org/10.4230/LIPIcs.SEA.2021.13 [ paper ]
  54. Faster Parallel Multiterminal Cuts. Monika Henzinger, Alexander Noe, Christian Schulz. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), pages 100--110, 2021. https://doi.org/10.1137/1.9781611976830.10 [ paper ]
  55. Fully-dynamic Weighted Matching Approximation in Practice. Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Ucar. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), pages 32--44, 2021. https://doi.org/10.1137/1.9781611976830.4 [ paper ]
  56. An MPI-Parallel Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Maria Predarim, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke. In Proceedings of the 27th International European Conference on Parallel Computing (Euro-Par), pages 167--192, vol 12820 of LNCS, 2021, https://doi.org/10.1007/978-3-030-85665-6_11. [ paper ]
  57. Deep Multilevel Graph Partitioning. Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier. In European Symposium on Algorithms (ESA'21), vol 204 of LIPIcs, pages 48:1--48:17, 2021. https://doi.org/10.4230/LIPIcs.ESA.2021.48 [ paper ]
  58. Practical Fully Dynamic Minimum Cut Algorithms. Monika Henzinger, Alexander Noe and Christian Schulz. In Algorithm Engineering and Experimentation (ALENEX), 2022, to appear. [ preprint ]

Workshop Papers and Posters without proceedings

  1. Improving Coarsening for Multilevel Partitioning of Complex Networks. Roland Glantz, Henning Meyerhenke, Peter Sanders and Christian Schulz. Workshop Paper, The Sixth SIAM Workshop on Combinatorial Scientific Computing, 2014. PDF
  2. KaHIP -- Karlsruhe High Quality Graph Partitioning. Peter Sanders and Christian Schulz. Invited Poster, German-American Frontiers of Engineering Symposium, National Academy of Engineering and Alexander von Humboldt Foundation, Potsdam, 2015. Poster PDF.
  3. WeGotYouCovered: The Winning Solver from the 2019 PACE Implementation Challenge, Vertex Cover Track. Demian Hespe, Sebastian Lamm, Christian Schulz and Darren Strash. Poster. 14th International Symposium on Parameterized and Exact Computation, Munich. 2019. Paper PDF, Poster PDF.
  4. Load-Balanced Bottleneck Objectives in Process Mapping. Johannes Langguth, Sebastian Schlag and Christian Schulz. Short paper, The Ninth SIAM Workshop on Combinatorial Scientific Computing, 2020. PDF

Technical Reports

  1. Engineering a Scalable High Quality Graph Partitioner. Manuel Holtgrewe, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2010. PDF
  2. Engineering Multilevel Graph Partitioning Algorithms. Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2011. PDF
  3. Distributed Evolutionary Graph Partitioning. Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2012. PDF
  4. Advanced Coarsening Schemes for Graph Partitioning. Ilya Safro, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2011. PDF
  5. Think Locally, Act Globally: Perfectly Balanced Graph Partitioning. Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2012. PDF
  6. Efficient Parallel and External Matchings. Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz and Nodari Sitchinava. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2013. PDF
  7. KaHIP v0.6 -- Karlsruhe High Quality Partitioning -- User Guide. Peter Sanders and Christian Schulz Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2013. PDF
  8. Recent Advances in Graph Partitioning. Aydin Buluc, Henning Meyerhenke, Ilya Safro, Peter Sanders and Christian Schulz Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2013. PDF
  9. Tree-based Coarsening and Partitioning of Complex Networks. Roland Glantz, Henning Meyerhenke and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2014. PDF
  10. Partitioning Complex Networks via Size-constrained Clustering. Henning Meyerhenke, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2014. PDF
  11. (Semi-)External Algorithms for Graph Partitioning and Clustering. Yaroslav Akhremtsev, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2014. PDF
  12. Parallel Graph Partitioning for Complex Networks. Henning Meyerhenke, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2014. PDF
  13. Practical Massively Parallel Sorting -- Basic Algorithmic Ideas. Michael Axtmann, Timo Bingmann, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2014. PDF
  14. Graph Partitioning for Independent Sets. Sebastian Lamm, Peter Sanders and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  15. n-level Hypergraph Partitioning. Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag and Christian Schulz. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  16. Incorporating Road Networks into Territory Design. Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz and Andreas Wagner. Technical report, ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  17. Drawing Large Graphs by Multilevel Maxent-Stress Optimization. Henning Meyerhenke, Martin Nöllenburg and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  18. Advanced Multilevel Node Separator Algorithms. Peter Sanders and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  19. k-way Hypergraph Partitioning via n-Level Recursive Bisection. Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  20. Finding Near-Optimal Independent Sets at Scale. Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, 2015. PDF
  21. Accelerating Local Search for the Maximum Independent Set Problem. Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, 2016. PDF
  22. Scalable Generation of Scale-free Graphs. Peter Sanders and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, 2016. PDF
  23. Distributed Evolutionary k-way Node Separators. Peter Sanders, Christian Schulz, Darren Strash and Robert Williger. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, 2017. PDF
  24. Better Process Mapping and Sparse Quadratic Assignment Problems. Konrad von Kirchbach, Christian Schulz and Jesper Larsson Träff. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, Department of Computer Science, University of Vienna and Technical University of Vienna, 2017. PDF
  25. Optimal Longest Path Search by Dynamic Programming. Tomas Balyo, Kai Fieger and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, 2017. PDF
  26. Practical Minimum Cut Algorithms. Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, Department of Computer Science, University of Vienna and Colgate University, 2017. PDF
  27. Scalable Kernelization for Maximum Independent Sets. Demian Hespe, Christian Schulz and Darren Strash. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, Department of Computer Science, University of Vienna and Colgate University, 2017. PDF
  28. Memetic Multilevel Hypergraph Partitioning. Robin Andre, Sebastian Schlag and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, 2017. PDF
  29. Evolutionary Acyclic Graph Partitioning. Orlando Moreira, Merten Popp and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, Department of Computer Science, University of Vienna and Intel Corporation, Eindhoven, The Netherlands, 2017. PDF
  30. High-Quality Shared-Memory Graph Partitioning. Yaroslav Akhremtsev, Peter Sanders and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, 2017. PDF
  31. Communication-free Massively Distributed Graph Generation. Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Moritz von Looz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, 2017. PDF
  32. ILP-based Local Search for Graph Partitioning. Alexandra Henzinger, Alexander Noe and Christian Schulz. Technical report, Stanford and Department of Computer Science, University of Vienna, 2018. PDF
  33. Memetic Graph Clustering. Sonja Biedermann, Monika Henzinger, Christian Schulz and Bernhard Schuster. Technical report, Department of Computer Science, University of Vienna, 2018. PDF
  34. Faster Support Vector Machines. Sebastian Schlag, Matthias Schmitt and Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, 2018. PDF
  35. Scalable Edge Partitioning. Sebastian Schlag, Christian Schulz, Daniel Seemaier and Darren Strash. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, and Hamilton College, 2018. PDF
  36. Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger and Huashuo Zhang. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and Department of Computer Science, University of Vienna, and Hamilton College 2018. PDF
  37. Shared-Memory Exact Minimum Cuts. Monika Henzinger, Alexander Noe and Christian Schulz. Department of Computer Science, University of Vienna, 2018. PDF
  38. Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. Kathrin Hanauer, Monika Henzinger, and Christian Schulz. Technical report, Faculty of Computer Science, University of Vienna, 2019. PDF
  39. Engineering Kernelization for Maximum Cut. Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz and Darren Strash. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology, University of Bonn, 13Faculty of Computer Science, University of Vienna, and Hamilton College, 2018. PDF
  40. Finding Optimal Longest Paths by Dynamic Programming in Parallel. Tomas Balyo, Kai Fieger, Dominik Schreiber, Christian Schulz. Technical report, ITI, Department of Informatics, Karlsruhe Institute of Technology and University of Vienna, Faculty of Computer Science, 2019. PDF
  41. Shared-Memory Branch-and-Reduce for Multiterminal Cuts. Monika Henzinger, Alexander Noe and Christian Schulz. Technical report, Faculty of Computer Science, University of Vienna, 2019. PDF
  42. WeGotYouCovered: The Winning Solver from the 2019 PACE Implementation Challenge, Vertex Cover Track. Demian Hespe, Sebastian Lamm, Christian Schulz and Darren Strash. Technical report, Karlsruhe Institute of Technology and Faculty of Computer Science, University of Vienna and Hamilton College, 2019. PDF
  43. High-Quality Hierarchical Process Mapping. Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff and Christian Schulz. Technical report, University of Vienna, Faculty of Computer Science, Humboldt Universtät zu Berlin, and Technical University of Vienna, 2020. PDF
  44. Load-Balanced Bottleneck Objectives in Process Mapping. Johannes Langguth, Sebastian Schlag and Christian Schulz. Technical report, Simula Research Laboratory, Karlsruhe Institute of Technology, and Technical University of Vienna, 2020. PDF
  45. Faster Fully Dynamic Transitive Closure. Kathrin Hanauer, Monika Henzinger and Christian Schulz. Technical report. University of Vienna, Faculty of Computer Science, 2020. PDF
  46. Multilevel Acyclic Hypergraph Partitioning. Merten Popp, Sebastian Schlag, Christian Schulz and Daniel Seemaier. Technical report, GrAI Matter Labs, Karlsruhe Institute of Technology and University of Vienna, 2020. PDF
  47. Fully Dynamic k-Center Clustering in Doubling Metrics. Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil. Technical Report, University of Vienna, Faculty of Computer Science, 2020. PDF
  48. Finding All Global Minimum Cuts In Practice. Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash. Technical report, University of Vienna and Hamilton College, 2020. PDF
  49. Recent Advances in Scalable Network Generation. Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz, Technical report, Geothe University Frankfurt, ETH Zürich, Karlsruhe Institute of Technology, Clemson University and University of Vienna, 2020. PDF
  50. Dynamic Matching Algorithms in Practice. Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz, Technical report, University of Vienna and University of Helsinki, 2020. PDF
  51. Engineering Data Reduction for Nested Dissection. Wolfgang Ost, Christian Schulz and Darren Strash, Technical report, University of Vienna, 2020. PDF
  52. Faster Parallel Multiterminal Cuts. Monika Henzinger, Alexander Noe and Christian Schulz, Technical report, University of Vienna, 2020. PDF
  53. Efficient Process-to-Node Mapping Algorithms for Stencil Computations. Sascha Hunold, Konrad von Kirchbach, Markus Lehr, Christian Schulz, Jesper Larsson Träff, Technical report, Technical University of Vienna and University of Vienna, 2020. PDF
  54. Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdan Zavalnij. Technical report, Karlsruhe Institute of Technology, University of Vienna, Hamilton College, Hungarian Academy of Sciences, 2020. PDF
  55. Faster Reachability in Static Graphs. Kathrin Hanauer, Christian Schulz and Jonathan Trummer. Technical report, University of Vienna, 2020. PDF
  56. The Future is Big Graphs! A Community View on Graph Processing Systems. Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei R. Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gabor Szarnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki. Technical report, 2020. PDF
  57. Recent Advances in Practical Data Reduction. Faisal Abu-Khzam, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash. Technical report, 2020. PDF
  58. Practical Fully Dynamic Minimum Cut Algorithms. Monika Henzinger, Alexander Noe and Christian Schulz. Technical report, 2021. PDF
  59. Buffered Streaming Graph Partitioning. Marcelo Fonseca Faraj and Christian Schulz. Technical report, 2021. PDF
  60. Recent Advances in Fully Dynamic Graph Algorithms. Kathrin Hanauer, Monika Henzinger and Christian Schulz. Technical report, 2021. PDF
  61. Fully-dynamic Weighted Matching Approximation in Practice. Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Ucar. PDF
  62. An MPI-Parallel Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Maria Predarim, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke. Technical report, 2021. [ PDF ]
  63. Deep Multilevel Graph Partitioning. Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier. Technical report, 2021. PDF
  64. High Quality Hypergraph Partitioning. Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akremtsev, Christian Schulz, Peter Sanders. Technical report, 2021. PDF

Co-Supervised Thesis

  1. Engineering Maximum Common Subgraph Algorithms for Large Graphs.
    Jonathan Trummer. Master-level thesis. University of Vienna. 2021. [ PDF ]
  2. Engineering Algorithms for Very Large k Partitioning.
    Manuel Haag. Bachelor-level thesis. Karlsruhe Institute of Technology. 2021. [ PDF ]
  3. Engineering Minimum Degree Node Ordering Algorithms.
    Ole Kröger. Master-level thesis. Heidelberg University. 2021. [ PDF ]
  4. Engineering NOI-based Coarsening Algorithms for Multilevel Graph Partitioning.
    Jakob Niedermüller. Master-level thesis. University Vienna. 2021. [ PDF ]
  5. Machine-Learning based Hypergraph Pruning for Partitioning.
    Tobias Fuchs. Bachelor-level thesis. Karlsruhe Institute of Technology. 2020. [ PDF ]
  6. Engineering Generalized Reductions for the Maximum Weight Independent Set Problem.
    Alexander Gellner. Master-level thesis. Karlsruhe Institute of Technology. 2020. [ PDF ]
  7. Acyclic n-Level Hypergraph Partitioning.
    Daniel Seemaier. Master-level thesis. Karlsruhe Institute of Technology. 2020. [ PDF ]
  8. Improved Nested Disection Through Kernelization.
    Wolfgang Ost. Master-level thesis. University of Vienna. 2019. [ PDF ]
  9. Mapping Stencil Computations in Regular Communication Networks.
    Konrad von Kirchbach. Master-level thesis. University of Vienna. 2019. [ PDF ]
  10. Practical Kernelization For The Edge Clique Cover Problem.
    Jonathan Trummer. Bachelor-level thesis. University of Vienna. 2019. [ PDF ]
  11. Engineering Node Replication for Matrix Vector Multiplication.
    Tobias Ribizel. Master-level thesis. Karlsruhe Institute of Technology. 2019. [ PDF ]
  12. A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem.
    Damir Ferizovic. Master-level thesis. Karlsruhe Institute of Technology. 2019. [ PDF ]
  13. Engineering Algorithms for Fully Dynamic Maximal Matching.
    Richi Paul. Bachelor-level thesis. University of Vienna. 2018. [ PDF ]
  14. A Heuristic Algorithm for Graph-Based Surface Segmentation in Volumetric Images.
    Rosa Zimmermann. Bachelor-level thesis. University of Vienna. 2018. [ PDF ]
  15. Combining Recursive Bisection and k-way Local Search for Hypergraph Partitioning.
    Charel Mercatoris. Bachelor-level thesis. Karlsruhe Institute of Technology. 2018. [ PDF ]
  16. Support Vector Machines via Multilevel Label Propagation.
    Matthias Schmitt. Bachelor-level thesis. Karlsruhe Institute of Technology. 2018. [ PDF ]
  17. Algorithm Configuration for Hypergraph Partitioning.
    Clemens Öhl. Bachelor-level thesis. Karlsruhe Institute of Technology. 2018. [ PDF ]
  18. Evolutionary Graph Clustering.
    Sonja Biedermann. Bachelor-level thesis. University of Vienna. 2017. [ PDF ]
  19. Engineering Graph Partitioning Algorithms to Minimize Communication Volume.
    Daniel Seemaier. Bachelor-level thesis. Karlsruhe Institute of Technology. 2017. [ PDF ]
  20. Better Recursive Bisection.
    Yani Kolev. Bachelor-level thesis. Karlsruhe Institute of Technology. 2017. [ PDF ]
  21. Evolutionary Hypergraph Partitioning.
    Robin Andre. Bachelor-level thesis. Karlsruhe Institute of Technology. 2017. [ PDF ]
  22. Scalable Kernelization for the Maximum Independent Set Problem.
    Demian Hespe. Master-level thesis. Karlsruhe Institute of Technology. 2017. [ PDF ]
  23. Evolutionary Graph Coloring.
    Marvin Williams. Bachelor-level thesis. Karlsruhe Institute of Technology. 2017. [ PDF ]
  24. Communication Efficient Algorithms for Generating Massive Networks.
    Sebastian Lamm. Master-level thesis. Karlsruhe Institute of Technology. 2017. [ PDF ]
  25. Evolutionary k-way Node Separators. Robert Williger.
    Bachelor-level thesis. Karlsruhe Institute of Technology. 2016. [ PDF ]
  26. How to Partition a Graph When You Think Like A Vertex.
    Jan Ebbing. Bachelor-level thesis. Karlsruhe Institute of Technology. 2015. [ PDF ]
  27. Boosting Local Search for the Maximum Independent Set Problem.
    Jakob Dahlum. Bachelor-level thesis. Karlsruhe Institute of Technology. 2015. [ PDF ]
  28. Label Propagation for Hypergraph Partitioning.
    Vitali Henne. Master-level thesis. Karlsruhe Institute of Technology. 2015. [ PDF ]
  29. Evolutionary Algorithms For Independent Sets.
    Sebastian Lamm. Bachelor-level thesis. Karlsruhe Institute of Technology. 2014. [ PDF ]
  30. Finding Small Node Separators.
    Michael Wegner. Bachelor-level thesis. Karlsruhe Institute of Technology. 2014. [ PDF ]
  31. Coloring Complex Networks.
    Klaus Lukas Hübner. Bachelor-level thesis. Karlsruhe Institute of Technology. 2014. [ PDF ]
  32. Partitionierung zur Berücksichtigung d. Straßengraphen in der Gebietsplanung.
    Andreas Wagner. Master-level thesis. Karlsruhe Institute of Technology. 2014. [ PDF ]
  33. n-Level Hypergraph Partitioning.
    Florian Ziegler. Bachelor-level thesis. Karlsruhe Institute of Technology. 2014. [ PDF ]
  34. Engineering Fast Parallel Matching Algorithms.
    Marcel Birn. Master-level thesis. Karlsruhe Institute of Technology. 2013. [ PDF ]
  35. Perf. Optimization of Parallel LB Fluid Flow Simulations on Complex Geometries.
    Jonas Fietz. Master-level thesis. Karlsruhe Institute of Technology. 2013. [ PDF ]
  36. Engineering Edge Ratings and Matching Algorithms for MGP.
    Maximilian Schuler. Bachelor-level thesis. Karlsruhe Institute of Technology. 2012. [ PDF ]