search result

Cover von Shortest Paths in the Plane with Obstacle Violations

Shortest Paths in the Plane with Obstacle Violations

Year: 2017
Media group: LIPIcs
Cover von Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries

Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries

Year: 2015
Media group: LIPIcs
Cover von Geometry in sensor networks
Search for this author
Year: 2007
Publisher: Wadern-Dagstuhl, IBFI
Series: Dagstuhl Seminar Proceedings; 07151
Media group: DAGSTUHL-SEMINAR-PRO
Cover von Near-Optimal Dynamic Data Structures for Maximum Depth and Klee’s Measure of Boxes

Near-Optimal Dynamic Data Structures for Maximum Depth and Klee’s Measure of Boxes

Year: 2026
Media group: LIPIcs
Cover von Dynamic Maximum Depth of Geometric Objects

Dynamic Maximum Depth of Geometric Objects

Year: 2025
Media group: LIPIcs
Cover von Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles

Year: 2022
Media group: LIPIcs
Cover von An ETH-Tight Algorithm for Multi-Team Formation

An ETH-Tight Algorithm for Multi-Team Formation

Year: 2021
Media group: LIPIcs
Cover von Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames

Year: 2018
Media group: LIPIcs
Cover von Improved Approximation Bounds for the Minimum Constraint Removal Problem

Improved Approximation Bounds for the Minimum Constraint Removal Problem

Year: 2018
Media group: LIPIcs
Cover von Computing Shortest Paths in the Plane with Removable Obstacles

Computing Shortest Paths in the Plane with Removable Obstacles

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0