Christopher Weyand

16 papers A 4B 4Journal 5Unranked 2
YearRankTypeTitle / Venue / Authors
2023 A conf
Efficiently Computing Directed Minimum Spanning Trees.
ALENEX
Maximilian Böther, Otto Kißig, Christopher Weyand
2023 — —
Geometric Inhomogeneous Random Graphs for Algorithm Engineering.
Christopher Weyand
2022 B conf
A Branch-And-Bound Algorithm for Cluster Editing.
SEA
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
2022 A conf
An Efficient Branch-and-Bound Solver for Hitting Set.
ALENEX
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
2022 B conf
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.
IPEC
Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
2022 J jnl
Efficiently Computing Directed Minimum Spanning Trees.
CoRR
Maximilian Böther, Otto Kißig, Christopher Weyand
2022 J jnl
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Netw. Sci.
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2021 — conf
Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets.
EuroVis (Short Papers)
Willy Scheibel, Christopher Weyand, Joseph Bethge, Jürgen Döllner
2021 J jnl
An Efficient Branch-and-Bound Solver for Hitting Set.
CoRR
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
2021 A conf
Efficiently Computing Maximum Flows in Scale-Free Networks.
ESA
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
2021 B conf
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
IPEC
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
2021 B conf
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
IPEC
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm
2020 J jnl
Efficiently Computing Maximum Flows in Scale-Free Networks.
CoRR
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
2019 A conf
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
ESA
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019 J jnl
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
CoRR
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2018 — conf
EvoCells - A Treemap Layout Algorithm for Evolving Tree Data.
VISIGRAPP (3: IVAPP)
Willy Scheibel, Christopher Weyand, Jürgen Döllner