Prosenjit Bose

is this you? claim profile

∙ 0 followers

Professor (Computer Science) and Associate Dean Research (Faculty of Science) at Carleton University since 1997

Dynamic Schnyder Woods

A realizer, commonly known as Schnyder woods, of a triangulation is a pa...
06/28/2021 ∙ by Sujoy Bhore, et al. ∙ 0 ∙ share

read it
Improved Spanning on Theta-5

We show an upper bound of sin(3π/10) /sin(2π/5)-sin(3π/10) <5.70 ...
06/02/2021 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Separating layered treewidth and row treewidth

Layered treewidth and row treewidth are recently introduced graph parame...
05/04/2021 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Fragile Complexity of Adaptive Algorithms

The fragile complexity of a comparison-based algorithm is f(n) if each i...
01/30/2021 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Affine invariant triangulations

We study affine invariant 2D triangulation methods. That is, methods tha...
11/04/2020 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Asymptotically Optimal Vertex Ranking of Planar Graphs

A (vertex) ℓ-ranking is a labelling φ:V(G)→ℕ of the vertices of a graph ...
07/13/2020 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
(Faster) Multi-Sided Boundary Labelling

A 1-bend boundary labelling problem consists of an axis-aligned rectangl...
02/22/2020 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Drawing Graphs as Spanners

We study the problem of embedding graphs in the plane as good geometric ...
02/13/2020 ∙ by Oswin Aichholzer, et al. ∙ 0 ∙ share

read it
Parameterized Complexity of Two-Interval Pattern Problem

A 2-interval is the union of two disjoint intervals on the real line. Tw...
02/12/2020 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs

We study online routing algorithms on the Θ6-graph and the half-Θ6-graph...
10/31/2019 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Competitive Online Search Trees on Trees

We consider the design of adaptive data structures for searching element...
08/02/2019 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives

A graph G with n vertices is called an outerstring graph if it has an in...
03/17/2019 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Near-Optimal O(k)-Robust Geometric Spanners

For any constants d> 1, ϵ >0, t>1, and any n-point set P⊂R^d, we show th...
12/24/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Stabbing Pairwise Intersecting Disks by Four Points

Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981...
12/17/2018 ∙ by Ahmad Biniaz, et al. ∙ 0 ∙ share

read it
Gathering by Repulsion

We consider a repulsion actuator located in an n-sided convex environmen...
09/26/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Pole Dancing: 3D Morphs for Tree Drawings

We study the question whether a crossing-free 3D morph between two strai...
08/31/2018 ∙ by Elena Arseneva, et al. ∙ 0 ∙ share

read it
On the Spanning and Routing Ratio of Theta-Four

We present a routing algorithm for the Theta-4-graph that computes a pat...
08/03/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...
04/19/2018 ∙ by Ahmad Biniaz, et al. ∙ 0 ∙ share

read it
Boundary Labeling for Rectangular Diagrams

Given a set of n points (sites) inside a rectangle R and n points (label...
03/28/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Geodesic Obstacle Representation of Graphs

An obstacle representation of a graph is a mapping of the vertices onto ...
03/09/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Routing on the Visibility Graph

We consider the problem of routing on a network in the presence of line ...
03/08/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Faster Algorithms for some Optimization Problems on Collinear Points

We propose faster algorithms for the following three optimization proble...
02/26/2018 ∙ by Ahmad Biniaz, et al. ∙ 0 ∙ share

read it
Reconstructing a convex polygon from its ω-cloud

An ω-wedge is the (closed) set of all points contained between two rays ...
01/07/2018 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Constrained Routing Between Non-Visible Vertices

In this paper we study local routing strategies on geometric graphs. Suc...
10/23/2017 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
On the Separation of a Polyhedron from Its Single-Part Mold

Casting is a manufacturing process where liquid material is poured into ...
08/14/2017 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Optimal Art Gallery Localization is NP-hard

Art Gallery Localization (AGL) is the problem of placing a set T of broa...
06/25/2017 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Art Gallery Localization

We study the problem of placing a set T of broadcast towers in a simple ...
06/21/2017 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
The Shadows of a Cycle Cannot All Be Paths

A "shadow" of a subset S of Euclidean space is an orthogonal projection ...
07/09/2015 ∙ by Prosenjit Bose, et al. ∙ 0 ∙ share

read it
Morphing of Triangular Meshes in Shape Space

We present a novel approach to morph between two isometric poses of the ...
05/01/2008 ∙ by Stefanie Wuhrer, et al. ∙ 0 ∙ share

read it

Prosenjit Bose

Featured Co-authors