Jit Bose

Q: What Schools Are Affiliated With Jit Bose

Jit Bose is affiliated with the following schools: McGill University, University of Waterloo, University of British Columbia, Carleton University

Jit Bose's AcademicInfluence.com Rankings

Jit Bose

Computer Science

#2951

World Rank

#3090

Historical Rank

Algorithms

#179

World Rank

#182

Historical Rank

Machine Learning

#4707

World Rank

#4760

Historical Rank

computer-science Degrees

Jit Bose

Mathematics

#5033

World Rank

#7113

Historical Rank

Graph Theory

#100

World Rank

#108

Historical Rank

Measure Theory

#2368

World Rank

#2832

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Jit Bose Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Prosenjit K. "Jit" Bose is a Canadian mathematician and computer scientist who works at Carleton University as a professor in the School of Computer Science and associate dean of research and graduate studies for the Faculty of Science. His research concerns graph algorithms and computational geometry, including work on geometric spanners and geographic routing in wireless ad hoc networks.

(See a Problem?)

Jit Bose's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks (1999) (2038)
Online Routing in Triangulations (1999) (321)
Pattern Matching for Permutations (1993) (214)
On the false-positive rate of Bloom filters (2008) (185)
On the Spanning Ratio of Gabriel Graphs and beta-skeletons (2002) (151)
On Embedding an Outer-Planar Graph in a Point Set (1997) (124)
Flips in planar graphs (2009) (113)
Online Routing in Convex Subdivisions (2000) (101)
Efficient visibility queries in simple polygons (2002) (97)
Fast approximations for sums of distances, clustering and the Fermat-Weber problem (2003) (93)
Optimal Algorithms to Embed Trees in a Point Set (1995) (81)
Constructing Plane Spanners of Bounded Degree and Low Weight (2005) (80)
Efficient algorithms for Petersen's matching theorem (1999) (79)
Guarding Polyhedral Terrains (1997) (78)
On plane geometric spanners: A survey and open problems (2013) (76)
Competitive Online Routing in Geometric Graphs (2004) (67)
Temporal Synchronization of Video Sequences in Theory and in Practice (2005) (67)
Algorithms and Computation (2002) (66)
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (2009) (66)
On Rectangle Visibility Graphs (1996) (63)
A survey of geodesic paths on 3D surfaces (2011) (60)
A Visibility Representation for Graphs in Three Dimensions (1998) (56)
The Floodlight Problem (1997) (54)
Online routing in geometric graphs (2001) (54)
Persistent realtime building interior generation (2006) (53)
Approximating Geometric Bottleneck Shortest Paths (2003) (52)
Separating an object from its cast (1997) (51)
On simplifying dot maps (2004) (50)
Ordered theta graphs (2004) (50)
Feature-based cut detection with automatic threshold selection (2004) (48)
ON THE SPANNING RATIO OF GABRIEL GRAPHS AND β-SKELETONS (2002) (46)
Strategies for Hotlink Assignments (2000) (45)
The Complexity of Rivers in Triangulated Terrains (1996) (45)
Bounds for Frequency Estimation of Packet Streams (2003) (44)
Feasibility of Design in Stereolithography (1997) (44)
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (2003) (43)
On the Stretch Factor of Convex Delaunay Graphs (2008) (42)
Computing Constrained Minimum-Width Annuli of Point Sets (1997) (42)
Area-preserving approximations of polygonal paths (2006) (42)
Computing the Greedy Spanner in Near-Quadratic Time (2008) (42)
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications (1996) (41)
Dynamic optimality for skip lists and B-trees (2008) (40)
Drawing Nice Projections of Objects in Space (1995) (39)
Proximity Constraints and Representable Trees (1994) (39)
π/2-Angle Yao Graphs are Spanners (2010) (39)
Almost all Delaunay triangulations have stretch factor greater than pi/2 (2011) (37)
Filling Polyhedral Molds (1993) (36)
An Improved Algorithm for Subdivision Traversal without Extra Storage (2000) (35)
No Quadrangulation is Extremely Odd (1995) (34)
Filling holes in triangular meshes by curve unfolding (2009) (34)
Characterizing proximity trees (1996) (34)
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon (2015) (34)
Constructing Plane Spanners of Bounded Degree and Low Weight (2002) (34)
New and Improved Spanning Ratios for Yao Graphs (2013) (32)
Space-efficient geometric divide-and-conquer algorithms (2007) (32)
Every Set of Disjoint Line Segments Admits a Binary Tree (1994) (32)
The θ 5-Graph is a Spanner (2012) (31)
Characterizing and efficiently computing quadrangulations of planar point sets (1997) (31)
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs (2009) (31)
Partitions of Complete Geometric Graphs into Plane Trees (2004) (31)
Algorithms for optimal outlier removal (2009) (31)
Approximate Range Mode and Range Median Queries (2005) (30)
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance (2011) (29)
Growing a Tree from Its Branches (1995) (28)
Traversing a Set of Points with a Minimum Number of Turns (2007) (28)
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing (2004) (28)
Delaunay and diamond Triangulations contain Spanners of Bounded Degree (2009) (28)
Determining the Castability of Simple Polyhedra (1994) (28)
Augmented reality on cloth with realistic illumination (2009) (27)
On the Stretch Factor of the Theta-4 Graph (2013) (27)
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles (2014) (27)
Geodesic Ham-Sandwich Cuts (2004) (27)
Competitive routing in the half-θ6-graph (2012) (27)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (2012) (26)
On the stabbing number of a random Delaunay triangulation (2007) (26)
A Polynomial Bound for Untangling Geometric Planar Graphs (2007) (26)
Intersections with random geometric objects (1998) (26)
Simultaneous diagonal flips in plane triangulations (2005) (26)
On the Stretch Factor of the Constrained Delaunay Triangulation (2006) (25)
Geometric and computational aspects of manufacturing processes (1996) (25)
Surface roughness of rock faces through the curvature of triangulated meshes (2014) (25)
Incremental Construction of k-Dominating Sets in Wireless Sensor Networks (2006) (24)
Towards tight bounds on theta-graphs: More is not always better (2016) (24)
The spanning ratio of the Delaunay triangulation is greater than pi/2 (2009) (24)
On properties of higher-order Delaunay graphs with applications (2005) (23)
Posture Invariant Correspondence of Incomplete Triangular Manifolds (2007) (23)
Robust geometric spanners (2012) (23)
Making triangulations 4-connected using flips (2011) (21)
Bounding the locality of distributed routing algorithms (2009) (20)
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009) (20)
A History of Flips in Combinatorial Triangulations (2012) (19)
Asymmetric Communication Protocols via Hotlink Assignments (2003) (19)
Revisiting the Problem of Searching on a Line (2013) (19)
On the Spanning Ratio of Theta-Graphs (2013) (19)
On bounded degree plane strong geometric spanners (2012) (19)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (2016) (19)
Some Aperture-Angle Optimization Problems (2002) (18)
On Plane Constrained Bounded-Degree Spanners (2012) (18)
Coloring and Guarding Arrangements (2012) (17)
Searching on a line: A complete characterization of the optimal solution (2015) (17)
Succinct geometric indexes supporting point location queries (2008) (17)
Common Unfoldings of Polyominoes and Polycubes (2010) (17)
On the sectional area of convex polytopes (1996) (17)
Facility Location Constrained to a Polygonal Domain (2002) (17)
Equitable subdivisions within polygonal regions (2006) (17)
Competitive Online Search Trees on Trees (2019) (16)
Diamonds are Not a Minimum Weight Triangulation's Best Friend (1996) (16)
Automatically Creating Design Models from 3D Anthropometry Data (2011) (15)
Flipping edge-labelled triangulations (2013) (15)
Theta-3 is connected (2014) (15)
Optimal Bounds on Theta-Graphs: More is not Always Better (2012) (15)
K-Guarding Polygons on the Plane (1994) (14)
The Power and Limitations of Static Binary Search Trees with Lazy Finger (2013) (14)
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (2005) (14)
Geometric and computational aspects of gravity casting (1995) (14)
Feasability of Design in Stereolithography (1993) (14)
Upper and Lower Bounds for Online Routing on Delaunay Triangulations (2017) (14)
On computing enclosing isosceles triangles and related problems (2011) (14)
Some properties of k-Delaunay and k-Gabriel graphs (2013) (14)
Competitive Online Routing on Delaunay Triangulations (2014) (14)
Fast local searches and updates in bounded universes (2013) (14)
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers (1996) (13)
Coarse grained parallel algorithms for graph matching (2008) (13)
Global Context Descriptors for SURF and MSER Feature Descriptors (2010) (13)
Weighted Ham-Sandwich Cuts (2004) (13)
Translating a regular grid over a point set (2003) (13)
Visual enhancement of 3D images of rock faces for fracture mapping (2014) (12)
Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra (2005) (12)
Improved Methods For Generating Quasi-Gray Codes (2010) (12)
Smallest enclosing circle centered on a query line segment (2008) (12)
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies (2007) (12)
A general framework for searching on a line (2016) (12)
A Characterization of the degree sequences of 2‐trees (2006) (12)
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon (2016) (12)
Competitive Local Routing with Constraints (2014) (12)
Reprint of (2015) (12)
Relaxed Gabriel Graphs (2009) (11)
Coarse grained parallel maximum matching in convex bipartite graphs (1999) (11)
Towards Plane Spanners of Degree 3 (2016) (11)
Flipping your Lid (2001) (11)
Communication-Efficient Construction of the Plane Localized Delaunay Graph (2008) (11)
On the Spanning and Routing Ratio of Theta-Four (2018) (11)
A linear-space algorithm for distance preserving graph embedding (2009) (11)
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times (2010) (10)
Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain (1996) (10)
Approximating Shortest Paths in Arrangements of Lines (1996) (10)
Layered Working-Set Trees (2009) (10)
Asymptotically Optimal Vertex Ranking of Planar Graphs (2020) (10)
Posture invariant correspondence of triangular meshes in shape space (2009) (10)
Pole Dancing: 3D Morphs for Tree Drawings (2018) (10)
Location-Oblivious Distributed Unit Disk Graph Coloring (2011) (9)
Spanning Trees in Multipartite Geometric Graphs (2016) (9)
Light edges in degree-constrained graphs (2004) (9)
A plane 1.88-spanner for points in convex position (2016) (9)
Geometric and Computational Aspects of Injection Molding (1992) (9)
Properties of Arrangement Graphs (2003) (9)
Polygon Cutting: Revisited (1998) (9)
Vertex Pops and Popturns (2007) (9)
Separating layered treewidth and row treewidth (2021) (9)
Pi/2-Angle Yao Graphs are Spanners (2010) (9)
Morphing of Triangular Meshes in Shape Space (2008) (9)
Approximations of Geodesic Distances for Incomplete Triangular Manifolds (2007) (9)
Algorithms for Sensor Systems (2015) (8)
Minimum-area enclosing triangle with a fixed angle (2010) (8)
Plane Bichromatic Trees of Low Degree (2015) (8)
Testing the Quality of Manufactured Disks and Balls (2003) (8)
Improved Spanning Ratio for Low Degree Plane Spanners (2015) (8)
Efficient Construction of Near-Optimal Binary and Multiway Search Trees (2009) (8)
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs (2014) (8)
Diamond Triangulations Contain Spanners of Bounded Degree (2006) (8)
Lazy Generation of Building Interiors in Realtime (2006) (8)
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives (2019) (8)
Visibility in Simple Polygons (1991) (7)
The Grid Placement Problem (2001) (7)
Testing the Quality of Manufactured Disks and Cylinders (1998) (7)
Improved Routing on the Delaunay Triangulation (2018) (7)
Reconfiguring Triangulations with Edge Flips and Point Moves (2004) (7)
Optimizing a constrained convex polygonal annulus (2005) (7)
Optimal Algorithms for Constrained 1-Center Problems (2014) (7)
Triangulating and Guarding Realistic Polygons (2014) (7)
Stable Roommates Spanner (2013) (7)
Spanners of Additively Weighted Point Sets (2008) (7)
Near-Optimal O(k)-Robust Geometric Spanners (2018) (7)
Near optimal-partitioning of rectangles and prisms (1999) (7)
Station Layouts in the Presence of Location Constraints (1999) (7)
An Optimal Algorithm for Product Structure in Planar Graphs (2022) (7)
Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding (2010) (6)
Algorithms for Packing Two Circles in a Convex Polygon (1998) (6)
Experimental results on quadrangulations of sets of fixed points (2002) (6)
Computing signed permutations of polygons (2011) (6)
New Bounds for Facial Nonrepetitive Colouring (2016) (6)
Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints (2019) (6)
Geometric Spanners with Small Chromatic Number (2007) (6)
Skip lift: A probabilistic alternative to red-black trees (2010) (6)
Competitive Routing on a Bounded-Degree Plane Spanner (2012) (6)
NETWORK FARTHEST-POINT DIAGRAMS AND THEIR APPLICATION TO FEED-LINK NETWORK EXTENSION (2013) (6)
Constrained Routing Between Non-Visible Vertices (2017) (6)
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids (2004) (6)
The theta-5-graph is a spanner (2012) (6)
Constrained Generalized Delaunay Graphs Are Plane Spanners (2016) (6)
Maximum Plane Trees in Multipartite Geometric Graphs (2018) (6)
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (2015) (6)
Connectivity-preserving transformations of binary images (2009) (6)
Packing Plane Perfect Matchings into a Point Set (2015) (5)
Faster Algorithms for some Optimization Problems on Collinear Points (2018) (5)
Sigma-local graphs (2010) (5)
Competitive routing in the half-theta_6-graph (2012) (5)
A History of Distribution-Sensitive Data Structures (2013) (5)
A Distribution-Sensitive Dictionary with Low Space Overhead (2009) (5)
Induced Subgraphs of Bounded Degree and Bounded Treewidth (2005) (5)
Some properties of higher order delaunay and gabriel graphs (2010) (5)
Odds-On Trees (2010) (5)
Minimum enclosing area triangle with a fixed angle (2010) (5)
Continuous Yao Graphs (2014) (5)
Flips in Edge-Labelled Pseudo-Triangulations (2015) (5)
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs (2019) (5)
Isometric Morphing of Triangular Meshes (2008) (5)
On Generalized Diamond Spanners (2007) (5)
A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design (2014) (4)
Network Farthest-Point Diagrams (2013) (4)
A Survey of Geodesic Paths on 3 D Surfaces I (2011) (4)
A generalized Winternitz Theorem (2011) (4)
Bounded-Angle Minimum Spanning Trees (2021) (4)
Detection of text-line orientation (1998) (4)
Art Gallery Localization (2017) (4)
Rotational Clamshell Casting In Two Dimensions (2006) (4)
Finding the k-Visibility Region of a Point in a Simple Polygon in the Memory-Constrained Model (2016) (4)
Routing on the Visibility Graph (2018) (4)
Self-Approaching Paths in Simple Polygons (2017) (4)
De-amortizing Binary Search Trees (2011) (4)
On the separation of a polyhedron from its single-part mold (2017) (4)
Rotational Clamshell Casting In Three Dimensions (2006) (4)
Testing the Quality of Manufactured Balls (1999) (4)
Packing two disks into a polygonal environment (2001) (4)
A note on the perimeter of fat objects (2011) (4)
Geometric placement problems (2002) (4)
Guarding Fat Polygons and Triangulating Guarded Polygons (2007) (4)
Optimal Data Structures for Farthest-Point Queries in Cactus Networks (2014) (4)
Improved Bounds for Guarding Plane Graphs with Edges (2018) (3)
On Rectangular Visibility Graphs, Graph Drawing (1997) (3)
Improved Bounds on the Spanning Ratio of the Theta-5-Graph (2021) (3)
Should Static Search Trees Ever Be Unbalanced? (2010) (3)
Gathering by Repulsion (2018) (3)
A note on the lower bound of edge guards of polyhedral terrains (2009) (3)
Isoperimetric triangular enclosures with a fixed angle (2013) (3)
Aperture angle optimization problems (1995) (3)
Cutting rectangles in equal area pieces (1998) (3)
Algorithms for Designing Clamshell Molds (2007) (3)
Towards Tight Bounds on Theta-Graphs (2014) (3)
Power domination on triangular grids with triangular and hexagonal shape (2020) (3)
Boundary Labeling for Rectangular Diagrams (2018) (3)
Probing convex polygons with a wedge (2015) (3)
Power Domination on Triangular Grids (2017) (3)
Linear-Space Algorithms for Distance Preserving Embedding (2007) (3)
Location Oblivious Distributed Unit Disk Graph Coloring (2007) (3)
On Farthest-Point Information in Networks (2012) (3)
Optimizing Constrained Offset and Scaled Polygonal Annuli (1999) (3)
Circumscribed Polygons of Small Area (2009) (2)
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs (2019) (2)
The Price of Order (2014) (2)
Biased Predecessor Search (2014) (2)
Computing the k-Visibility Region of a Point in a Polygon (2020) (2)
Local Routing in Spanners Based on WSPDs (2017) (2)
Flips in Higher Order Delaunay Triangulations (2020) (2)
A Polynomial Bound for Untangling Geometric Planar Graphs (2008) (2)
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon (2016) (2)
Optimal Art Gallery Localization is NP-hard (2017) (2)
Local Routing in Convex Subdivisions (2015) (2)
Rotationally Monotone Polygons (2009) (2)
Plane Bichromatic Trees of Low Degree (2017) (2)
Non-Crossing Matching of Online Points (2020) (2)
Spanners of Complete k -Partite Geometric Graphs (2007) (2)
Point Location in Disconnected Planar Subdivisions (2010) (2)
Finding Specified Sections of Arrangements: 2D Results (2002) (2)
Affine invariant triangulations (2020) (2)
Isoperimetric Triangular Enclosure with a Fixed Angle (2011) (2)
Upper and Lower Bounds for Online Routing on Delaunay Triangulations (2016) (1)
A new "angle" on aortic neck angulation measurement. (2016) (1)
The Minimum Moving Spanning Tree Problem (2021) (1)
Bounded Approximations of Geodesics for Triangular Manifolds with Partially Missing Data (2007) (1)
On Plane Constrained Bounded-Degree Spanners (2018) (1)
On the Restricted 1-Steiner Tree Problem (2020) (1)
The Shadows of a Cycle Cannot All Be Paths (2015) (1)
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (2017) (1)
Routing with Guaranteed Deliveryin ad ho Wireless Networks (1999) (1)
The Convex Hull of Points on a Sphere is a Spanner (2014) (1)
Formalization of the General Video Temporal Synchronization Problem (2010) (1)
On a class of O(n²) problems in . . . (1993) (1)
Spanning Properties of Yao and $\Theta$-Graphs in the Presence of Constraints (2014) (1)
Collaborative Virtual Observatories using CoSEC (2004) (1)
Piercing pairwise intersecting geodesic disks (2021) (1)
Computing Covers of Plane Forests (2013) (1)
Computing the Tool Path of an Externally Monotone Polygon in Linear Time (2006) (1)
COMPUTATIONAL GEOMETRY FOR CAD/CAM (1994) (1)
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle (2016) (1)
Translating a Star over a Point Set (2005) (1)
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (2017) (1)
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations (2015) (1)
On the spanning and routing ratios of the directed Θ6-graph (2022) (1)
Algorithms and computation : 13th International Symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings (2002) (1)
Searching and Routing in Discrete and Continuous Domains (2016) (1)
Geodesic Obstacle Representation of Graphs (2018) (1)
Constrained Empty-Rectangle Delaunay Graphs (2015) (1)
Dynamic Schnyder Woods (2021) (1)
Essential Constraints of Edge-Constrained Proximity Graphs (2016) (1)
Bounded-Angle Minimum Spanning Trees (2021) (1)
Layered Working-Set Trees (2011) (1)
Sequences of spanning trees for L∞-Delaunay triangulations∗ (2018) (1)
Improved Spanning on Theta-5 (2021) (1)
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks (2021) (1)
Local routing in WSPD-based spanners (2021) (1)
Computing nice sweeps for polyhedra and polygons (2004) (1)
Faster Multi-sided One-Bend Boundary Labelling (2021) (1)
Recovering lines with fixed linear probes (1998) (1)
Semantic Composition of Distributed Solar Data and Analysis Services For Coordinated E-Science (2002) (1)
A Distributed Processing and Analysis System for Heliophysic Events (2008) (0)
Annul i of Point Sets * (0)
Attraction-convexity and Normal Visibility (2019) (0)
Flipping your (2000) (0)
A General Approximation Algorithm for Planar Maps with Applications (2007) (0)
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph (2021) (0)
On k-Guarding of Polygons (2007) (0)
Linear versus centred chromatic numbers (2022) (0)
Geometric Divide-and-Conquer Algorithms (2004) (0)
Optimal Point Set Partitioning using Rigid Motion Star Placement (2007) (0)
Optimal Polygon Placement (2006) (0)
A linear-time algorithm for the geodesic center of a simple 1 polygon 2 (2015) (0)
Maximum Plane Trees in Multipartite Geometric Graphs (2018) (0)
High-speed texture-preserving digital image inpainting (2005) (0)
Testing the Quality of Manufa tured Balls ? (1998) (0)
Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold (2017) (0)
A 13/9-approximation of the average-2π/3-MST (2022) (0)
On the Zombie Number of Various Graph Classes (2022) (0)
A NOTE ON THE PERIMETER OF ( α , β ) – COVERED OBJECTS (2009) (0)
Editorial: Special issue in memory of Dr. Ferran Hurtado (2018) (0)
Clamshell Casting (2009) (0)
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
Power domination on triangular grids with triangular and hexagonal shape (2020) (0)
On the perimeter of fat objects (2010) (0)
Drawing Graphs as Spanners (2020) (0)
Syddansk Universitet Competitive local routing with constraints (2017) (0)
Cutting Circles into Equal Area Pieces 1 (2006) (0)
Collaborative Observatories for ILWS (2004) (0)
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere (2015) (0)
3 The Maximum Bichromatic Plane Spanning Tree Problem r (2018) (0)
A Prototype Problem-Solving Environment for Living With a Star Data (2001) (0)
Visual enhancement of 3D images of rock faces for rock mass characterization (2013) (0)
On Approximating Shortest Paths in Weighted Triangular Tessellations (2021) (0)
8. References 6. Concluding Remarks 7. Acknowledgments (1992) (0)
Ju n 20 10 Should Static Search Trees Ever Be Unbalanced ? (2018) (0)
New Bounds for Facial Nonrepetitive Colouring (2017) (0)
Weighted shortest path in equilateral triangular meshes (2022) (0)
(Faster) Multi-Sided Boundary Labelling (2020) (0)
Parameterized Complexity of Two-Interval Pattern Problem (2020) (0)
One of Ferran Hurtado's favorite topics - Flips (2015) (0)
Spanning Trees in Multipartite Geometric Graphs (2017) (0)
A Characterization of the Degree Sequences of 2-trees (2007) (0)
Improved Spanning Ratio for Low Degree Plane Spanners (2017) (0)
Reconstructing a convex polygon from its ω-cloud (2018) (0)
Semantic integration of space science services: The CoSEC experience (2006) (0)
Quartering a square optimally (2002) (0)
A Lower Bound for Deterministic Asynchronous Rendez-Vous on the Line (2016) (0)
Watchtower for k-crossing Visibility (2019) (0)
Fragile Complexity of Adaptive Algorithms (2021) (0)
Finding Speci(cid:12)ed Sections of Arrangements: 2D Results (2022) (0)
Proceedings of the 13th International Symposium on Algorithms and Computation (2002) (0)
Proximity Constraints and Representable Trees ? ( extended abstra t ) (2007) (0)
Guest Editors’ Foreword (2004) (0)
On the restricted k-Steiner tree problem (2021) (0)
On proximity problems in Euclidean spaces (2016) (0)
Reprint of: Theta-3 is connected (2015) (0)
Experimental Results on Quadrangulations of Sets of PointsProsenjit Bose (2007) (0)
The Power and Limitations of Static Binary Search Trees with Lazy Finger (2016) (0)
3 Theory of Shape Space for Triangulated 3 D Polygons (2008) (0)
Improved Bounds for Guarding Plane Graphs with Edges (2019) (0)
HKUST Institutional Repository (2003) (0)
Pa king Two Disks into a PolygonalEnvironment ? (2001) (0)
On flips in triangulations (2005) (0)
The Collaborative Sun-Earth Connector (2002) (0)
On Simplifying Dot Maps ( abstract ) (0)
Fundamental problems in computational video (2004) (0)
Bounding the locality of distributed routing algorithms (2012) (0)
Using the Collaborative Sun-Earth Connector for integrating data systems (2005) (0)
On the Spanning and Routing Ratio of Directed Theta-Four (2018) (0)
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada (2007) (0)
MINIMALIST APPROXIMATIONS FOR CONVEX FUNCTIONS (0)
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance (2013) (0)
Optimal Algor i thms to E m b e d Trees in a Point Set (2005) (0)
Visibility Monotonic Polygon Deflation (2012) (0)
Biased Predecessor Search (2016) (0)
Virtual Science Operations for the Sun Solar System Great Observatory (2005) (0)
Searching by Panning and Zooming (2014) (0)
Ane invariant triangulations (2019) (0)
Feature Tracking for Cut Detection (2004) (0)
Routing on Heavy-Path WSPD-Spanners (2021) (0)
Incremental construction of κ-dominating sets in wireless sensor networks (2006) (0)
Succinct Data Structures for Approximating Convex Functions with Applications (2002) (0)
Coverage with k-transmitters in the presence of obstacles (2012) (0)
Computing the k-Crossing Visibility Region of a Point in a Polygon (2019) (0)
Constrained Generalized Delaunay Are Plane Spanners (2016) (0)
4.3 a Data Structuring Approach (1994) (0)
Computing Signed Permutations of Polygon (2011) (0)
Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs (2019) (0)
Revised Selected Papers of the 11th International Symposium on Algorithms for Sensor Systems - Volume 9536 (2015) (0)
Spanning Properties of Variants of the Delaunay Graph (Invited Talk) (2021) (0)
The dilation of the Delaunay triangulation is greater than π/2 (2010) (0)
On spanning properties of various Delaunay graphs (2012) (0)
uting the Constrained Euclidean, ic and Link Centre of a Simple Polygon with Atmlicat ions I (1996) (0)
Piercing Pairwise Intersecting Convex Shapes in the Plane (2022) (0)
CoSEC: Connecting Living With a Star Research (2006) (0)
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor (2022) (0)
CoSEC: Coordinated Web Services and Infrastructure for Living with a Star (2003) (0)
Sequences of spanning trees for L-infinity Delaunay triangulations (2018) (0)
Local Routing Algorithms on Euclidean Spanners with Small Diameter (2022) (0)
Three-Coloring Three-Dimensional Uniform Hypergraphs (2019) (0)
Reconstructing a Convex Polygon from Its \omega ω -cloud (2018) (0)
6. Concluding Remarks 7. Acknowledgments 8. References 5. Lower Bounds 4. the Case of Two Convex Polygons: the Minimization Problem (0)
Towards a General Framework for Searching on a Line and Searching on $m$ Rays (2014) (0)
NRC Publications Archive Archives des publications du CNRC : a pilot study (2019) (0)
Dielectric-Coated Metal-Integrated Lightweight Solar Panel (2020) (0)
Isoperimetric triangular enclosures with a fixed angle (2013) (0)

This paper list is powered by the following services:

Other Resources About Jit Bose

en.wikipedia.org

What Schools Are Affiliated With Jit Bose?

Jit Bose is affiliated with the following schools:

Jit Bose's Academic­Influence.com Rankings

Why Is Jit Bose Influential?

Jit Bose's Published Works

Published Works

Other Resources About Jit Bose

What Schools Are Affiliated With Jit Bose?

Jit Bose's AcademicInfluence.com Rankings