Finding Triangles for Maximum Planar Subgraphs. - Parinya Chalermsook; Andreas Schmid 003 (WALCOM, 2017)

Computing Tutte Paths. - Andreas Schmid 003; Jens M. Schmidt (ICALP, 2018)

Computing 2-Walks in Polynomial Time. - Andreas Schmid 003; Jens M. Schmidt (ACM Trans. Algorithms, 2018)

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. - Parinya Chalermsook; Andreas Schmid 003; Sumedha Uniyal (STACS, 2019)

Plane and simple. - Andreas Schmid 003 (2019)