Chp 1 - Planarity
Double patterning (4/20 update)
Fast and Lossless Graph Division Method for Layout Decomposition Using SPQR-Tree
Edge-Selection Heuristics for Computing Tutte Polynomials David J. Pearce Victoria University of Wellington Gary Haggard Bucknell, USA Gordon Royle University.
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes Bart M. P. Jansen September 8th, ESA 2014, Wrocław.
