| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2022-10-26 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)  COMP2022-15 |
We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] | COMP2022-15 pp.7-13 |
| COMP | 2018-09-18 13:25 |
Fukuoka | Kyusyu Institute of Technology | Minimax regret 1-center problems with parametric weights Shohei Ookatsu, Naoki Katoh (Kwansei Gakuin Univ.), Junichi Teruyama, Yuya Higashikawa (Univ. of Hyogo), Hiroyoshi Miwa (Kwansei Gakuin Univ.) COMP2018-13 |
In this paper, based on the minimax regret model which is an approach for the robust optimization, we consider 1-center ... [more] | COMP2018-13 pp.29-33 |
| COMP | 2016-09-06 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) COMP2016-20 |
We study dynamic tree network to represent evacuation of evacuees originally at vertices by using a road network to... [more] |
COMP2016-20 pp.37-44 |
| COMP, IPSJ-AL | 2015-06-12 14:55 |
Hokkaido | [Invited Talk]
Recent Advances in Theory of Combinatorial Rigidity and Its Applications Naoki Katoh (KGU) COMP2015-6 |
It is known that the condition m≧2n-3 is necessary for a 2-dimensional bar-joint framework with n pin-joints and and m b... [more] | COMP2015-6 p.27 |
|
| COMP | 2014-12-05 14:25 |
Kumamoto | Sojo University | Polynomial-time approximability of the 1-{sc Sink Location} problem in undirected graphs with triangular inequality Remy Belmonte, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.) |
[more] | |
| COMP | 2014-12-05 16:10 |
Kumamoto | Sojo University | Optimally Bracing Frameworks of Union of Space-filling Convex Polyhedra Yuki Kobayashi, Yoshihiko Ito, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Jin-ichi Itoh (Kumamoto Univ.), Chie Nara (Tokai Univ.) COMP2014-39 |
(To be available after the conference date) [more] | COMP2014-39 pp.45-51 |
| COMP | 2014-12-05 17:10 |
Kumamoto | Sojo University | Optimally Bracing Grid Frameworks with Holes Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Sheung-Hung Poon (National Tsing Hua Univ.), Maria Saumell (Univ. of West Bohemia) COMP2014-41 |
[more] | COMP2014-41 pp.59-63 |
| COMP | 2014-03-10 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.) COMP2013-64 |
Quickest transshipment problem is defined by a multi-source, multi-sink dynamic flow network, each source of that has a ... [more] | COMP2013-64 pp.29-34 |
|
| COMP | 2014-03-10 11:30 |
Tokyo | Redundancy of Rigidity of Convex Polyhedra under the Panel-Hinge Framework Model Yoshihiko Ito (Kyoto Univ.), Sergey Bereg (Univ. of Texas), Yuya Higashikawa, Naoki Katoh (Kyoto Univ.) COMP2013-65 |
[more] | COMP2013-65 pp.35-42 |
|
| COMP | 2013-12-21 13:20 |
Okinawa | Okinawa Industry Support Center | k-Edge-Rigid Body-Hinge Graphs Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi (Kyoto Univ.), Adnan Sljoka (York Univ.) COMP2013-53 |
In this paper, we prove that a body-hinge graph $G$ is $(k-1)$-edge-rigid if and only if $G$ is $k$-edge-connected ($k g... [more] | COMP2013-53 pp.87-91 |
| COMP | 2013-12-21 13:45 |
Okinawa | Okinawa Industry Support Center | k-Sink Location Problem in Dynamic Path Networks Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.) COMP2013-54 |
This paper considers the $k$-sink location problem in dynamic path networks. In our model, a dynamic path network consi... [more] |
COMP2013-54 pp.93-97 |
| COMP | 2013-09-03 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.) COMP2013-25 |
This paper considers minimax regret 1-sink location problems in {it dynamic path networks}. In our model, a dynamic pat... [more] |
COMP2013-25 pp.1-8 |
|
| COMP | 2010-03-12 15:50 |
Tokyo | National Institute of Informatics | Online graph exploration algorithms for cycles and trees by multiple number of searchers Yuya Higashikawa, Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB) COMP2009-57 |
This paper deals with online graph exploration problems by multiple searchers. The purpose of search is to visit all ver... [more] | COMP2009-57 pp.49-56 |
| COMP | 2009-09-14 15:40 |
Tottori | Tottori University of Environmental Studies | A Rooted-forest Partition with Uniform Vertex Demand and Its Application to the Rigidity Theory Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.) COMP2009-31 |
A rooted-forest is a graph having self-loops such that each connected component contains exactly one loop, which is rega... [more] | COMP2009-31 pp.43-50 |
| COMP | 2006-04-26 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 Shin-ichi 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] |
COMP2006-3 pp.17-24 |
| COMP | 2006-04-26 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] |
COMP2006-6 pp.41-48 |
[Return to Top Page]