Daniel Neuwirth

According to our database, Daniel Neuwirth authored at least 12 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Correction to: Outer 1-Planar Graphs.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Algorithmica, 2021

2017

On Aligned Bar 1-Visibility Graphs.

Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth

J. Graph Algorithms Appl., 2017

NIC-planar graphs.

Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Discret. Appl. Math., 2017

2016

Path-Additions of Graphs.

Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth

CoRR, 2016

Outer 1-Planar Graphs.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Algorithmica, 2016

2015

Advancements on SEFE and Partitioned Book Embedding problems.

Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth

Theor. Comput. Sci., 2015

On Bar (1, j)-Visibility Graphs - (Extended Abstract).

Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

On Some $\mathcal{NP}$ -complete SEFE Problems.

Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013

On the Complexity of Some Problems Related to SEFE.

Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth

CoRR, 2013

Recognizing Outer 1-Planar Graphs in Linear Time.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

On a Tree and a Path with no Geometric Simultaneous Embedding.

Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth

J. Graph Algorithms Appl., 2012

2011

On Sets of Lines Not-Supporting Trees

Radoslav Fulek, Daniel Neuwirth

CoRR, 2011