1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023★ 1 cited
Parameterized Algorithms for Colored Clustering
Leon Kellerhals, Tomohiro Koana, Pascal Kunz +1
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many ed…
cs.DS2023
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
Pascal Kunz, Hendrik Molter, Meirav Zehavi
A temporal graph has an edge set that may change over discrete time steps, and a temporal path (or walk) must traverse edges that appear at increasing time steps. Accordingly, two…