3 papers
cs.CG2026
Parameterized Hardness of Mixed 2-Sided Orthant Depth
Michelle Döring, Georg Tennigkeit
We consider the maximum-depth problem for mixed 2-sided orthants in R^d: each region imposes one lower bound and one upper bound on distinct coordinates, and the task is to find a…
cs.DS2026
Maximizing Reachability via Shifting of Temporal Paths
Argyrios Deligkas, Michelle Döring, Eduard Eiben +2
We examine the problem of maximizing the reachability of a given source in temporal graphs that are given as the union of k temporal paths, i.e., every given path is a sequence of…
cs.DS2025
Parameterized Complexity of Temporal Connected Components
Argyrios Deligkas, Michelle Döring, Eduard Eiben +3
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, that is, graphs whose edges are available only at specific points in time.…