search result

Cover von Geometric Embeddability of Complexes Is Is ∃ℝ-Complete

Geometric Embeddability of Complexes Is Is ∃ℝ-Complete

Year: 2023
Media group: LIPIcs
Cover von The Complexity of the Hausdorff Distance

The Complexity of the Hausdorff Distance

Year: 2022
Media group: LIPIcs
Cover von A Practical Algorithm with Performance Guarantees for the Art Gallery Problem

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem

Year: 2021
Media group: LIPIcs
Cover von Maximum Clique in Disk-Like Intersection Graphs

Maximum Clique in Disk-Like Intersection Graphs

Year: 2020
Media group: LIPIcs
Cover von An Approximation Algorithm for the Art Gallery Problem

An Approximation Algorithm for the Art Gallery Problem

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

Irrational Guards are Sometimes Needed

Year: 2017
Media group: LIPIcs
Cover von Parameterized Hardness of Art Gallery Problems

Parameterized Hardness of Art Gallery Problems

Year: 2016
Media group: LIPIcs
Cover von Peeling and Nibbling the Cactus

Peeling and Nibbling the Cactus

Subexponential-Time Algorithms for Counting Triangulations and Related Problems
Year: 2016
Media group: LIPIcs
Cover von Precision in Geometric Algorithms; 9
pp. 21-37
Search for this author
Year: 2026
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 9
Media group: DAGSTUHL REPORT
Cover von Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain

Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0