In this paper, we present an approximate distance oracle for fault-tolerant Euclidean
spanners. An $ f $-fault-tolerant Euclidean $ t $-spanner for a point set $ V\subset\mathbb …

We design the first efficient sensitivity oracles and dynamic algorithms for a variety of
parameterized problems. Our main approach is to modify the algebraic coding technique …

We design sensitivity oracles for error-prone networks. For a network problem $\Pi $, the
data structure preprocesses a network $ G=(V, E) $ and sensitivity parameter $ f $ such that …

The streaming model was introduced to parameterized complexity independently by
Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and Monemizadeh …

In this paper, we present approximate distance and shortest-path oracles for fault-tolerant
Euclidean spanners motivated by the routing problem in real-world road networks. An $ f …

In this paper, we present the first decremental fixed-parameter sensitivity oracles for a
number of basic covering and packing problems on graphs. In particular, we obtain the first …