EvoCells - A Treemap Layout Algorithm for Evolving Tree Data. - Willy Scheibel; Christopher Weyand; Jürgen Döllner (VISIGRAPP (3: IVAPP), 2018)

Efficiently Computing Maximum Flows in Scale-Free Networks. - Thomas Bläsius; Tobias Friedrich 001; Christopher Weyand (ESA, 2021)

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (IPEC, 2021)

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (IPEC, 2021)

Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets. - Willy Scheibel; Christopher Weyand; Joseph Bethge; Jürgen Döllner (EuroVis (Short Papers), 2021)

An Efficient Branch-and-Bound Solver for Hitting Set. - Thomas Bläsius; Tobias Friedrich 001; David Stangl; Christopher Weyand (ALENEX, 2022)

Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. - Hjalmar Schulz; André Nichterlein; Rolf Niedermeier; Christopher Weyand (IPEC, 2022)

A Branch-And-Bound Algorithm for Cluster Editing. - Thomas Bläsius; Philipp Fischbeck; Lars Gottesbüren; Michael Hamann; Tobias Heuer; Jonas Spinner; Christopher Weyand; Marcus Wilhelm (SEA, 2022)

Efficiently generating geometric inhomogeneous and hyperbolic random graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Ulrich Meyer 001; Manuel Penschuck; Christopher Weyand (Netw. Sci., 2022)

Efficiently Computing Directed Minimum Spanning Trees. - Maximilian Böther; Otto Kißig; Christopher Weyand (ALENEX, 2023)

Geometric Inhomogeneous Random Graphs for Algorithm Engineering. - Christopher Weyand (2023)