2023
Christopher Weyand
Geometric Inhomogeneous Random Graphs for Algorithm Engineering.
Karlsruhe Institute of Technology, Germany 2023
Maximilian Böther, Otto Kißig, Christopher Weyand
Efficiently Computing Directed Minimum Spanning Trees.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2023
2022
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Network Science 2022
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2022
Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.
International Symposium on Parameterized and Exact Computation (IPEC) 2022
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
A Branch-And-Bound Algorithm for Cluster Editing.
Symposium on Experimental and Efficient Algorithms (SEA) 2022
Maximilian Böther, Otto Kißig, Christopher Weyand
Efficiently Computing Directed Minimum Spanning Trees.
Computing Research Repository (CoRR) 2022
2021
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
Efficiently Computing Maximum Flows in Scale-Free Networks.
European Symposium on Algorithms (ESA) 2021
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
Willy Scheibel, Christopher Weyand, Joseph Bethge, Jürgen Döllner
Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets.
Eurographics Conference on Visualization (EuroVis) 2021
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set.
Computing Research Repository (CoRR) 2021
2020
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
Efficiently Computing Maximum Flows in Scale-Free Networks.
Computing Research Repository (CoRR) 2020
2019
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
European Symposium on Algorithms (ESA) 2019
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
Computing Research Repository (CoRR) 2019
2018
Willy Scheibel, Christopher Weyand, Jürgen Döllner
EvoCells - A Treemap Layout Algorithm for Evolving Tree Data.
International Conference on Information Visualization Theory and Applications (IVAPP) 2018