Christopher Weyand
Postdoctoral Researcher
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
| christopher.weyand@kit.edu | |
| office | Room 310, Computer Science building 50.34 |
Teaching
- WS 14/15 Student Employee: Modellierung I, Hasso Plattner Institute, Chair for Business Process Technology
- SS 15 Student Employee: Modellierung II, Hasso Plattner Institute, Chair for System Analysis and Modeling.
- WS 15/16 Student Employee: Modellierung I, Hasso Plattner Institute, Chair for System Analysis and Modeling.
- SS 16 Student Employee: Modellierung II, Hasso Plattner Institute, Chair for System Analysis and Modeling.
- WS 16/17 Student Employee: Softwarearchitektur, Hasso Plattner Institute, Software Architecture Group.
- SS 18 Student Employee: Advanced Competitive Programming, Hasso Plattner Institute, Chair for Algorithm Engineering.
- WS 18/19 Teaching Assistant: Algorithmic Problem Solving, Hasso Plattner Institute, Chair for Algorithm Engineering.
- SS 19 Advanced Competitive Programming, Hasso Plattner Institute, Chair for Algorithm Engineering.
- WS 19/20 Advanced Competitive Programming Contest Design, Hasso Plattner Institute, Chair for Algorithm Engineering.
- SS 20 Advanced Competitive Programming, Hasso Plattner Institute, Chair for Algorithm Engineering.
- WS 20/21 Advanced Competitive Programming Contest Design, Hasso Plattner Institute, Chair for Algorithm Engineering.
- WS 20/21 Uncovering Chains of Infection, Hasso Plattner Institute, Chair for Algorithm Engineering.
- SS 21 Advanced Competitive Programming, Hasso Plattner Institute, Chair for Algorithm Engineering.
- SS 21 Basispraktikum zum ICPC Programmierwettbewerb, Karlsruhe Institute of Technology, Chair for Algorithmics.
- SS 21 Proseminar: Algorithmen für NP-schwere Probleme, Karlsruhe Institute of Technology, Chair for Algorithmics.
- SS 21 Praxis der Software Entwicklung, Karlsruhe Institute of Technology, Chair for Scalable Algorithms.
- WS 21/22 Advanced Competitive Programming 2, Hasso Plattner Institute, Chair for Algorithm Engineering.
- WS 21/22 Fortgeschrittenes Algorithmisches Programmieren, Karlsruhe Institute of Technology, Chair for Scalable Algorithms.
- SS 22 Advanced Competitive Programming, Hasso Plattner Institute, Chair for Algorithm Engineering.
- SS 22 Basispraktikum zum ICPC Programmierwettbewerb, Karlsruhe Institute of Technology, Chair for Algorithmics.
- SS 22 Proseminar: Algorithmen für NP-schwere Probleme, Karlsruhe Institute of Technology, Chair for Algorithmics.
- WS 22/23 Fortgeschrittenes Algorithmisches Programmieren, Karlsruhe Institute of Technology, Chair for Scalable Algorithms.
- SS 23 Basispraktikum zum ICPC Programmierwettbewerb, Karlsruhe Institute of Technology, Chair for Algorithmics.
- SS 23 Proseminar: Algorithmen für NP-schwere Probleme, Karlsruhe Institute of Technology, Chair for Scalable Algorithms.
- WS 23/24 Fortgeschrittenes Algorithmisches Programmieren, Karlsruhe Institute of Technology, Chair for Scalable Algorithms.
Publications
2023
Geometric Inhomogeneous Random Graphs for Algorithm Engineering.
Karlsruhe Institute of Technology, Germany 2023
Efficiently Computing Directed Minimum Spanning Trees.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2023
2022
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Network Science 2022
An Efficient Branch-and-Bound Solver for Hitting Set.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2022
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.
International Symposium on Parameterized and Exact Computation (IPEC) 2022
A Branch-And-Bound Algorithm for Cluster Editing.
Symposium on Experimental and Efficient Algorithms (SEA) 2022
Efficiently Computing Directed Minimum Spanning Trees.
Computing Research Repository (CoRR) 2022
2021
Efficiently Computing Maximum Flows in Scale-Free Networks.
European Symposium on Algorithms (ESA) 2021
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets.
Eurographics Conference on Visualization (EuroVis) 2021
An Efficient Branch-and-Bound Solver for Hitting Set.
Computing Research Repository (CoRR) 2021
2020
Efficiently Computing Maximum Flows in Scale-Free Networks.
Computing Research Repository (CoRR) 2020
2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
European Symposium on Algorithms (ESA) 2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
Computing Research Repository (CoRR) 2019
2018
EvoCells - A Treemap Layout Algorithm for Evolving Tree Data.
International Conference on Information Visualization Theory and Applications (IVAPP) 2018