| Piercing pairwise intersecting geodesic disks | 0 | 0.34 | 2021 |
| Minimizing Total Interference In Asymmetric Sensor Networks | 0 | 0.34 | 2021 |
| On The Minimum Consistent Subset Problem | 0 | 0.34 | 2021 |
| Sensor Network Topology Design And Analysis For Efficient Data Gathering By A Mobile Mule | 0 | 0.34 | 2020 |
| Parameterized Study of Steiner Tree on Unit Disk Graphs. | 0 | 0.34 | 2020 |
| Minimizing Total Interference in Asymmetric Sensor Networks | 0 | 0.34 | 2020 |
| Planar Bichromatic Bottleneck Spanning Trees | 0 | 0.34 | 2020 |
| Minimizing the sum of distances to a server in a constraint network. | 0 | 0.34 | 2019 |
| On the Minimum Consistent Subset Problem. | 0 | 0.34 | 2019 |
| Bottleneck Bichromatic Full Steiner Trees. | 0 | 0.34 | 2019 |
| The Most Likely Object to be Seen Through a Window | 0 | 0.34 | 2019 |
| Bottleneck detour tree of points on a path. | 0 | 0.34 | 2019 |
| Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. | 0 | 0.34 | 2019 |
| Stabbing Pairwise Intersecting Disks by Four Points. | 1 | 0.43 | 2018 |
| Boundary Labeling for Rectangular Diagrams. | 0 | 0.34 | 2018 |
| Geodesic Obstacle Representation of Graphs. | 0 | 0.34 | 2018 |
| Approximability of Covering Cells with Line Segments. | 0 | 0.34 | 2018 |
| Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. | 0 | 0.34 | 2018 |
| Unique Coverage with Rectangular Regions. | 0 | 0.34 | 2018 |
| Selecting and covering colored points. | 0 | 0.34 | 2018 |
| On the Minimum Consistent Subset Problem. | 0 | 0.34 | 2018 |
| Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs | 0 | 0.34 | 2018 |
| Bounded-Hop Communication Networks. | 0 | 0.34 | 2018 |
| Faster Algorithms For Some Optimization Problems On Collinear Points | 1 | 0.37 | 2018 |
| Near-Optimal O(k)-Robust Geometric Spanners. | 1 | 0.36 | 2018 |
| δ-Greedy t-spanner. | 0 | 0.34 | 2017 |
| \delta -Greedy t-spanner. | 0 | 0.34 | 2017 |
| Balanced Line Separators of Unit Disk Graphs. | 0 | 0.34 | 2017 |
| Strongly Connected Spanning Subgraph for Almost Symmetric Networks. | 0 | 0.34 | 2017 |
| Monochromatic Plane Matchings in Bicolored Point Set. | 0 | 0.34 | 2017 |
| Improved PTASs for convex barrier coverage | 0 | 0.34 | 2017 |
| Network Optimization on Partitioned Pairs of Points. | 0 | 0.34 | 2017 |
| On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. | 0 | 0.34 | 2016 |
| Gabriel Triangulations And Angle-Monotone Graphs: Local Routing And Recognition | 5 | 0.84 | 2016 |
| Approximating the Bottleneck Plane Perfect Matching of a Point Set | 0 | 0.34 | 2015 |
| Choice Is Hard. | 4 | 0.48 | 2015 |
| On the Bounded-Hop Range Assignment Problem | 0 | 0.34 | 2015 |
| Conflict-free Covering. | 3 | 0.41 | 2015 |
| On The Stretch Factor Of Convex Polyhedra Whose Vertices Are (Almost) On A Sphere | 0 | 0.34 | 2015 |
| Minimum Dominating Set Problem for Unit Disks Revisited | 2 | 0.37 | 2015 |
| Spiderman graph: Visibility in urban regions. | 1 | 0.35 | 2015 |
| Switching to directional antennas with constant increase in radius and hop distance | 12 | 0.65 | 2014 |
| Dual Power Assignment via Second Hamiltonian Cycle | 4 | 0.42 | 2014 |
| The Euclidean Bottleneck Steiner Path Problem and Other Applications of (ź,β)-Pair Decomposition | 1 | 0.36 | 2014 |
| Locating battery charging stations to facilitate almost shortest paths | 0 | 0.34 | 2014 |
| On the power of the semi-separated pair decomposition | 6 | 0.51 | 2013 |
| Minimum weight Euclidean t-spanner is NP-hard | 0 | 0.34 | 2013 |
| Stable Roommates Spanner | 0 | 0.34 | 2013 |
| Bounding the locality of distributed routing algorithms | 12 | 0.77 | 2013 |
| On bounded degree plane strong geometric spanners | 4 | 0.42 | 2012 |
