48 citations · 169 across the 56 of their papers we have counts for
5 papers · 1 filter
Two-Color Babylon
Agelos Georgakopoulos, Peter Winkler
We solve the game of Babylon when played with chips of two colors, giving a winning strategy for the second player in all previously unsolved cases.
New Bounds for Edge-Cover by Random Walk
Agelos Georgakopoulos, Peter Winkler
We show that the expected time for a random walk on a (multi-)graph to traverse all edges of , and return to its starting point, is at most ; if each edge must be…
On fixing boundary points of transitive hyperbolic graphs
Agelos Georgakopoulos, Matthias Hamann
We show that there is no 1-ended, planar, hyperbolic graph such that the stabilizer of one of its hyperbolic boundary points acts transitively on the vertices of the graph. This gi…
The planar cubic Cayley graphs
Agelos Georgakopoulos
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising…
The planar cubic Cayley graphs of connectivity 2
Agelos Georgakopoulos
We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete descriptio…