This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more eeciently. Also, several results on graph minors are reviewed.

The extragalactic applications of NIR surveys are summarized with a focus on the ability to map the interstellar extinction of our Galaxy. Very preliminary extraction of galaxies on a set of 180 consecutive images is presented, and the results illustrate some of the pitfalls in attempting an homogeneous extraction of galaxies from these wide-angle and shallow surveys.

A graph G is loosely-c-connected, or l-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of l-c-connected infinite graphs that form an unavoidable set among the topological minors of l-c-connected infinite gr...