10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
83 papers · 1 filter
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
Online Class Cover Problem
Minati De, Anil Maheshwari, Ratnadip Mandal
In this paper, we study the online class cover problem where a (finite or infinite) family of geometric objects and a set of red points in are…
On the Restricted -Steiner Tree Problem
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
Given a set of points in and an input line in , we present an algorithm that runs in optimal time and space to solve a…
On approximating shortest paths in weighted triangular tessellations
Prosenjit Bose, Guillermo Esteban, David Orden +1
We study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessel…
Improved Spanning on Theta-5
Prosenjit Bose, Darryl Hill, Aurélien Ooms
We show an upper bound of on the spanning ratio of -graphs, imp…
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots
Jared Coleman, Evangelos Kranakis, Oscar Morales-Ponce +3
In the pattern formation problem, robots in a system must self-coordinate to form a given pattern, regardless of translation, rotation, uniform-scaling, and/or reflection. In other…