search result

Cover von An Optimal Algorithm for the Separating Common Tangents of Two Polygons

An Optimal Algorithm for the Separating Common Tangents of Two Polygons

Year: 2015
Media group: LIPIcs
Cover von Finding the Maximum Subset with Bounded Convex Curvature

Finding the Maximum Subset with Bounded Convex Curvature

Year: 2016
Media group: LIPIcs
Cover von Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks

Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks

Year: 2023
Media group: LIPIcs
Cover von Online Packing to Minimize Area or Perimeter

Online Packing to Minimize Area or Perimeter

Year: 2021
Media group: LIPIcs
Cover von Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

Year: 2017
Media group: LIPIcs
Cover von Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace

Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace

Year: 2016
Media group: LIPIcs
Cover von Constructing Concise Convex Covers via Clique Covers (CG Challenge)

Constructing Concise Convex Covers via Clique Covers (CG Challenge)

Year: 2023
Media group: LIPIcs
Cover von Geometric Embeddability of Complexes Is Is ∃ℝ-Complete

Geometric Embeddability of Complexes Is Is ∃ℝ-Complete

Year: 2023
Media group: LIPIcs
Cover von Irrational Guards are Sometimes Needed

Irrational Guards are Sometimes Needed

Year: 2017
Media group: LIPIcs
Cover von Graph Reconstruction with a Betweenness Oracle

Graph Reconstruction with a Betweenness Oracle

Year: 2016
Media group: LIPIcs
OPEN V 11.1.0.0