Gives algorithms (mostly linear) for many problems studied earlier e.g. for planar graphs. These algorithms generalize for bounded expansion classes.