On Sets of Lines Not-Supporting Trees - Radoslav Fulek; Daniel Neuwirth (CoRR, 2011)

On a Tree and a Path with no Geometric Simultaneous Embedding. - Patrizio Angelini; Markus Geyer; Michael Kaufmann 001; Daniel Neuwirth (J. Graph Algorithms Appl., 2012)

Recognizing Outer 1-Planar Graphs in Linear Time. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (GD, 2013)

On the Complexity of Some Problems Related to SEFE. - Patrizio Angelini; Giordano Da Lozzo; Daniel Neuwirth (CoRR, 2013)

On Some $ mathcal{NP}$ -complete SEFE Problems. - Patrizio Angelini; Giordano Da Lozzo; Daniel Neuwirth (WALCOM, 2014)

On Bar (1, j)-Visibility Graphs - (Extended Abstract). - Franz J. Brandenburg; Niklas Heinsohn; Michael Kaufmann 001; Daniel Neuwirth (WALCOM, 2015)

Advancements on SEFE and Partitioned Book Embedding problems. - Patrizio Angelini; Giordano Da Lozzo; Daniel Neuwirth (Theor. Comput. Sci., 2015)

Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2016)

Path-Additions of Graphs. - Franz J. Brandenburg; Alexander Esch; Daniel Neuwirth (CoRR, 2016)

NIC-planar graphs. - Christian Bachmaier; Franz J. Brandenburg; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Discret. Appl. Math., 2017)

On Aligned Bar 1-Visibility Graphs. - Franz J. Brandenburg; Alexander Esch; Daniel Neuwirth (J. Graph Algorithms Appl., 2017)

Correction to: Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2021)