Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved the conjecture in the affirmative, using algebraicâ€¦ (More)

We show that for a graph G on n vertices its treewidth and minimum fill-in can be computed roughly in 1.9601 time. Our result is based on a combinatorial proof that the number of minimal separatorsâ€¦ (More)

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â€¦ (More)

We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number ofâ€¦ (More)

Given an arbitrary graph G = (V, E) and an interval graph H = (V, F ) with E âŠ† F we say that H is an interval completion of G. The graph H is called a minimal interval completion of G if, for anyâ€¦ (More)

Search games are a powerfull tool for studying various connectivity parameters of graphs. In the classical search game, we consider an undirected graph G = (V, E) whose edges are initiallyâ€¦ (More)