| 2007 |
|---|
| 11 | EE | Daisuke Maeda,
Hideyuki Uehara,
Mitsuo Yokoyama:
Efficient Clustering Scheme Considering Non-uniform Correlation Distribution for Ubiquitous Sensor Networks.
IEICE Transactions 90-A(7): 1344-1352 (2007) |
| 2005 |
|---|
| 10 | EE | Kilsoo Jeong,
Mitsuo Yokoyama,
Hideyuki Uehara:
Performance Improvement of MAI Cancellation in Fading DS/CDMA Channels.
IEICE Transactions 88-A(10): 2869-2877 (2005) |
| 9 | EE | Yoshikazu Yamaguchi,
Shinji Yamashita,
Mitsuo Yokoyama,
Hideyuki Uehara:
Performance of a New DS-CDMA Synchronization System Using Cycle-and-Add Property.
IEICE Transactions 88-A(10): 2905-2914 (2005) |
| 8 | EE | Md. Ifte Khairul Hasan,
Saburo Takahashi,
Jun-ichi Hakoda,
Hideyuki Uehara,
Mitsuo Yokoyama:
Route Selection Metrics in Wireless Mobile Ad Hoc Networks.
IEICE Transactions 88-A(10): 2952-2955 (2005) |
| 2002 |
|---|
| 7 | EE | Hiro Ito,
Motoyasu Ito,
Yuichiro Itatsu,
Kazuhiro Nakai,
Hideyuki Uehara,
Mitsuo Yokoyama:
Source location problems considering vertex-connectivity and edge-connectivity simultaneously.
Networks 40(2): 63-70 (2002) |
| 2000 |
|---|
| 6 | EE | Hiro Ito,
Yuichiro Itatsu,
Hideyuki Uehara,
Mitsuo Yokoyama,
Motoyasu Ito:
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets.
ISAAC 2000: 338-349 |
| 5 | EE | Hiro Ito,
Hideyuki Uehara,
Mitsuo Yokoyama:
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon.
JCDCG 2000: 160-166 |
| 1998 |
|---|
| 4 | | Hiro Ito,
Hideyuki Uehara,
Mitsuo Yokoyama:
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces.
JCDCG 1998: 129-157 |
| 3 | | Hiro Ito,
Hideyuki Uehara,
Mitsuo Yokoyama:
NP-Completeness of Stage Illumination Problems.
JCDCG 1998: 158-165 |
| 2 | EE | Hiro Ito,
Mitsuo Yokoyama:
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs.
Inf. Process. Lett. 66(4): 209-213 (1998) |
| 1 | EE | Hiro Ito,
Mitsuo Yokoyama:
Edge connectivity between nodes and node-subsets.
Networks 31(3): 157-163 (1998) |
