Dipl.-Math., Dipl.-Inform. Christian Schulz

Graphpartitioning
Office Hours:

tuesday 10-11h

at any time if door is open

or on appointment

Room: 209
Phone: +49 721 608-45267
Fax: +49 721 608-43088
christian schulzSPAM∂kit edu

Technical Reports
Titel	Autoren
Efficient Parallel and External Matching	Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava
Think Locally, Act Globally: Perfectly Balanced Graph Partitioning	Peter Sanders, Christian Schulz

Publications
Titel	Quelle	Datum	Autor
High Quality Graph Partitioning	DIMACS'12	to appear	Peter Sanders and Christian Schulz
Benchmarks for Network Analysis	ESNAM	to appear	David Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz and Dorothea Wagner
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 2012	Juni 2012	Ilya Safra, Peter Sanders, Christian Schulz
Distributed Evolutionary Graph Partitioning	ALENEX 2012	Januar 2012	Peter Sanders, Christian Schulz
Engineering Multilevel Graph Partitioning Algorithms	ESA 2011	September 2011	Peter Sanders, Christian Schulz
Engineering State-of-the-Art Graph Partitioning Libraries @KIT	SimLab@KIT	November 2011	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	Location	Datum
Engineering a Scalable High Quality Graph Partitioner	Atlanta	April 2010
Engineering Graph Partitioning Algorithms	Dortmund	April 2012
Engineering Graph Partitioning Algorithms	Berlin	August 2012
SPP Algorithm Engineering	Collogne	December 2010
Engineering Multilevel Graph Partitioning Algorithms	Königswinter	December 2010
High Quality Graph Partitioning	Atlanta	Februar 2012
Engineering Multilevel Graph Partitioning Algorithms	Karlsruhe	Januar 2011
Distributed Evolutionary Graph Partitioning	Agra	Januar 2013
High Quality Graph Partitioning	Karlsruhe	Januar 2013
Distributed Evolutionary Graph Partitioning	Kyoto	January 2012
Engineering Graph Partitioning Algorithms	Park City	July 2012
Engineering Graph Partitioning Algorithms	Karlsruhe	July 2012
Design and experimental evaluation of a local graph clustering algorithm	Karlsruhe	Juni 2008
Advanced Coarsening Schemes for Graph Partitioning	Bordeaux	Juni 2012
Scalable Parallel Refinement of Graph Partitions	Karlsruhe	Mai 2009
Engineering Multilevel Graph Partitioning Algorithms	Reno	March 2011
Engineering a Scalable High Quality Graph Partitioner	Paderborn	November 2009
Engineering a Scalable High Quality Graph Partitioner	Karlsruhe	November 2010
Engineering Multilevel Graph Partitioning Algorithms	Karlsruhe	November 2011
Graph Partitioning	Karlsruhe	November 2012
Engineering Multilevel Graph Partitioning Algorithms	Erice	Oktober 2011
Engineering Multilevel Graph Partitioning Algorithms	Saarbrücken	September 2011

Supervised Thesises
Titel	Forschungsthema	Bearbeiter
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
Title	Subject	Supervisor
Meta-Heuristics for Graph Partitioning	Graph Partitioning	Christian Schulz
Graph Partitioning	Graph Partitioning	Christian Schulz

Former Courses
Title	Type
Algorithmen I mit Übung	Vorlesung mit Übung
Parallele Algorithmen	lecture
Proseminar Algorithmentechnik	proseminar
Praktikum Algorithm Engineering - Algorithmen zur Graphgenerierung	lab course
Algorithmen I mit Übung	Vorl./Üb.