3 papers
cs.DS2026
Advances in Exact and Approximate Group Closeness Centrality Maximization
Christian Schulz, Jakob Ternes, Henning Woydt
In the NP-hard \textsc{Group Closeness Centrality Maximization} problem, the input is a graph and a positive integer , and the task is to find a set …
cs.DC2026
GPU-Accelerated Algorithms for Process Mapping
Petr Samoldekin, Christian Schulz, Henning Woydt
Process mapping asks to assign vertices of a task graph to processing elements of a supercomputer such that the computational workload is balanced while the communication cost is m…
cs.DC2025
Shared-Memory Hierarchical Process Mapping
Christian Schulz, Henning Woydt
Modern large-scale scientific applications consist of thousands to millions of individual tasks. These tasks involve not only computation but also communication with one another. T…