2008 |
29 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.
CATS 2008: 97-106 |
28 | | Yuichi Asahiro,
Kenichi Kawahara,
Eiji Miyano:
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric.
FCS 2008: 137-143 |
27 | EE | Yuichi Asahiro,
Eiji Miyano,
Shinichi Shimoirisa:
Grasp and Delivery for Moving Objects on Broken Lines.
Theory Comput. Syst. 42(3): 289-305 (2008) |
2007 |
26 | EE | Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.
AAIM 2007: 167-177 |
25 | EE | Kazuo Iwama,
Eiji Miyano,
Hirotaka Ono:
Drawing Borders Efficiently.
FUN 2007: 213-226 |
24 | EE | Yuichi Asahiro,
Eiji Miyano,
Toshihide Murata,
Hirotaka Ono:
On Approximation of Bookmark Assignments.
MFCS 2007: 115-124 |
23 | EE | Yuichi Asahiro,
Eiji Miyano,
Shuichi Miyazaki,
Takuro Yoshimuta:
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.
SOFSEM (1) 2007: 164-175 |
22 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Graph Orientation Algorithms to minimize the Maximum Outdegree.
Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) |
2006 |
21 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree.
CATS 2006: 11-20 |
20 | EE | Yuichi Asahiro,
Tetsuya Furukawa,
Keiichi Ikegami,
Eiji Miyano:
How to Pack Directed Acyclic Graphs into Small Blocks.
CIAC 2006: 272-283 |
19 | EE | Takahiro Yukizane,
Shin-ya Ohi,
Eiji Miyano,
Hideo Hirose:
The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics.
IEICE Transactions 89-D(8): 2332-2339 (2006) |
2005 |
18 | EE | Yuichi Asahiro,
Eiji Miyano,
Shinichi Shimoirisa:
Pickup and Delivery for Moving Objects on Broken Lines.
ICTCS 2005: 36-50 |
2001 |
17 | | Kazuo Iwama,
Eiji Miyano:
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.
J. Algorithms 39(2): 145-161 (2001) |
16 | EE | Kazuo Iwama,
Eiji Miyano:
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.
J. Algorithms 41(2): 262-279 (2001) |
15 | EE | Kazuo Iwama,
Yahiko Kambayashi,
Eiji Miyano:
New Bounds for Oblivious Mesh Routing.
J. Graph Algorithms Appl. 5(5): 17-38 (2001) |
14 | EE | Kazuo Iwama,
Eiji Miyano,
Satoshi Tajima,
Hisao Tamaki:
Efficient randomized routing algorithms on the two-dimensional mesh of buses.
Theor. Comput. Sci. 261(2): 227-239 (2001) |
2000 |
13 | EE | Kazuo Iwama,
Eiji Miyano:
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.
SPAA 2000: 186-195 |
12 | | Kazuo Iwama,
Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses.
J. Parallel Distrib. Comput. 60(2): 137-149 (2000) |
1999 |
11 | EE | Kazuo Iwama,
Eiji Miyano:
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.
ESA 1999: 53-64 |
10 | EE | Kazuo Iwama,
Eiji Miyano:
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
SODA 1999: 466-475 |
1998 |
9 | EE | Kazuo Iwama,
Eiji Miyano,
Satoshi Tajima,
Hisao Tamaki:
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.
COCOON 1998: 229-240 |
8 | EE | Kazuo Iwama,
Yahiko Kambayashi,
Eiji Miyano:
New Bounds for Oblivious Mesh Routing.
ESA 1998: 295-306 |
7 | EE | Kazuo Iwama,
Eiji Miyano:
Better Approximations of Non-Hamiltonian Graphs.
Discrete Applied Mathematics 81(1-3): 239-261 (1998) |
1997 |
6 | | Kazuo Iwama,
Eiji Miyano:
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing.
ESA 1997: 284-295 |
5 | EE | Kazuo Iwama,
Eiji Miyano:
Oblivious Routing Algorithms on the Mesh of Buses.
IPPS 1997: 721-727 |
1996 |
4 | | Kazuo Iwama,
Eiji Miyano,
Yahiko Kambayashi:
Routing Problems on the Mesh of Buses.
J. Algorithms 20(3): 613-631 (1996) |
1995 |
3 | | Kazuo Iwama,
Eiji Miyano:
Intractability of Read-Once Resolution.
Structure in Complexity Theory Conference 1995: 29-36 |
1992 |
2 | | Kazuo Iwama,
Hidetoshi Abeta,
Eiji Miyano:
Random Generation of Satisfiable and Unsatisfiable CNF Predicates.
IFIP Congress (1) 1992: 322-328 |
1 | | Kazuo Iwama,
Eiji Miyano:
Routing Problems on the Mesh of Buses.
ISAAC 1992: 155-164 |