default search action
Jonathan Klawitter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three and More Slopes. J. Graph Algorithms Appl. 27(2): 49-70 (2023) - [c12]Jonathan Klawitter
, Johannes Zink
Tree Drawings with Columns. GD (1) 2023: 195-210 - [c11]Jonathan Klawitter, Felix Klesen
Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints. GIScience 2023: 5:1-5:16 - [c10]Jonathan Klawitter
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. SOFSEM 2023: 96-110 - [i17]Jonathan Klawitter, Felix Klesen, Joris Y. Scholl, Thomas C. van Dijk, Alexander Zaft:
Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints. CoRR abs/2306.17348 (2023) - [i16]Jonathan Klawitter, Johannes Zink:
Tree Drawings with Columns. CoRR abs/2308.10811 (2023) - 2022
- [j6]Jonathan Klawitter, Tamara Mchedlidze:
Upward planar drawings with two slopes. J. Graph Algorithms Appl. 26(1): 171-198 (2022) - [j5]Steven Chaplick
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. Theor. Comput. Sci. 919: 66-74 (2022) - [c9]Steven Chaplick
Morphing Rectangular Duals. GD 2022: 389-403 - [c8]Oksana Firman
Outside-Obstacle Representations with All Vertices on the Outer Face. GD 2022: 432-440 - [c7]Ina Goeßmann, Jonathan Klawitter
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. WG 2022: 271-286 - [i15]Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. CoRR abs/2202.11604 (2022) - [i14]Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. CoRR abs/2202.13015 (2022) - [i13]Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff:
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. CoRR abs/2210.06744 (2022) - 2021
- [c6]Jonathan Klawitter
Algorithms for Floor Planning with Proximity Requirements. CAAD Futures 2021: 151-171 - [c5]Steven Chaplick
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC 2021: 340-353 - [c4]Jonathan Klawitter
Upward Planar Drawings with Three and More Slopes. GD 2021: 149-165 - [i12]Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR abs/2102.02013 (2021) - [i11]Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three Slopes. CoRR abs/2103.06801 (2021) - [i10]Jonathan Klawitter, Tamara Mchedlidze:
Upward planar drawings with two slopes. CoRR abs/2106.02839 (2021) - [i9]Jonathan Klawitter, Felix Klesen
Algorithms for Floor Planning with Proximity Requirements. CoRR abs/2107.05036 (2021) - [i8]Steven Chaplick
Morphing Rectangular Duals. CoRR abs/2112.03040 (2021) - 2020
- [j4]Jonathan Klawitter
The agreement distance of unrooted phylogenetic networks. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [c3]Jonathan Klawitter
Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings. GD 2020: 173-180 - [i7]Jonathan Klawitter, Peter Stumpf:
Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings. CoRR abs/2008.08960 (2020)
2010 – 2019
- 2019
- [j3]Jonathan Klawitter
On the Subnet Prune and Regraft Distance. Electron. J. Comb. 26(2): 2 (2019) - [j2]Jonathan Klawitter
The agreement distance of rooted phylogenetic networks. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [i6]Remie Janssen, Jonathan Klawitter:
Rearrangement operations on unrooted phylogenetic networks. CoRR abs/1906.04468 (2019) - [i5]Jonathan Klawitter:
The agreement distance of unrooted phylogenetic networks. CoRR abs/1908.08183 (2019) - 2018
- [j1]Jonathan Klawitter
The SNPR neighbourhood of tree-child networks. J. Graph Algorithms Appl. 22(2): 329-355 (2018) - [i4]Jonathan Klawitter, Simone Linz:
On the Subnet Prune and Regraft Distance. CoRR abs/1805.07839 (2018) - [i3]Jonathan Klawitter:
The agreement distance of rooted phylogenetic networks. CoRR abs/1806.05800 (2018) - 2017
- [c2]Jonathan Klawitter
Experimental Evaluation of Book Drawing Algorithms. GD 2017: 224-238 - [i2]Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg:
Experimental Evaluation of Book Drawing Algorithms. CoRR abs/1708.09221 (2017) - 2015
- [c1]Jonathan Klawitter
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. GD 2015: 231-244 - [i1]Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. CoRR abs/1509.00835 (2015)
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-08-05 20:25 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: