Bo Jiang

Affiliations:
  • Dalian Maritime University, School of Information Science and Technology, China


According to our database1, Bo Jiang authored at least 26 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Improved stretch factor of Delaunay triangulations of points in convex position.
J. Comb. Optim., 2023

2021
On the upper bound on the average distance from the Fermat-Weber center of a convex body.
Comput. Geom., 2021

2020
Adaptive and Feature-Preserving Bilateral Filters for Three-Dimensional Models.
Traitement du Signal, 2020

2019
Characterizing Link-2 LR-Visibility Polygons and Related Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Computing simple paths from given points inside a polygon.
Discret. Appl. Math., 2019

Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
An improved algorithm for computing a shortest watchman route for lines.
Inf. Process. Lett., 2018

The Touring Polygons Problem Revisited.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments.
Proceedings of the 2nd International Conference on Computer Science and Application Engineering, 2018

2017
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems.
Proceedings of the Theory and Applications of Models of Computation, 2017

Simple O(n~log^2~n) Algorithms for the Planar 2-Center Problem.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Evacuating from an Unknown Affected Area.
Int. J. Pattern Recognit. Artif. Intell., 2016

Competitive Strategies for Evacuating from an Unknown Affected Area.
IEICE Trans. Inf. Syst., 2016

2015
Searching a Circular Corridor with Three Flashlights.
Proceedings of the Fifth IEEE International Conference on Big Data and Cloud Computing, 2015

2014
Minimization of the maximum distance between the two guards patrolling a polygonal region.
Theor. Comput. Sci., 2014

Optimum sweeps of simple polygons with two guards.
Inf. Process. Lett., 2014

Characterizing and recognizing LR-visibility polygons.
Discret. Appl. Math., 2014

Strategies for Evacuating from an Affected Area with One or Two Groups.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2014

Finding Simple Paths on Given Points in a Polygonal Region.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

On-Line Strategies for Evacuating from a Convex Region in the Plane.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
A Characterization of Link-2 LR-visibility Polygons with Applications.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body.
Proceedings of the Combinatorial Optimization and Applications, 2013

2011
Searching for mobile intruders in circular corridors by two 1-searchers.
Discret. Appl. Math., 2011

2010
Simple Characterization of LR-visibility Polygons.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Searching a Circular Corridor with Two Flashlights.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Searching a Polygonal Region by Two Guards.
J. Comput. Sci. Technol., 2008


  Loading...