<div class="csl-bib-body">
<div class="csl-entry">Chaplick, S., Di Giacomo, E., Frati, F., Ganian, R., Raftopoulou, C., & Simonov, K. (2022). Testing Upward Planarity of Partial 2-Trees. In P. Angelini & R. von Hanxleden (Eds.), <i>Graph Drawing and Network Visualization. GD 2022</i> (pp. 175–187). Springer. https://doi.org/10.1007/978-3-031-22203-0_13</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/188982
-
dc.description.abstract
We present an O(n2)-time algorithm to test whether an n-vertex directed partial 2-tree is upward planar. This result improves upon the previously best known algorithm, which runs in O(n4) time.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Lecture Notes in Computer Science
-
dc.subject
Upward planarity
en
dc.subject
parameterized complexity
-
dc.subject
Exact Algorithms
-
dc.title
Testing Upward Planarity of Partial 2-Trees
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.affiliation
Maastricht University, Netherlands (the)
-
dc.contributor.affiliation
University of Perugia, Italy
-
dc.contributor.affiliation
Roma Tre University, Italy
-
dc.contributor.affiliation
National Technical University of Athens, Greece
-
dc.contributor.editoraffiliation
John Cabot University, Italy
-
dc.contributor.editoraffiliation
Kiel University, Germany
-
dc.relation.isbn
978-3-031-22203-0
-
dc.relation.doi
10.1007/978-3-031-22203-0
-
dc.description.startpage
175
-
dc.description.endpage
187
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
Graph Drawing and Network Visualization. GD 2022
-
tuw.container.volume
13764
-
tuw.peerreviewed
true
-
tuw.relation.publisher
Springer
-
tuw.relation.publisherplace
Cham
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192 - Institut für Logic and Computation
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.1007/978-3-031-22203-0_13
-
dc.description.numberOfPages
13
-
tuw.author.orcid
0000-0001-6457-516X
-
tuw.editor.orcid
0000-0002-7602-1524
-
tuw.editor.orcid
0000-0001-5691-1215
-
tuw.event.name
International Symposium on Graph Drawing and Network Visualization (GD 2022)
en
tuw.event.startdate
13-09-2022
-
tuw.event.enddate
16-09-2022
-
tuw.event.online
Hybrid
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Tokyo
-
tuw.event.country
JP
-
tuw.event.institution
Tokyo Institute of Technology
-
tuw.event.presenter
Chaplick, Steven
-
tuw.event.track
Multi Track
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.openairetype
conference paper
-
item.fulltext
no Fulltext
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
crisitem.author.dept
Maastricht University
-
crisitem.author.dept
University of Perugia
-
crisitem.author.dept
Roma Tre University
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
National Technical University of Athens
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
