Christopher Weyand
This is an archived page of a former group member.
Christopher Weyand is now a PhD student in the Scalable Algorithms group at the Karlsruhe Institute of Technology.
Publications
2023
Böther, Maximilian; Kißig, Otto; Weyand, ChristopherEfficiently Computing Directed Minimum Spanning TreesSIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023: 86–95
2022
Bläsius, Thomas; Friedrich, Tobias; Stangl, David; Weyand, ChristopherAn Efficient Branch-and-Bound Solver for Hitting SetAlgorithm Engineering and Experiments (ALENEX) 2022
Bläsius, Thomas; Fischbeck, Philipp; Gottesbüren, Lars; Hamann, Michael; Heuer, Tobias; Spinner, Jonas; Weyand, Christopher; Wilhelm, MarcusA Branch-and-Bound Algorithm for Cluster EditingSymposium on Experimental Algorithms (SEA) 2022: 13:1–13:19
2021
Bläsius, Thomas; Friedrich, Tobias; Weyand, ChristopherEfficiently Computing Maximum Flows in Scale-Free NetworksEuropean Symposium on Algorithms (ESA) 2021: 21:1–21:14
Bläsius, Thomas; Fischbeck, Philipp; Gottesbüren, Lars; Hamann, Michael; Heuer, Tobias; Spinner, Jonas; Weyand, Christopher; Wilhelm, MarcusPACE Solver Description: The KaPoCE Exact Cluster Editing AlgorithmInternational Symposium on Parameterized and Exact Computation (IPEC) 2021: 27:1–27:3
Bläsius, Thomas; Fischbeck, Philipp; Gottesbüren, Lars; Hamann, Michael; Heuer, Tobias; Spinner, Jonas; Weyand, Christopher; Wilhelm, MarcusPACE Solver Description: KaPoCE: A Heuristic Cluster Editing AlgorithmInternational Symposium on Parameterized and Exact Computation (IPEC) 2021: 31:1–31:4
2019
Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Meyer, Ulrich; Penschuck, Manuel; Weyand, ChristopherEfficiently Generating Geometric Inhomogeneous and Hyperbolic Random GraphsEuropean Symposium on Algorithms (ESA) 2019: 21:2–21:14
EATCS Best Paper Award
2018