11 citations · 14 across the 3 of their papers we have counts for
3 papers
math.CO2013
Excluding Pairs of Graphs
Maria Chudnovsky, Alex Scott, Paul Seymour
For a graph and a set of graphs , we say that is {\em -free} if no induced subgraph of is isomorphic to a member of . Given an in…
cs.DC2012★ 3 cited
Feedback from nature: an optimal distributed algorithm for maximal independent set selection
Alex Scott, Peter Jeavons, Lei Xu
Maximal Independent Set selection is a fundamental problem in distributed computing. A novel probabilistic algorithm for this problem has recently been proposed by Afek et al, insp…
math.CO2010★ 11 cited
A new bound for the cops and robbers problem
Alex Scott, Benny Sudakov
In this short paper we study the game of cops and robbers, which is played on the vertices of some fixed graph . Cops and a robber are allowed to move along the edges of and…