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

1 |
An Optimal Algorithm for Product Structure in Planar Graphs |
Bose, Prosenjit et al. |
2022 |

2 |
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor |
Bose, Prosenjit et al. |
2022 |

3 |
Spanning Properties of Variants of the Delaunay Graph (Invited Talk) |
Bose, Prosenjit |
2021 |

4 |
Bounded-Angle Minimum Spanning Trees |
Biniaz, Ahmad et al. |
2020 |

5 |
Parameterized Complexity of Two-Interval Pattern Problem |
Bose, Prosenjit et al. |
2020 |

6 |
Boundary Labeling for Rectangular Diagrams |
Bose, Prosenjit et al. |
2018 |

7 |
Faster Algorithms for some Optimization Problems on Collinear Points |
Biniaz, Ahmad et al. |
2018 |

8 |
Gathering by Repulsion |
Bose, Prosenjit et al. |
2018 |

9 |
Geodesic Obstacle Representation of Graphs |
Bose, Prosenjit et al. |
2018 |

10 |
Improved Bounds for Guarding Plane Graphs with Edges |
Biniaz, Ahmad et al. |
2018 |

11 |
Improved Routing on the Delaunay Triangulation |
Bonichon, Nicolas et al. |
2018 |

12 |
Routing on the Visibility Graph |
Bose, Prosenjit et al. |
2017 |

13 |
Self-Approaching Paths in Simple Polygons |
Bose, Prosenjit et al. |
2017 |

14 |
A Plane 1.88-Spanner for Points in Convex Position |
Amani, Mahdi et al. |
2016 |

15 |
Towards Plane Spanners of Degree 3 |
Biniaz, Ahmad et al. |
2016 |

16 |
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon |
Ahn, Hee Kap et al. |
2015 |