Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062)

Authors Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.14.2.71.pdf
  • Filesize: 2.88 MB
  • 24 pages

Document Identifiers

Author Details

Vida Dujmović
  • University of Ottawa, CA
Seok-Hee Hong
  • The University of Sydney, AU
Michael Kaufmann
  • Universität Tübingen, DE
János Pach
  • Alfréd Rényi Institute - Budapest, HU & EPFL - Lausanne, CH
Henry Förster
  • Universität Tübingen, DE
and all authors of the abstracts in this report

Cite AsGet BibTex

Vida Dujmović, Seok-Hee Hong, Michael Kaufmann, János Pach, and Henry Förster. Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). In Dagstuhl Reports, Volume 14, Issue 2, pp. 71-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/DagRep.14.2.71

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 24062 "Beyond-Planar Graphs: Models, Structures and Geometric Representations". The seminar investigated beyond-planar graphs, in particular, their combinatorial and topological structures, computational complexity and algorithmics for recognition, geometric representations, and their applications to real-world network visualization. Compared to the previous two editions of the seminar, we focus more on aspects of combinatorics and geometry. The program consists of four invited talks on beyond planar graphs, open problem session, problem solving sessions and progress report sessions. Specific open problems include questions regarding the combinatorial structures and topology (e.g., k^+-real face graphs, beyond upward planar graphs, sparse universal geometric graphs, local-crossing-critical graphs), the geometric representations (e.g., constrained outer string graphs, rerouting curves on surface), and applications. The details of the invited talks and progress reports from each working groups are included in this report.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Combinatorial geometry
  • Graph algorithm
  • Graph drawing
  • Graph theory
  • Network visualization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail