No. Title Author Year
1 The Maximum Exposure Problem Kumar, Neeraj et al. 2019
2 Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames Bandyapadhyay, Sayan et al. 2018
3 Computing Shortest Paths in the Plane with Removable Obstacles Agarwal, Pankaj K. et al. 2018
4 Improved Approximation Bounds for the Minimum Constraint Removal Problem Bandyapadhyay, Sayan et al. 2018
5 Efficient Algorithms for k-Regret Minimizing Sets Agarwal, Pankaj K. et al. 2017
6 K-Dominance in Multidimensional Data: Theory and Applications Schibler, Thomas et al. 2017
7 Shortest Paths in the Plane with Obstacle Violations Hershberger, John et al. 2017
8 Hyperplane Separability and Convexity of Probabilistic Point Sets Fink, Martin et al. 2016
9 Most Likely Voronoi Diagrams in Higher Dimensions Kumar, Nirman et al. 2016
10 Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries Hoffmann, Frank et al. 2015
11 Conflict-free Chromatic Art Gallery Coverage Bärtschi, Andreas et al. 2012
12 07151 Abstracts Collection -- Geometry in Sensor Networks Suri, Subhash et al. 2007
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI