- Full text PDF available (53)
- This year (3)
- Last 5 years (29)
- Last 10 years (58)
Journals and Conferences
Data Set Used
Scott proved in 1997 that for any tree T , every graph with bounded clique number which does not contain any subdivision of T as an induced subgraph has bounded chromatic number. Scott also… (More)
We study the problem of mapping an unknown environment represented as an unlabelled undirected graph. A robot (or automaton) starting at a single vertex of the graph G has to traverse the graph and… (More)
A set of identical, mobile agents is deployed in a weighted network. Each agent possesses a battery a power source allowing the agent to move along network edges. Agents use their batteries… (More)
We prove that every planar graph is an intersection graph of strings in the plane such that any two strings intersect at most once.
We prove that every planar graph is the intersection graph of strings in the plane, such that any two strings intersect at most once.
We discuss 11 known basic models of distributed computing: four message-passing models that differ by the (non)existence of port-numbers and a hierarchy of seven local computations models. In each of… (More)
A network with unknown participants is a communication network where the processes have very partial knowledge of the system. Nodes do not know the full set of participating nodes and some nodes do… (More)
We investigate the computability of distributed tasks in reliable anonymous networks with arbitrary knowledge. More precisely, we consider tasks computable with local termination, i.e., a node knows… (More)