2023
Geometric Inhomogeneous Random Graphs for Algorithm Engineering.
Karlsruhe Institute of Technology, Germany 2023
Efficiently Computing Directed Minimum Spanning Trees.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2023
2022
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Network Science 2022
An Efficient Branch-and-Bound Solver for Hitting Set.
Workshop on Algorithm Engineering and Experimentation (ALENEX) 2022
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.
International Symposium on Parameterized and Exact Computation (IPEC) 2022
A Branch-And-Bound Algorithm for Cluster Editing.
Symposium on Experimental and Efficient Algorithms (SEA) 2022
2021
Efficiently Computing Maximum Flows in Scale-Free Networks.
European Symposium on Algorithms (ESA) 2021
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
International Symposium on Parameterized and Exact Computation (IPEC) 2021
Algorithmic Improvements on Hilbert and Moore Treemaps for Visualization of Large Tree-structured Datasets.
Eurographics Conference on Visualization (EuroVis) 2021
2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
European Symposium on Algorithms (ESA) 2019
2018
EvoCells - A Treemap Layout Algorithm for Evolving Tree Data.
International Conference on Information Visualization Theory and Applications (IVAPP) 2018