37 citations · 72 across the 10 of their papers we have counts for
13 papers
Maximum Rooted Connected Expansion
Ioannis Lamprou, Russell Martin, Sven Schewe +2
Prefetching constitutes a valuable tool toward efficient Web surfing. As a result, estimating the amount of resources that need to be preloaded during a surfer's browsing becomes a…
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Ioannis Lamprou, Russell Martin, Paul Spirakis
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying gener…
Perpetually Dominating Large Grids
Ioannis Lamprou, Russell Martin, Sven Schewe
In the m-\emph{Eternal Domination} game, a team of guard tokens initially occupies a dominating set on a graph . An attacker then picks a vertex without a guard on it and attack…
Fast Two-Robot Disk Evacuation with Wireless Communication
Ioannis Lamprou, Russell Martin, Sven Schewe
In the fast evacuation problem, we study the path planning problem for two robots who want to minimize the worst-case evacuation time on the unit disk. The robots are initially pla…
Deterministic Symmetry Breaking in Ring Networks
Leszek Gasieniec, Tomasz Jurdzinski, Russell Martin +1
We study a distributed coordination mechanism for uniform agents located on a circle. The agents perform their actions in synchronised rounds. At the beginning of each round an age…
Exact counting of Euler Tours for Graphs of Bounded Treewidth
Prasad Chebolu, Mary Cryan, Russell Martin
In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs a…