Prosenjit Bose

Carleton University — Canada

Computer Science · Physical Sciences

37h-index7.6kcitations553works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(370), Advanced Graph Theory Research(159), Data Management and Algorithms(92), Digital Image Processing Techniques(72), Optimization and Search Problems(65)

Publications553 total

On the d-independence number in 1-planar graphs
Graphs and Combinatorics·2025
Noncrossing Longest Paths and Cycles
Graphs and Combinatorics·2025Open Access
On k-planar Graphs without Short Cycles
Journal of Graph Algorithms and Applications·2025Open Access
Computing Shortest Paths Amid Non-overlapping Weighted Disks
Results in Mathematics·2025Open Access
An Improved Bound for Plane Covering Paths
arXiv (Cornell University)·2025Open Access
Piercing unit geodesic disks
Computational Geometry·2025
Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
arXiv (Cornell University)·2025Open Access
On geodesic disks enclosing many points
arXiv (Cornell University)·2025Open Access
On Separating Path and Tree Systems in Graphs
Discrete Mathematics & Theoretical Computer Science·2025· 1 citedOpen Access
The exact spanning ratio of the parallelogram Delaunay graph
Theoretical Computer Science·2025
On 1-planar graphs with bounded cop-number
Theoretical Computer Science·2025Open Access
Approximating average bounded-angle minimum spanning trees
Computational Geometry·2025
Computational aspects of disks enclosing many points
Procedia Computer Science·2025Open Access
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
arXiv (Cornell University)·2025Open Access
The Exact Spanning Ratio of the Parallelogram Delaunay Graph
Lecture notes in computer science·2024
The basis number of 1-planar graphs
arXiv (Cornell University)·2024Open Access
On the $d$-independence number in 1-planar graphs
arXiv (Cornell University)·2024Open Access
On 1-Planar Graphs with Bounded Cop-Number
arXiv (Cornell University)·2024Open Access
Computing shortest paths amid non-overlapping weighted disks
arXiv (Cornell University)·2024Open Access
On $k$-planar Graphs without Short Cycles
arXiv (Cornell University)·2024Open Access
page 1 of 28Next →

Frequent Co-authors

Pat Morin(15), Michiel Smid(7), Anil Maheshwari(6), Anna Lubiw(4), Evangelos Kranakis(4), Joachim Gudmundsson(4), Erik D. Demaine(4), Yihui Tang(3), Luc Devroye(3), J. Ian Munro(3), Thomas C. Shermer(3), Godfried Toussaint(3), Anthony Whitehead(3), Ivan Stojmenović(2), Jorge Urrutia(2), Jason Morrison(2), Ferrán Hurtado(2), William Evans(2), Palusa Sanath Kumar Goud(2), David Kirkpatrick(2)