Update

I recently moved to Heidelberg:

My new email is christian schulz∂informatik.uni-heidelberg.de

My new website is here.

Software

Dissertation / PhD Thesis
Titel	Quelle	Datum
High Quality Graph Partitioning	PhD Thesis	Mai 2013

Recent Technical Reports, Workshop Papers and Posters
Titel	Datum	Autor
ILP-based Local Search for Graph Partitioning	February 2018	Alexandra Henzinger, Alexander Noe, Christian Schulz
Memetic Graph Clustering	February 2018	Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster
Graph Partitioning Formulations and Applications to Big Data	November 2017	Christian Schulz and Darren Strash
Communication-free Massively Distributed Graph Generation	May 2018	Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
High-Quality Shared-Memory Graph Partitioning	October 2017	Yaroslav Akhremtsev, Peter Sanders and Christian Schulz
Memetic Multilevel Hypergraph Partitioning	August 2017	Robin Andre, Sebastian Schlag, Christian Schulz
Evolutionary Acyclic Graph Partitioning	August 2017	Orlando Moreira, Merten Popp, Christian Schulz
Scalable Kernelization for the Maximum Independent Set Problem	August 2017	Demian Hespe, Christian Schulz, Darren Strash
Practical Minimum Cut Algorithms	August 2017	Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide	March 2017	Christian Schulz, Jesper Larsson Träff
Graph Partitioning with Acyclicity Constraints	March 2017	Orlando Moreira, Merten Popp, Christian Schulz
Optimal Longest Paths by Dynamic Programming	February 2017	Tomas Balyo, Kai Fieger, Christian Schulz
Better Process Mapping and Sparse Quadradic Assignment	February 2017	Christian Schulz, Jesper Larsson Träff
Distributed Evolutionary k-way Node Separators	February 2017	Peter Sanders, Christian Schulz, Darren Strash, Robert Williger
Scalable Generation of Scale-free Graphs	February 2016	Peter Sanders, Christian Schulz
Accelerating Local Search for the Maximum Independent Set Problem	February 2016	Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck
k-way Hypergraph Partitioning via n-Level Recursive Bisection	November 2015	Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz
Finding Near-Optimal Independent Sets at Scale	September 2015	Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Advanced Multilevel Node Separator Algorithms	September 2015	Peter Sanders and Christian Schulz
Drawing Large Graphs by Multilevel Maxent-Stress Optimization	June 2015	Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
n-Level Hypergraph Partitioning	Mai 2015	Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz
Incorporating Road Networks into Territory Design	April 2015	Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz and Andreas Wagner
KaHIP Poster	April 2015	Peter Sanders, Christian Schulz
Graph Partitioning for Independent Sets	February 2015	Sebastian Lamm, Peter Sanders and Christian Schulz

Book Chapters and Lecture Notes
Titel	Quelle	Datum	Autor
Graph Partitioning and Graph Clustering in Theory and Practice	Lecture Notes	2015	C. Schulz and S. K. Bayer, J. Jacob, R. Hangu, S. Hayrapetyan, D. Hespe, C. Hess, S. Lamm, E. Röhrs, H. Schulz, C. Steiger, M. Stumpp, M. Teichmann.
Recent Advances in Graph Partitioning	Algorithm Engineering: Selected Results and Surveys	2016	Aydin Buluc, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
Benchmarking for Graph Clustering and Partitioning	Encyclopedia of Social Network Analysis and Mining, ISBN: 978-1-4614-6169-2	2014	D. Bader, A. Kappes, H. Meyerhenke, P. Sanders, C. Schulz and D. Wagner

Journal Articles
Titel	Quelle	Datum	Autor
Advanced Coarsening Schemes for Graph Partitioning	ACM JEA	2014	Ilya Safro, Peter Sanders, and Christian Schulz
Turbo für Graphdatenbanken: Graphpartitionierung mit KaHIP	JavaSPEKTRUM	2015	Heiko Papenfuß, Peter Sanders, and Christian Schulz
Tree-based Coarsening and Partitioning of Complex Networks	ACM JEA	2016	Roland Glantz, Henning Meyerhenke, and Christian Schulz
Partitioning (Hierarchically Clustered) Complex Networks via Size-Constrained Graph Clustering	ACM Journal of Heuristics	2016	Henning Meyerhenke, Peter Sanders, Christian Schulz
Scalable Generation of Scale-free Graphs	IPL	2016	Peter Sanders and Christian Schulz
Finding Near-Optimal Independent Sets at Scale	ACM Journal of Heuristics	2017	Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
Parallel Graph Partitioning for Complex Networks	IEEE TPDS	2017	Henning Meyerhenke, Peter Sanders, Christian Schulz
Drawing Large Graphs by Multilevel Maxent-Stress Optimization	IEEE TVCG	2017	Henning Meyerhenke, Martin Nöllenburg, Christian Schulz

Publications
Titel	Quelle	Datum	Autor
Scalable Kernelization for Maximum Independent Sets	ALENEX'18	to appear	Demian Hespe, Christian Schulz and Darren Strash
Practical Minimum Cut Algorithms	ALENEX'18	to appear	Monika Henzinger, Alexander Noe, Christian Schulz and Darren Strash
Distributed Evolutionary k-way Node Separators	GECCO'17	July 2017	Peter Sanders, Christian Schulz, Darren Strash, Robert Williger
Graph Partitioning with Acyclicity Constraints	SEA'17	June 2017	Orlando Moreira, Merten Popp, Christian Schulz
Better Process Mapping and Sparse Quadradic Assignment	SEA'17	June 2017	Christian Schulz, Jesper Larsson Träff
Accelerating Local Search for the Maximum Independent Set Problem	SEA'16	June 2016	Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash and Renato F. Werneck
Advanced Multilevel Node Separator Algorithms	SEA'16	June 2016	Peter Sanders, Christian Schulz
Finding Near-Optimal Independent Sets at Scale	ALENEX'16	January 2016	Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck
k-way Hypergraph Partitioning via n-Level Recursive Bisection	ALENEX'16	2016	Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz
Incorporating Road Networks into Territory Design	GIS'15	November 2015	Nitin Ahuja, Matthias Bender, Peter Sanders, Christian Schulz and Andreas Wagner
Drawing Large Graphs by Multilevel Maxent-Stress Optimization	GD'15	September 2015	Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
Graph Partitioning for Independent Sets	SEA'15	June 2015	Sebastian Lamm, Peter Sanders and Christian Schulz
Practical Massively Parallel Sorting	SPAA'15	June 2015	Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz
Parallel Graph Partitioning for Complex Networks	IPDPS'15	Mai 2015	Henning Meyerhenke, Peter Sanders, Christian Schulz
(Semi-)External Algorithms for Graph Partitioning and Clustering	ALENEX'15	January 2015	Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
Partitioning Complex Networks via Size-constrained Clustering	SEA'14	Juni 2014	Henning Meyerhenke, Peter Sanders, Christian Schulz
Tree-based Coarsening and Partitioning of Complex Networks	SEA'14	Juni 2014	Roland Glantz, Henning Meyerhenke, Christian Schulz
Efficient Parallel and External Matching	Euro-Par'13	August 2013	Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava
Think Locally, Act Globally: Highly Balanced Graph Partitioning	SEA'13	Juni 2013	Peter Sanders and Christian Schulz
High Quality Graph Partitioning	DIMACS'12	April 2013	Peter Sanders and Christian Schulz
Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries	Euro-Par'12	August 2012	J. Fietz, M. Krause, P. Sanders, C. Schulz and V. Heuveline
Engineering Graph Partitioning Algorithms	SEA'12	Juni 2012	Vitaly Osipov, Peter Sanders, Christian Schulz
Advanced Coarsening Schemes for Graph Partitioning	SEA'12	Juni 2012	Ilya Safro, Peter Sanders, Christian Schulz
Distributed Evolutionary Graph Partitioning	ALENEX'12	Januar 2012	Peter Sanders, Christian Schulz
Engineering Multilevel Graph Partitioning Algorithms	ESA'11	September 2011	Peter Sanders, Christian Schulz
Engineering State-of-the-Art Graph Partitioning Libraries @KIT	SimLab@KIT	November 2010	Vitaly Osipov, Peter Sanders, Christian Schulz, Manuel Holtgrewe
Engineering a Scalable High Quality Graph Partitioner	IPDPS'10	April 2010	Manuel Holtgrewe, Peter Sanders, Christian Schulz
ORCA Reduction and ContrAction Graph Clustering	AAIM'09	June 2009	Daniel Delling, Robert Görke, Christian Schulz, and Dorothea Wagner

Talks
Titel	Tagungsort	Datum
Big Data Graph Algorithms	Vienna	January 2016
Big Data Graph Algorithms	Aachen	December 2015
Drawing Large Graphs by Multilevel Maxent-Stress Optimization	Los Angeles	September 2015
Parallel Graph Partitioning for Complex Networks	Pittsburgh	July 2015
Parallel Graph Partitioning for Complex Networks	Hyderabad	Mai 2015
Partitioning Complex Networks	New York	March 2015
Partitioning Complex Networks	Kalkutta	March 2015
Partitioning Complex Networks	Vienna	February 2015
Partitioning Complex Networks	Palo Alto	January 2015
Parallel Graph Partitioning for Complex Networks	Dagstuhl	November 2014
High Quality Graph Partitioning	Pforzheim	Oktober 2014
Partitioning Complex Networks via Size-constrained Clustering	Copenhagen	Juni 2014
Partitioning Complex Networks via Size-constrained Clustering	Karlsruhe	April 2014
Dissertationsvortrag	Karlsruhe	July 2013
High Quality Graph Partitioning	New York	Juni 2013
Think Locally, Act Globally: Highly Balanced Graph Partitioning	Rom	Juni 2013
High Quality Graph Partitioning	Karlsruhe	Januar 2013
Distributed Evolutionary Graph Partitioning	Agra	Januar 2013
Graph Partitioning	Karlsruhe	November 2012
High Quality Graph Partitioning	Berlin	August 2012
Engineering Graph Partitioning Algorithms	Park City	July 2012
Engineering Graph Partitioning Algorithms	Karlsruhe	July 2012
Advanced Coarsening Schemes for Graph Partitioning	Bordeaux	Juni 2012
Engineering Graph Partitioning Algorithms	Dortmund	April 2012
High Quality Graph Partitioning	Atlanta	Februar 2012
Distributed Evolutionary Graph Partitioning	Kyoto	Januar 2012
Engineering Multilevel Graph Partitioning Algorithms	Karlsruhe	November 2011
Engineering Multilevel Graph Partitioning Algorithms	Erice	Oktober 2011
Engineering Multilevel Graph Partitioning Algorithms	Saarbrücken	September 2011
Engineering Multilevel Graph Partitioning Algorithms	Reno	März 2011
Engineering Multilevel Graph Partitioning Algorithms	Karlsruhe	Januar 2011
Engineering Multilevel Graph Partitioning Algorithms	Königswinter	Dezember 2010
Engineering Multilevel Graph Partitioning Algorithms	Köln	Dezember 2010
Engineering a Scalable High Quality Graph Partitioner	Karlsruhe	November 2010
Engineering a Scalable High Quality Graph Partitioner	Atlanta	April 2010
Engineering a Scalable High Quality Graph Partitioner	Paderborn	November 2009
Scalable Parallel Refinement of Graph Partitions	Karlsruhe	Mai 2009
Design and Experimental Evaluation of a Local Graph Clustering Algorithm	Karlsruhe	Juni 2008

Supervised Thesises
Titel	Forschungsthema	Bearbeiter
Scalable Kernelization for the Maximum Independent Set Problem	Independent Sets	Demian Hespe
Communication Efficient Algorithms for Generating Massive Networks	Graph Generation	Sebastian Lamm
Evolutionary k-way Node Separators	Graph Partitioning	Robert Williger
How to Partition a Graph When You Think Like A Vertex	Graph Partitioning	Jan Ebbing
Boosting Local Search for the Maximum Independent Set Problem	Independent Set	Jakob Dahlum
Label Propagation for Hypergraph Partitioning	Hypergraph Partitioning	Vitali Henne
Evolutionary Algorithms For Independent Sets	Evolutionary Algorithms	Sebastian Lamm
Finding Small Node Separators	Graph Partitioning	Michael Wegner
Coloring Complex Networks	Graph Coloring	Klaus Lukas Hübner
Graphpartitionierung zur Berücksichtigung des Straßengraphen in der Gebietsplanung	Gebietsplanung	Andreas Wagner
n-Level Hypergraph Partitioning	Graph Partitioning	Florian Ziegler
Engineering Fast Parallel Matching Algorithms	Matchings	Marcel Birn
Perf. Optimization of Parallel LB Fluid Flow Simulations on Complex Geometries	HPC	Jonas Fietz
Engineering Edge Ratings and Matching Algorithms for MGP	Graph Partitioning	Maximilian Schuler

Open Thesises
Titel	Forschungsthema	Betreuer
Minimization of Maximum Communication Volume	Graph Partitioning	Christian Schulz
Pareto Algorithm Configuration	Automatic Algorithm Configuration	Christian Schulz
Knotenseparatoren	Graphpartitionierung	Christian Schulz
Graphclustering	Graphclustering	Andrea Schumm, Christian Schulz
Evolutionary Graph Coloring	Graph Coloring	Christian Schulz
Meta-Heuristiken für Graph Partitionierung	Graphpartitionierung	Christian Schulz
Initial Partitioning	Graphpartitionierung	Christian Schulz

Former and Current Courses
Titel	Typ
Algorithmen II	Vorlesung (V)
Graphpartitionierung und Graphenclustern in Theorie und Praxis	Vorlesung (V)
Graphpartitionierung und Graphenclustern in Theorie und Praxis	Vorlesung (V)
Algorithmen I mit Übung	Vorlesung mit Übung
Parallele Algorithmen	Vorlesung
Graphpartitionierung	Proseminar / Seminar (PS)
Proseminar Algorithmentechnik	Proseminar
Praktikum Algorithm Engineering - Graphgenerierung	Praktikum
Algorithmen I mit Übung	Vorl./Üb.

Prof. PD. Dr. Christian Schulz

Update

Software