Yuya Higashikawa   Mordecai J. Golin   Naoki Katoh   
Journal of Graph Algorithms and Applications 18(4) 539-555 2014年 [査読有り][招待有り]
This paper addresses the minimax regret sink location problem in dy- namic tree networks. In our model, a dynamic tree network consists of an undirected tree with positive edge lengths and uniform edge capacity, and the vertex supply which is a po...
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E96D(3) 489-497 2013年3月 [査読有り]
This paper considers online vertex exploration problems in a simple polygon where starting from a point in the inside of a simple polygon, a searcher is required to explore a simple polygon to visit all its vertices and finally return to the initi...
Siu-Wing Cheng   Yuya Higashikawa   Naoki Katoh   Guanqun Ni   Bing Su   Yinfeng Xu   
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7876 121-132 2013年 [査読有り]
This paper considers minimax regret 1-sink location problems in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths and constant edge capacity and the vertex supply which is nonnegative value, ca...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8287 165-177 2013年 [査読有り]
In this paper, we propose an inductive construction of minimally rigid body-hinge simple graphs. Inductive construction is one of well-studied topics in Combinatorics and Combinatorial Optimization. We develop an inductive construction for minimal...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7285 315-326 2012年 [査読有り]
This paper considers an online exploration problem in a simple polygon where starting from a point in the interior of a simple polygon, the searcher is required to explore a simple polygon to visit all its vertices and finally return to the initia...