  This document is an informal bibliography of the papers dealing with
distributed approximation algorithms. A classic setting for such algorithms is
bounded degree graphs, but there is a whole set of techniques that have been
developed for other classes. These later classes are the focus of the current
work. These classes have a geometric nature (planar, bounded genus and
unit-disk graphs) and/or have bounded parameters (arboricity, expansion,
growth, independence) or forbidden structures (forbidden minors).
