We consider the distributed complexity of the (degree+1)-list coloring
p...
We consider the classic k-center problem in a parallel setting, on the
l...
Graph coloring problems are arguably among the most fundamental graph
pr...
Hybrid communication networks provide multiple modes of communication wi...
Hybrid networks, i.e., networks that leverage different means of
communi...
We consider the problem of designing fundamental graph algorithms on the...