search result

Cover von On the Hardness and Inapproximability of Recognizing Wheeler Graphs

On the Hardness and Inapproximability of Recognizing Wheeler Graphs

Year: 2019
Media group: LIPIcs
Cover von Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs

Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs

Author: Weyand, Christopher
Year: 2019
Media group: LIPIcs
Cover von Validating Paired-End Read Alignments in Sequence Graphs

Validating Paired-End Read Alignments in Sequence Graphs

Year: 2019
Media group: LIPIcs
Cover von Fault Tolerant and Fully Dynamic DFS in Undirected Graphs

Fault Tolerant and Fully Dynamic DFS in Undirected Graphs

Simple Yet Efficient
Year: 2019
Media group: LIPIcs
Cover von Reducing the Domination Number of Graphs via Edge Contractions

Reducing the Domination Number of Graphs via Edge Contractions

Year: 2019
Media group: LIPIcs
Cover von Approximating the Orthogonality Dimension of Graphs and Hypergraphs

Approximating the Orthogonality Dimension of Graphs and Hypergraphs

Year: 2019
Media group: LIPIcs
Cover von Distance Labeling Schemes for Cube-Free Median Graphs

Distance Labeling Schemes for Cube-Free Median Graphs

Year: 2019
Media group: LIPIcs
Cover von Colouring H-Free Graphs of Bounded Diameter

Colouring H-Free Graphs of Bounded Diameter

Year: 2019
Media group: LIPIcs
Cover von Constrained Representations of Map Graphs and Half-Squares

Constrained Representations of Map Graphs and Half-Squares

Year: 2019
Media group: LIPIcs
Cover von On the Complexity of String Matching for Graphs

On the Complexity of String Matching for Graphs

Year: 2019
Media group: LIPIcs
OPEN V 11.1.0.0