7 citations · 10 across the 12 of their papers we have counts for
6 papers · 2 filters
Fairness in Repetitive Scheduling
Danny Hermelin, Hendrik Molter, Rolf Niedermeier +2
Recent research found that fairness plays a key role in customer satisfaction. Therefore, many manufacturing and services industries have become aware of the need to treat customer…
Temporal Interval Cliques and Independent Sets
Danny Hermelin, Yuval Itzhaki, Hendrik Molter +1
Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. The Temporal Clique problem, that generalizes th…
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Maciej Rymar, Hendrik Molter, André Nichterlein +1
In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality…
Interference-free Walks in Time: Temporally Disjoint Paths
Nina Klobas, George B. Mertzios, Hendrik Molter +2
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal pa…
Temporal Reachability Minimization: Delaying vs. Deleting
Hendrik Molter, Malte Renken, Philipp Zschoche
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases…
The Complexity of Transitively Orienting Temporal Graphs
George B. Mertzios, Hendrik Molter, Malte Renken +2
In a temporal network with discrete time-labels on its edges, entities and information can only ``flow'' along sequences of edges whose time-labels are non-decreasing (resp. increa…