Nicolas Nisse

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round

In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we consider is a restriction of the classical

Data gathering and personalized broadcasting in radio grids with interference

cal{CONGEST}

On the Complexity of Computing Treebreadth

(distributed) model and it is close to the simultaneous messages (communication complexity) model defined by Babai, Kimmel and Lokam. More precisely, each of these

Minimum Size Tree-Decompositions

n

On the monotonicity of process number

nodes-which only knows its own ID and the IDs of its neighbors- is allowed to send a message of

Non-deterministic graph searching in trees

O(log n)

Allowing each node to communicate only once in a distributed system: shared whiteboard models

bits to some central entity, called the referee. Is it possible for the referee to decide some basic structural properties of the network topology

An Unified FPT Algorithm for Width of Partition Functions

G

Minimum Size Tree-decompositions

? We show that simple questions like, does

Size-Constrained Tree Decompositions

G