譚 学厚

On-line exploration of an unbounded region with one obstacle 

Theoretical Computer Science 1048 115359-115359 2025年9月  査読有り

Largest convex hulls for convex-hull disjoint clusters with bounded size 

Theoretical Computer Science 1047 115345-115345 2025年9月  査読有り

An Optimal and Practical Algorithm for the Planar 2-center Problem 

Theory of Computing Systems 69(3) 2025年7月10日  査読有り

Revisiting the Stretch Factor of Delaunay Triangulations of Points in Convex Position 

Lecture Notes in Computer Science 15179 263-273 2024年9月19日  査読有り

Largest Convex Hulls for Constant Size, Convex-Hull Disjoint Clusters 

Lecture Notes in Computer Science 128-139 2023年2月  査読有り筆頭著者

Improved stretch factor of Delaunay triangulations of points in convex position 

Journal of Combinatorial Optimization 45(1) 2022年11月15日  査読有り筆頭著者

Improved exploration of unknown polygons 

Theoretical Computer Science 922 424-437 2022年6月  査読有り筆頭著者

On the upper bound on the average distance from the Fermat-Weber center of a convex body 

Computational Geometry: Theory and Applications 97 2021年8月1日  

Charactering link-2 LR-visibility polygons and related problems 

IEICE Transactions on Fundamentals E102-A(2) 423-429 2019年5月  査読有り

Computing simple paths from given points inside a polygon, 

Discrete Applied Mathematics 257 67-76 2019年2月  査読有り

Improved Stretch Factor of Delaunay Triangulations of Points in Convex Position 

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11949 473-484 2019年  

The touring polygons problem revised 

IEICE Transactions on Fundamentals E101-A(5) 772-777 2018年11月  査読有り

The capture time of a planar graph 

Journal of Combinatorial Optimization 36(4) 1103-1117 2018年3月  査読有り

An improved algorithm for computing a shortest watchman route for lines, 

Information Processing Letters 114 51-52 2018年2月  査読有り

Simple O(n~log2 n) Algorithms for the Planar 2-Center Problem 

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10392 481-491 2017年  査読有り

Effcient algorithms for touring a sequence of convex polygons and related problems 

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10185 614-627 2017年  査読有り

A knowledge discovery framework for the assessment of tactical behaviour in soccer based on spatiotemporal data 

MATHEMATICAL AND COMPUTER MODELLING OF DYNAMICAL SYSTEMS 23(4) 384-398 2017年  査読有り

Evacuating from an unknown affected area 

International Journal of Pattern Recognition and Artical Intelligence 30(7) 1659022-1-1659022-16 2016年7月  査読有り

An Optimal On-line Strategy for Walking in Streets with Minimal Sensing 

2016 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC) 896-899 2016年  査読有り