The Euclidean degree-4 minimum spanning tree problem is NP-hard. - Andrea Francke; Michael Hoffmann 001 (SCG, 2009)

A Doubly Exponentially Crumbled Cake. - Tobias Christ; Andrea Francke; Heidi Gebauer; Jirí Matousek 001; Takeaki Uno (Electron. Notes Discret. Math., 2011)

A Census of Plane Graphs with Polyline Edges. - Andrea Francke; Csaba D. Tóth (SIAM J. Discret. Math., 2017)