Christopher Weyand

Orcid: 0000-0003-0354-6650

According to our database1, Christopher Weyand authored at least 11 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Geometric Inhomogeneous Random Graphs for Algorithm Engineering.
PhD thesis, 2023

Efficiently Computing Directed Minimum Spanning Trees.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Netw. Sci., December, 2022

A Branch-And-Bound Algorithm for Cluster Editing.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

An Efficient Branch-and-Bound Solver for Hitting Set.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021
Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets.
Proceedings of the 21st Eurographics Conference on Visualization, 2021

PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Efficiently Computing Maximum Flows in Scale-Free Networks.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2018
EvoCells - A Treemap Layout Algorithm for Evolving Tree Data.
Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), 2018


  Loading...