Clustered Planarity = Flat Clustered Planarity (Englisch)
- Neue Suche nach: Cortese, Pier Francesco
- Neue Suche nach: Patrignani, Maurizio
- Neue Suche nach: Biedl, Therese
- Weitere Informationen zu Biedl, Therese:
- https://orcid.org/http://orcid.org/0000-0002-9003-3783
- Neue Suche nach: Kerren, Andreas
- Weitere Informationen zu Kerren, Andreas:
- https://orcid.org/http://orcid.org/0000-0002-0519-2537
- Neue Suche nach: Cortese, Pier Francesco
- Neue Suche nach: Patrignani, Maurizio
In:
Graph Drawing and Network Visualization
: 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings
;
Kapitel: 2
;
23-38
;
2018
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Clustered Planarity = Flat Clustered Planarity
-
Weitere Titelangaben:Lect.Notes Computer
-
Beteiligte:Biedl, Therese ( Herausgeber:in ) / Kerren, Andreas ( Herausgeber:in ) / Cortese, Pier Francesco ( Autor:in ) / Patrignani, Maurizio ( Autor:in )
-
Kongress:International Symposium on Graph Drawing and Network Visualization ; 2018 ; Barcelona, Spain
-
Erschienen in:Graph Drawing and Network Visualization : 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings ; Kapitel: 2 ; 23-38Lecture Notes in Computer Science ; 11282 ; 23-38
-
Verlag:
- Neue Suche nach: Springer International Publishing
-
Erscheinungsort:Cham
-
Erscheinungsdatum:18.12.2018
-
Format / Umfang:16 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Image-Based Graph Visualization: Advances and ChallengesTelea, Alexandru et al. | 2018
- 2
-
Clustered Planarity = Flat Clustered PlanarityCortese, Pier Francesco / Patrignani, Maurizio et al. | 2018
- 3
-
Level Planarity: Transitivity vs. Even CrossingsBrückner, Guido / Rutter, Ignaz / Stumpf, Peter et al. | 2018
- 4
-
Short Plane Supports for Spatial HypergraphsCastermans, Thom / van Garderen, Mereke / Meulemans, Wouter / Nöllenburg, Martin / Yuan, Xiaoru et al. | 2018
- 5
-
Turning Cliques into Paths to Achieve PlanarityAngelini, Patrizio / Eades, Peter / Hong, Seok-Hee / Klein, Karsten / Kobourov, Stephen / Liotta, Giuseppe / Navarra, Alfredo / Tappini, Alessandra et al. | 2018
- 6
-
Universal Slope Sets for Upward Planar DrawingsBekos, Michael A. / Di Giacomo, Emilio / Didimo, Walter / Liotta, Giuseppe / Montecchiani, Fabrizio et al. | 2018
- 7
-
Upward Planar MorphsDa Lozzo, Giordano / Di Battista, Giuseppe / Frati, Fabrizio / Patrignani, Maurizio / Roselli, Vincenzo et al. | 2018
- 8
-
Visualizing the Template of a Chaotic AttractorOlszewski, Maya / Meder, Jeff / Kieffer, Emmanuel / Bleuse, Raphaël / Rosalie, Martin / Danoy, Grégoire / Bouvry, Pascal et al. | 2018
- 9
-
On RAC Drawings of Graphs with One Bend per EdgeAngelini, Patrizio / Bekos, Michael A. / Förster, Henry / Kaufmann, Michael et al. | 2018
- 10
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few BendsChaplick, Steven / Lipp, Fabian / Wolff, Alexander / Zink, Johannes et al. | 2018
- 11
-
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large AnglesKindermann, Philipp / Montecchiani, Fabrizio / Schlipf, Lena / Schulz, André et al. | 2018
- 12
-
Aesthetic Discrimination of Graph LayoutsKlammler, Moritz / Mchedlidze, Tamara / Pak, Alexey et al. | 2018
- 13
-
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed WidthJünger, Michael / Mutzel, Petra / Spisla, Christiane et al. | 2018
- 14
-
The Queue-Number of Posets of Bounded Width or HeightKnauer, Kolja / Micek, Piotr / Ueckerdt, Torsten et al. | 2018
- 15
-
Queue Layouts of Planar 3-TreesAlam, Jawaherul Md. / Bekos, Michael A. / Gronemann, Martin / Kaufmann, Michael / Pupyrev, Sergey et al. | 2018
- 16
-
Crossing Minimization in Perturbed DrawingsFulek, Radoslav / Tóth, Csaba D. et al. | 2018
- 17
-
The Number of Crossings in Multigraphs with No Empty LensKaufmann, Michael / Pach, János / Tóth, Géza / Ueckerdt, Torsten et al. | 2018
- 18
-
Crossing Numbers and Stress of Random GraphsChimani, Markus / Döring, Hanna / Reitzner, Matthias et al. | 2018
- 19
-
A Heuristic Approach Towards Drawings of Graphs with High Crossing ResolutionBekos, Michael A. / Förster, Henry / Geckeler, Christian / Holländer, Lukas / Kaufmann, Michael / Spallek, Amadäus M. / Splett, Jan et al. | 2018
- 20
-
A Greedy Heuristic for Crossing-Angle MaximizationDemel, Almut / Dürrschnabel, Dominik / Mchedlidze, Tamara / Radermacher, Marcel / Wulf, Lasse et al. | 2018
- 21
-
Recognition and Drawing of Stick GraphsDe Luca, Felice / Hossain, Md Iqbal / Kobourov, Stephen / Lubiw, Anna / Mondal, Debajyoti et al. | 2018
- 22
-
On Contact Graphs of Paths on a GridDeniz, Zakir / Galby, Esther / Munaro, Andrea / Ries, Bernard et al. | 2018
- 23
-
On the Area-Universality of TriangulationsKleist, Linda et al. | 2018
- 24
-
Monotone Drawings of k-Inner Planar GraphsOikonomou, Anargyros / Symvonis, Antonios et al. | 2018
- 25
-
On L-Shaped Point Set Embeddings of Trees: First Non-embeddable ExamplesMütze, Torsten / Scheucher, Manfred et al. | 2018
- 26
-
How to Fit a Tree in a BoxAkitaya, Hugo A. / Löffler, Maarten / Parada, Irene et al. | 2018
- 27
-
Pole Dancing: 3D Morphs for Tree DrawingsArseneva, Elena / Bose, Prosenjit / Cano, Pilar / D’Angelo, Anthony / Dujmović, Vida / Frati, Fabrizio / Langerman, Stefan / Tappini, Alessandra et al. | 2018
- 28
-
The Complexity of Drawing a Graph in a Polygonal RegionLubiw, Anna / Miltzow, Tillmann / Mondal, Debajyoti et al. | 2018
- 29
-
Inserting an Edge into a Geometric EmbeddingRadermacher, Marcel / Rutter, Ignaz et al. | 2018
- 30
-
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}-Stars or On Extending a Drawing of a Connected SubgraphMchedlidze, Tamara / Urhausen, Jérôme et al. | 2018
- 31
-
Perception of Symmetries in Drawings of GraphsDe Luca, Felice / Kobourov, Stephen / Purchase, Helen et al. | 2018
- 32
-
Network Alignment by Discrete Ollivier-Ricci FlowNi, Chien-Chun / Lin, Yu-Yao / Gao, Jie / Gu, Xianfeng et al. | 2018
- 33
-
Same Stats, Different GraphsChen, Hang / Soni, Utkarsh / Lu, Yafeng / Maciejewski, Ross / Kobourov, Stephen et al. | 2018
- 34
-
Bend-Minimum Orthogonal Drawings in Quadratic TimeDidimo, Walter / Liotta, Giuseppe / Patrignani, Maurizio et al. | 2018
- 35
-
Greedy Rectilinear DrawingsAngelini, Patrizio / Bekos, Michael A. / Didimo, Walter / Grilli, Luca / Kindermann, Philipp / Mchedlidze, Tamara / Prutkin, Roman / Symvonis, Antonios / Tappini, Alessandra et al. | 2018
- 36
-
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge ComplexityArgyriou, Evmorfia / Cornelsen, Sabine / Förster, Henry / Kaufmann, Michael / Nöllenburg, Martin / Okamoto, Yoshio / Raftopoulou, Chrysanthi / Wolff, Alexander et al. | 2018
- 37
-
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane GraphsLiotta, Giuseppe / Montecchiani, Fabrizio / Tappini, Alessandra et al. | 2018
- 38
-
Realization and Connectivity of the Graphs of Origami Flat FoldingsEppstein, David et al. | 2018
- 39
-
Arrangements of Pseudocircles: On CircularizabilityFelsner, Stefan / Scheucher, Manfred et al. | 2018
- 40
-
The Weighted Barycenter Drawing Recognition ProblemEades, Peter / Healy, Patrick / Nikolov, Nikola S. et al. | 2018
- 41
-
Algorithms and Bounds for Drawing Directed GraphsOrtali, Giacomo / Tollis, Ioannis G. et al. | 2018
- 42
-
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic ConnectivityFabila-Monroy, Ruy / Hidalgo-Toscano, Carlos / Huemer, Clemens / Lara, Dolores / Mitsche, Dieter et al. | 2018
- 43
-
Graph Drawing Contest ReportDevanny, William / Kindermann, Philipp / Löffler, Maarten / Rutter, Ignaz et al. | 2018