No. |
Title |
Author |
Year |
---|

1 |
Fault Tolerance in Euclidean Committee Selection |
Sonar, Chinmay et al. |
2023 |

2 |
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles |
Kumar, Neeraj et al. |
2022 |

3 |
An ETH-Tight Algorithm for Multi-Team Formation |
Lokshtanov, Daniel et al. |
2021 |

4 |
Anonymity-Preserving Space Partitions |
Hébert-Johnson, Úrsula et al. |
2021 |

5 |
Efficient Algorithms for Least Square Piecewise Polynomial Regression |
Lokshtanov, Daniel et al. |
2021 |

6 |
Dynamic Geometric Set Cover and Hitting Set |
Agarwal, Pankaj K. et al. |
2020 |

7 |
The Maximum Exposure Problem |
Kumar, Neeraj et al. |
2019 |

8 |
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames |
Bandyapadhyay, Sayan et al. |
2018 |

9 |
Computing Shortest Paths in the Plane with Removable Obstacles |
Agarwal, Pankaj K. et al. |
2018 |

10 |
Improved Approximation Bounds for the Minimum Constraint Removal Problem |
Bandyapadhyay, Sayan et al. |
2018 |

11 |
Efficient Algorithms for k-Regret Minimizing Sets |
Agarwal, Pankaj K. et al. |
2017 |

12 |
K-Dominance in Multidimensional Data: Theory and Applications |
Schibler, Thomas et al. |
2017 |

13 |
Shortest Paths in the Plane with Obstacle Violations |
Hershberger, John et al. |
2017 |

14 |
Hyperplane Separability and Convexity of Probabilistic Point Sets |
Fink, Martin et al. |
2016 |

15 |
Most Likely Voronoi Diagrams in Higher Dimensions |
Kumar, Nirman et al. |
2016 |

16 |
Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries |
Hoffmann, Frank et al. |
2015 |

17 |
Conflict-free Chromatic Art Gallery Coverage |
Bärtschi, Andreas et al. |
2012 |

18 |
07151 Abstracts Collection -- Geometry in Sensor Networks |
Suri, Subhash et al. |
2007 |