default search action
Daniel Neuwirth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j6]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Correction to: Outer 1-Planar Graphs. Algorithmica 83(11): 3534-3535 (2021)
2010 – 2019
- 2017
- [j5]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-planar graphs. Discret. Appl. Math. 232: 23-40 (2017) - [j4]Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. J. Graph Algorithms Appl. 21(3): 281-312 (2017) - [i5]Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
NIC-Planar Graphs. CoRR abs/1701.04375 (2017) - 2016
- [j3]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber:
Outer 1-Planar Graphs. Algorithmica 74(4): 1293-1320 (2016) - [c5]Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
On Aligned Bar 1-Visibility Graphs. WALCOM 2016: 95-106 - [i4]Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth:
Path-Additions of Graphs. CoRR abs/1605.02891 (2016) - 2015
- [j2]Patrizio Angelini
Advancements on SEFE and Partitioned Book Embedding problems. Theor. Comput. Sci. 575: 71-89 (2015) - [c4]Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann, Daniel Neuwirth:
On Bar (1, j)-Visibility Graphs - (Extended Abstract). WALCOM 2015: 246-257 - 2014
- [c3]Patrizio Angelini
On Some $\mathcal{NP}$ -complete SEFE Problems. WALCOM 2014: 200-212 - 2013
- [c2]Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
Recognizing Outer 1-Planar Graphs in Linear Time. GD 2013: 107-118 - [i3]Patrizio Angelini, Giordano Da Lozzo, Daniel Neuwirth:
On the Complexity of Some Problems Related to SEFE. CoRR abs/1311.3607 (2013) - 2012
- [j1]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. J. Graph Algorithms Appl. 16(1): 37-83 (2012) - 2011
- [i2]Radoslav Fulek, Daniel Neuwirth:
On Sets of Lines Not-Supporting Trees. CoRR abs/1104.1307 (2011) - 2010
- [c1]Patrizio Angelini
On a Tree and a Path with No Geometric Simultaneous Embedding. GD 2010: 38-49 - [i1]Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
On a Tree and a Path with no Geometric Simultaneous Embedding. CoRR abs/1001.0555 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: