9 citations · 47 across the 26 of their papers we have counts for
6 papers · 1 filter
Hardness of Interval Scheduling on Unrelated Machines
Danny Hermelin, Yuval Itzhaki, Hendrik Molter +1
We provide new (parameterized) computational hardness results for Interval Scheduling on Unrelated Machines. It is a classical scheduling problem motivated from just-in-time or lea…
Counting Temporal Paths
Jessica Enright, Kitty Meeks, Hendrik Molter
The betweenness centrality of a vertex v is an important centrality measure that quantifies how many optimal paths between pairs of other vertices visit v. Computing betweenness ce…
Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions
Danny Hermelin, Hendrik Molter, Dvir Shabtay
The problem asks to determine -- given jobs each with its own processing time, weight, and due date -- the minimum weighted number of tardy jobs in any s…
The complexity of computing optimum labelings for temporal connectivity
Nina Klobas, George B. Mertzios, Hendrik Molter +1
A graph is temporally connected if there exists a strict temporal path, i.e. a path whose edges have strictly increasing labels, from every vertex to every other vertex . In…
Delay-Robust Routes in Temporal Graphs
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier +1
Most transportation networks are inherently temporal: Connections (e.g. flights, train runs) are only available at certain, scheduled times. When transporting passengers or commodi…
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier +1
Consider planning a trip in a train network. In contrast to, say, a road network, the edges are temporal, i.e., they are only available at certain times. Another important difficul…