Christopher Weyand

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 15

Top Topics

Optimal Solution

Minimum Spanning Trees

Representative Subset

Efficiently Computing

Top Venues

Publications

Maximilian Böther, Otto Kißig, Christopher Weyand
Efficiently Computing Directed Minimum Spanning Trees. ALENEX (2023)
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX (2022)
Maximilian Böther, Otto Kißig, Christopher Weyand
Efficiently Computing Directed Minimum Spanning Trees. CoRR (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. SEA (2022)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10 (4) (2022)
Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC (2022)
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. 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. EuroVis (Short Papers) (2021)
Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
An Efficient Branch-and-Bound Solver for Hitting Set. CoRR (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. IPEC (2021)
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
Efficiently Computing Maximum Flows in Scale-Free Networks. ESA (2021)
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
Efficiently Computing Maximum Flows in Scale-Free Networks. CoRR (2020)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR (2019)
Willy Scheibel, Christopher Weyand, Jürgen Döllner
EvoCells - A Treemap Layout Algorithm for Evolving Tree Data. VISIGRAPP (3: IVAPP) (2018)