On choosability with separation of planar graphs with lists of different sizes - Hal Kierstead; Bernard Lidický (2013)