Bandwidth, treewidth, separators, expansion, and universality. - Julia Böttcher; Klaas Paul Pruessmann; Anusch Taraz; Andreas Würfl (Electron. Notes Discret. Math., 2008)

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. - Julia Böttcher; Klaas Paul Pruessmann; Anusch Taraz; Andreas Würfl (Eur. J. Comb., 2010)

Induced C5-free graphs of fixed density: counting and homogeneous sets. - Julia Böttcher; Anusch Taraz; Andreas Würfl (Electron. Notes Discret. Math., 2011)

Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. - Julia Böttcher; Anusch Taraz; Andreas Würfl (Comb. Probab. Comput., 2012)

Maximum Planar Subgraphs in Dense Graphs. - Peter Allen 001; Jozef Skokan; Andreas Würfl (Electron. J. Comb., 2013)

An Extension of the Blow-up Lemma to Arrangeable Graphs. - Julia Böttcher; Yoshiharu Kohayakawa; Anusch Taraz; Andreas Würfl (SIAM J. Discret. Math., 2015)

Spanning embeddings of arrangeable graphs with sublinear bandwidth. - Julia Böttcher; Anusch Taraz; Andreas Würfl (Random Struct. Algorithms, 2016)