Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almafu_BV047690320
    Format: 1 Online-Ressource : , Illustrationen, Diagramme.
    ISBN: 978-3-030-92931-2
    Series Statement: Lecture notes in computer science 12868
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92930-5
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92932-9
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphenzeichnen ; Netzwerk ; Benutzeroberfläche ; Mensch-Maschine-Kommunikation ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9949227928802882
    Format: XXII, 464 p. 221 illus., 137 illus. in color. , online resource.
    Edition: 1st ed. 2021.
    ISBN: 9783030929312
    Series Statement: Information Systems and Applications, incl. Internet/Web, and HCI ; 12868
    Content: This book constitutes the proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2021, which was held in Tübingen, Germany, during September 14-17, 2021. The 23 full papers and 5 short papers presented in these proceedings were carefully reviewed and selected from 74 submissions. The abstracts of 13 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: Best Paper (Track 1: Combinatorial and Algorithmic Aspects); Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects); Crossing Minimization and Beyond-Planarity; Morphing and Graph Abstraction; Geometric Constraints; Topological and Upward Drawings; Linear Layouts; Contact and Visibility Representations; Geometric Aspects in Graph Drawing; AI applications; and Graph Drawing Contest Report. .
    Note: Best Paper (Track 1: Combinatorial and Algorithmic Aspects) -- Edge-Minimum Saturated $k$-Planar Drawings -- Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects) -- A User Study on Hybrid Graph Visualizations- Crossing Minimization and Beyond-Planarity Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics -- Simplifying Non-Simple Fan-Planar Drawings -- RAC-drawability is ER-complete -- Recognizing and Embedding Simple Optimal 2-Planar Graphs -- A short proof of the non-biplanarity of K 9 -- Morphing and Graph Abstraction -- From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs -- Planar and Toroidal Morphs Made Easier -- Visualizing JIT Compiler Graphs -- Geometric Constraints -- Upward Planar Drawings with Three and More Slopes -- Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths -- One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons -- Topological and Upward Drawings -- Quasi-upward Planar Drawings with Minimum Curve Complexity -- Non-homotopic Loops with a Bounded Number of Pairwise Intersections -- On the number of edges of separated multigraphs -- Linear Layouts -- On the Queue-Number of Partial Orders -- On the Upward Book Thickness Problem: Combinatorial and Complexity Results -- Linear Layouts of Complete Graphs -- On the Queue Number of Planar Graphs -- Contact and Visibility Representations -- Optimal-area visibility representations of outer-1-plane graphs -- Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs -- Layered Area-Proportional Rectangle Contact Representation -- Geometric Aspects in Graph Drawing -- Arrangements of orthogonal circles with many intersections -- Limitations on Realistic Hyperbolic Graph Drawing -- Embedding Ray Intersection Graphs and Global Curve Simplification -- AI Applications -- Drawing Networks with Deep Neural Network, (DNN)² -- Implementation of Sprouts: a graph drawing game -- Graph Drawing Contest Report. .
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783030929305
    Additional Edition: Printed edition: ISBN 9783030929329
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_1783637684
    Format: 1 Online-Ressource(XXII, 464 p. 221 illus., 137 illus. in color.)
    Edition: 1st ed. 2021.
    ISBN: 9783030929312
    Series Statement: Information Systems and Applications, incl. Internet/Web, and HCI 12868
    Content: Best Paper (Track 1: Combinatorial and Algorithmic Aspects) -- Edge-Minimum Saturated $k$-Planar Drawings -- Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects) -- A User Study on Hybrid Graph Visualizations- Crossing Minimization and Beyond-Planarity Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics -- Simplifying Non-Simple Fan-Planar Drawings -- RAC-drawability is ER-complete -- Recognizing and Embedding Simple Optimal 2-Planar Graphs -- A short proof of the non-biplanarity of K 9 -- Morphing and Graph Abstraction -- From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs -- Planar and Toroidal Morphs Made Easier -- Visualizing JIT Compiler Graphs -- Geometric Constraints -- Upward Planar Drawings with Three and More Slopes -- Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths -- One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons -- Topological and Upward Drawings -- Quasi-upward Planar Drawings with Minimum Curve Complexity -- Non-homotopic Loops with a Bounded Number of Pairwise Intersections -- On the number of edges of separated multigraphs -- Linear Layouts -- On the Queue-Number of Partial Orders -- On the Upward Book Thickness Problem: Combinatorial and Complexity Results -- Linear Layouts of Complete Graphs -- On the Queue Number of Planar Graphs -- Contact and Visibility Representations -- Optimal-area visibility representations of outer-1-plane graphs -- Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs -- Layered Area-Proportional Rectangle Contact Representation -- Geometric Aspects in Graph Drawing -- Arrangements of orthogonal circles with many intersections -- Limitations on Realistic Hyperbolic Graph Drawing -- Embedding Ray Intersection Graphs and Global Curve Simplification -- AI Applications -- Drawing Networks with Deep Neural Network, (DNN)² -- Implementation of Sprouts: a graph drawing game -- Graph Drawing Contest Report. .
    Content: This book constitutes the proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2021, which was held in Tübingen, Germany, during September 14-17, 2021. The 23 full papers and 5 short papers presented in these proceedings were carefully reviewed and selected from 74 submissions. The abstracts of 13 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: Best Paper (Track 1: Combinatorial and Algorithmic Aspects); Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects); Crossing Minimization and Beyond-Planarity; Morphing and Graph Abstraction; Geometric Constraints; Topological and Upward Drawings; Linear Layouts; Contact and Visibility Representations; Geometric Aspects in Graph Drawing; AI applications; and Graph Drawing Contest Report. .
    Additional Edition: ISBN 9783030929305
    Additional Edition: ISBN 9783030929329
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030929305
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030929329
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV047830635
    Format: xxii, 464 Seiten , Illustrationen, Diagramme
    ISBN: 9783030929305
    Series Statement: Lecture notes in computer science 12868
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-3-030-92931-2
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphenzeichnen ; Netzwerk ; Benutzeroberfläche ; Mensch-Maschine-Kommunikation ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    edoccha_BV047690320
    Format: 1 Online-Ressource (XXII, 464 p. 221 illus., 137 illus. in color).
    Edition: 1st ed. 2021
    ISBN: 978-3-030-92931-2
    Series Statement: Information Systems and Applications, incl. Internet/Web, and HCI 12868
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92930-5
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92932-9
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphenzeichnen ; Netzwerk ; Benutzeroberfläche ; Mensch-Maschine-Kommunikation ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    edocfu_BV047690320
    Format: 1 Online-Ressource (XXII, 464 p. 221 illus., 137 illus. in color).
    Edition: 1st ed. 2021
    ISBN: 978-3-030-92931-2
    Series Statement: Information Systems and Applications, incl. Internet/Web, and HCI 12868
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92930-5
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-030-92932-9
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphenzeichnen ; Netzwerk ; Benutzeroberfläche ; Mensch-Maschine-Kommunikation ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783030029319?
Did you mean 9783030129392?
Did you mean 9783030169312?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages