 | 2009 |
|---|
| 9 |       | Naoyuki Kamiyama,
Yuuki Kiyonari,
Eiji Miyano,
Shuichi Miyazaki,
Katsuhisa Yamanaka:
Computational Complexities of University Interview Timetabling.
IEICE Transactions 92-D(2): 130-140 (2009) |
| 8 | | Kristóf Bérczi,
Satoru Fujishige,
Naoyuki Kamiyama:
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph.
Inf. Process. Lett. 109(23-24): 1227-1231 (2009) |
| 2008 |
|---|
| 7 | | Naoyuki Kamiyama,
Naoki Katoh:
Covering Directed Graphs by In-Trees.
COCOON 2008: 444-457 |
| 6 | | Naoyuki Kamiyama,
Naoki Katoh:
The Minimum Weight In-Tree Cover Problem.
MCO 2008: 155-164 |
| 5 | | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs.
SODA 2008: 518-526 |
| 4 | | Naoyuki Kamiyama,
Naoki Katoh:
Covering Directed Graphs by In-trees
CoRR abs/0802.2755: (2008) |
| 2007 |
|---|
| 3 | | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths.
AAIM 2007: 178-190 |
| 2006 |
|---|
| 2 | | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.
AAIM 2006: 231-242 |
| 1 | | Naoyuki Kamiyama,
Naoki Katoh,
Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity.
IEICE Transactions 89-D(8): 2372-2379 (2006) |
