Scholar
Christian Schulz
Google Scholar ID: SZ_vC90AAAAJ
Professor of Computer Science, Heidelberg University
Citations & Impact
Citations
3,499
H-index
30
i10-index
59
Publications
20
Co-authors
77
list available
Publications
Resume (English only)
Academic Achievements
- Has over 100 publications, mostly on algorithms in the context of scalable graph algorithms, including multilevel algorithms, parallel algorithms, streaming algorithms, etc.; Received various awards for his research, e.g., the Heinz Billing Prize, the KIT doctoral award, as well as best paper awards at IPDPS, SEA, and 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.
Research Experience
- Led the graph partitioning & parallel processing subgroup in the group of Peter Sanders and later on led the algorithm engineering subgroup of the group of Monika Henzinger in Vienna; Currently, a full professor at Heidelberg University.
Education
- Received his Ph.D. in computer science from Karlsruhe Institute of Technology, Germany in 2013; Obtained a habilitation in computer science in 2019.
Background
- Research Interests: Engineering scalable graph algorithms, particularly for different models of computation such as parallel [shared-memory, dist-memory, many-core], streaming, as well as a wide range of problems such as graph decomposition, practical kernelization, dynamic problems, and machine learning in combinatorial optimization. Professional Field: Algorithm Engineering.
Miscellany
- Personal Website: https://skylerhallinan.com/; LinkedIn: [here]; Google Scholar: [here]
