Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP 
20221026 11:45 
Fukuoka 
Kyusyu Univ. Nishijin Plaza 
Evacuation problems on grid networks with uniform transit time and uniform capacity Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) COMP202215 
We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] 
COMP202215 pp.713 
COMP 
20180918 13:25 
Fukuoka 
Kyusyu Institute of Technology 
Minimax regret 1center problems with parametric weights Shohei Ookatsu, Naoki Katoh (Kwansei Gakuin Univ.), Junichi Teruyama, Yuya Higashikawa (Univ. of Hyogo), Hiroyoshi Miwa (Kwansei Gakuin Univ.) COMP201813 
In this paper, based on the minimax regret model which is an approach for the robust optimization, we consider 1center ... [more] 
COMP201813 pp.2933 
COMP 
20160906 15:20 
Toyama 
Toyama Prefectural University 
An algorithm for an optimal sink location problem in dynamic tree networks on condition that minimize the total evacuation time Naoki Takahashi, Naoki Katoh (Kwansei Gakuin Univ), Yuya Higashikawa (Chuo Univ) COMP201620 
We study dynamic tree network to represent evacuation of
evacuees originally at vertices by using a road network
to... [more] 
COMP201620 pp.3744 
COMP, IPSJAL 
20150612 14:55 
Hokkaido 

[Invited Talk]
Recent Advances in Theory of Combinatorial Rigidity and Its Applications Naoki Katoh (KGU) COMP20156 
It is known that the condition m≧2n3 is necessary for a 2dimensional barjoint framework with n pinjoints and and m b... [more] 
COMP20156 p.27 
COMP 
20141205 14:25 
Kumamoto 
Sojo University 
Polynomialtime approximability of the 1{sc Sink Location} problem in undirected graphs with triangular inequality Remy Belmonte, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.) 
[more] 

COMP 
20141205 16:10 
Kumamoto 
Sojo University 
Optimally Bracing Frameworks of Union of Spacefilling Convex Polyhedra Yuki Kobayashi, Yoshihiko Ito, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Jinichi Itoh (Kumamoto Univ.), Chie Nara (Tokai Univ.) COMP201439 
(To be available after the conference date) [more] 
COMP201439 pp.4551 
COMP 
20141205 17:10 
Kumamoto 
Sojo University 
Optimally Bracing Grid Frameworks with Holes Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), SheungHung Poon (National Tsing Hua Univ.), Maria Saumell (Univ. of West Bohemia) COMP201441 
[more] 
COMP201441 pp.5963 
COMP 
20140310 11:05 
Tokyo 

A Heuristic for Quickest Transshipment Problem and its Application to Evacuation Planning Akio Ohta (Kyoto Univ.), Naoyuki Kamiyama (Kyusyu Univ.), Atsushi Takizawa (Osaka City Univ.), Naoki Katoh (Kyoto Univ.) COMP201364 
Quickest transshipment problem is defined by a multisource, multisink dynamic flow network, each source of that has a ... [more] 
COMP201364 pp.2934 
COMP 
20140310 11:30 
Tokyo 

Redundancy of Rigidity of Convex Polyhedra under the PanelHinge Framework Model Yoshihiko Ito (Kyoto Univ.), Sergey Bereg (Univ. of Texas), Yuya Higashikawa, Naoki Katoh (Kyoto Univ.) COMP201365 
[more] 
COMP201365 pp.3542 
COMP 
20131221 13:20 
Okinawa 
Okinawa Industry Support Center 
kEdgeRigid BodyHinge Graphs Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi (Kyoto Univ.), Adnan Sljoka (York Univ.) COMP201353 
In this paper, we prove that a bodyhinge graph $G$ is $(k1)$edgerigid if and only if $G$ is $k$edgeconnected ($k g... [more] 
COMP201353 pp.8791 
COMP 
20131221 13:45 
Okinawa 
Okinawa Industry Support Center 
kSink Location Problem in Dynamic Path Networks Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.) COMP201354 
This paper considers the $k$sink location problem in dynamic path networks.
In our model, a dynamic path network consi... [more] 
COMP201354 pp.9397 
COMP 
20130903 10:10 
Tottori 

An O(n log n) Algorithm for the Minimax Regret Sink Location Problem in Dynamic Path Networks with the Uniform Capacity Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.) COMP201325 
This paper considers minimax regret 1sink location problems in {it dynamic path networks}.
In our model, a dynamic pat... [more] 
COMP201325 pp.18 
COMP 
20100312 15:50 
Tokyo 
National Institute of Informatics 
Online graph exploration algorithms for cycles and trees by multiple number of searchers Yuya Higashikawa, Naoki Katoh, Shinichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB) COMP200957 
This paper deals with online graph exploration problems by multiple searchers. The purpose of search is to visit all ver... [more] 
COMP200957 pp.4956 
COMP 
20090914 15:40 
Tottori 
Tottori University of Environmental Studies 
A Rootedforest Partition with Uniform Vertex Demand and Its Application to the Rigidity Theory Naoki Katoh, Shinichi Tanigawa (Kyoto Univ.) COMP200931 
A rootedforest is a graph having selfloops such that each connected component contains exactly one loop, which is rega... [more] 
COMP200931 pp.4350 
COMP 
20060426 10:50 
Kyoto 
Kyoto University 
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths Shinichi Tanigawa, Naoki Katoh (Kyoto Univ.) 
For a given $x$monotone polygonal curve each of whose edge lengths is between $\underline{l}$ and $2\underline{l}$,
we... [more] 
COMP20063 pp.1724 
COMP 
20060426 14:15 
Kyoto 
Kyoto University 
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa (Kyoto Univ.) 
In this paper, we consider the quickest flow problem in a network which
consists of a directed graph with capacities a... [more] 
COMP20066 pp.4148 