Dateien: | ||
URI: |
http://hdl.handle.net/10900/109680
http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-1096809 http://dx.doi.org/10.15496/publikation-51056 http://nbn-resolving.org/urn:nbn:de:bsz:21-dspace-1096809 |
Dokumentart: | PhDThesis |
Date: | 2020-11-18 |
Source: | Inhalte der Thesis basieren auf Resultaten aus den folgenden Veröffentlichungen: 1) P. Angelini, G. Da Lozzo, H. Förster, T. Schneck. 2-layer k-planar graphs: Density, crossing lemma, relationships, and pathwidth. Graph Drawing and Network Visualization GD 2020. Springer, Cham (to appear). 2) P. Angelini, M. A. Bekos, M. Kaufmann, T. Schneck. Efficient generation of different topological representations of graphs beyond-planarity. Journal of Graph Algorithms and Applications, 2020 (DOI: 10.7155/jgaa.00531). 3) P. Kindermann, T. Mchedlidze, T. Schneck, A. Symvonis. Drawing planar graphs with few segments on a polynomial grid. Graph Drawing and Network Visualization GD 2019, Seiten 416–429. Springer, Cham. 4) P. Angelini, M. A. Bekos, M. Kaufmann, T. Schneck. Low-degree graphs beyond planarity. Graph Drawing and Network Visualization GD 2018, Seiten 630–632. Springer, Cham. |
Language: | English |
Faculty: | 7 Mathematisch-Naturwissenschaftliche Fakultät |
Department: | Informatik |
Advisor: | Kaufmann, Michael (Prof. Dr.) |
Day of Oral Examination: | 2020-10-19 |
DDC Classifikation: | 004 - Data processing and computer science |
Keywords: | Graphenzeichnen , Algorithmus |
Other Keywords: |
![]() Edge Density Crossing Lemma 2-Layer Graphs Beyond-Planarity Complete Graphs Complete Bipartite Graphs Enumeration of Graphs Bounded Vertex Degree |
License: | http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en |
Order a printed copy: |
![]() |
Show full item record |