42 citations · 75 across the 11 of their papers we have counts for
6 papers · 1 filter
Perpetual maintenance of machines with different urgency requirements
Leszek Gąsieniec, Tomasz Jurdziński, Ralf Klasing +4
A garden is populated by bamboos with the respective daily growth rates . It is assumed that the initial heights of…
Monitoring the edges of a graph using distances
Florent Foucaud, Shih-Shun Kao, Ralf Klasing +2
We introduce a new graph-theoretic concept in the area of network monitoring. A set of vertices of a graph is a \emph{distance-edge-monitoring set} if for every edge of…
Parameterized and approximation complexity of the detection pair problem in graphs
Florent Foucaud, Ralf Klasing
We study the complexity of the problem DETECTION PAIR. A detection pair of a graph is a pair of sets of detectors with , the watchers, and $L\subseteq…
Efficiently Testing T-Interval Connectivity in Dynamic Graphs
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz +1
Many types of dynamic networks are made up of durable entities whose links evolve over time. When considered from a {\em global} and {\em discrete} standpoint, these networks are o…
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski +1
We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to travers…
Improved Analysis of Deterministic Load-Balancing Schemes
Petra Berenbrink, Ralf Klasing, Adrian Kosowski +2
We consider the problem of deterministic load balancing of tokens in the discrete model. A set of processors is connected into a -regular undirected network. In every time s…