search result

Cover von Approximating the Crossing Number of Dense Graphs (Poster Abstract)

Approximating the Crossing Number of Dense Graphs (Poster Abstract)

Year: 2024
Media group: LIPIcs
Cover von Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor

Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor

Year: 2024
Media group: LIPIcs
Cover von On the Complexity of Recognizing k^+-Real Face Graphs

On the Complexity of Recognizing k^+-Real Face Graphs

Author: Montecchiani, Fabrizio
Year: 2024
Media group: LIPIcs
Cover von Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs

Year: 2024
Media group: LIPIcs
Cover von On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs

On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs

Year: 2024
Media group: LIPIcs
Cover von Bounding the Treewidth of Outer k-Planar Graphs via Triangulations

Bounding the Treewidth of Outer k-Planar Graphs via Triangulations

Year: 2024
Media group: LIPIcs
Cover von Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs

Year: 2024
Media group: LIPIcs
Cover von Note on Min- k-Planar Drawings of Graphs

Note on Min- k-Planar Drawings of Graphs

Year: 2024
Media group: LIPIcs
Cover von Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model

Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model

Year: 2024
Media group: LIPIcs
Cover von Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0