rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Graph Drawing and Network Visualization
    sub title: 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings
  name:
    name part: Archambault, Daniel.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Tóth, Csaba D.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2019
    edition: 1st ed. 2019.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXIII, 626 p. 460 illus., 244 illus. in color. online resource.
  abstract: This book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019. The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts.
  table of contents: Cartograms and Intersection Graphs -- Stick Graphs with Length Constraints -- Representing Graphs and Hypergraphs by Touching Polygons in 3D -- Optimal Morphs of Planar Orthogonal Drawings II -- Computing Stable Demers Cartograms -- Geometric Graph Theory -- Bundled Crossings Revisited -- Crossing Numbers of Beyond-Planar Graphs -- On the 2-Colored Crossing Number -- Minimal Representations of Order Types by Geometric Graphs -- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators -- Clustering -- A Quality Metric for Visualization of Clusters in Graphs -- Multi-level Graph Drawing using Infomap Clustering -- On Strict (Outer-)Conﬂuent Graphs -- Quality Metrics -- On the Edge-Length Ratio of Planar Graphs -- Node Overlap Removal Algorithms: A Comparative Study -- Graphs with large total angular resolution -- Arrangements -- Computing Height-Optimal Tangles Faster -- On Arrangements of Orthogonal Circles -- Extending Simple Drawings -- Coloring Hasse diagrams and disjointness graphs of curves -- A Low Number of Crossings -- Eﬃcient Generation of Diﬀerent Topological Representations of Graphs Beyond-Planarity -- The QuaSEFE Problem -- ChordLink: A New Hybrid Visualization Model -- Stress-Plus-X (SPX) Graph Layout -- Best Paper in Track 1 -- Exact Crossing Number Parameterized by Vertex Cover -- Morphing and Planarity -- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs -- Graph Drawing with Morphing Partial Edges -- A Note on Universal Point Sets for Planar Graphs -- Parameterized Complexity -- Parameterized Algorithms for Book Embedding Problems -- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs -- Collinearities -- 4-Connected Triangulations on Few Lines -- Line and Plane Cover Numbers Revisited -- Drawing planar graphs with few segments on a polynomial grid -- Variants of the Segment Number of a Graph -- Topological Graph Theory -- Local and Union Page N…
  note: edited by Daniel Archambault, Csaba D. Tóth.
  subject:
    topic: Algorithms
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Optical data processing
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Data Structures and Information Theory
  subject:
    topic: Computer Imaging, Vision, Pattern Recognition and Graphics
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Theoretical Computer Science and General Issues ; 11904
  identifier: 9783030358020
  identifier: https://doi.org/10.1007/978-3-030-35802-0
  record info:
    record creation date: 191127
    record change date: 20191127233337.0
    record identifier: 978-3-030-35802-0