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


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