No. Title Author Year
1 Fault Tolerance in Euclidean Committee Selection Sonar, Chinmay et al. 2023
2 Minimum-Membership Geometric Set Cover, Revisited Bandyapadhyay, Sayan et al. 2023
3 Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles Kumar, Neeraj et al. 2022
4 True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs Bandyapadhyay, Sayan et al. 2022
5 An ETH-Tight Algorithm for Multi-Team Formation Lokshtanov, Daniel et al. 2021
6 Efficient Algorithms for Least Square Piecewise Polynomial Regression Lokshtanov, Daniel et al. 2021
7 Dynamic Geometric Set Cover and Hitting Set Agarwal, Pankaj K. et al. 2020
8 Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs Wang, Haitao et al. 2019
9 Searching for the Closest-Pair in a Query Translate Xue, Jie et al. 2019
10 New Bounds for Range Closest-Pair Problems Xue, Jie et al. 2018
11 On the Separability of Stochastic Geometric Objects, with Applications Xue, Jie et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 11

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