dblp.uni-trier.dewww.uni-trier.de

Eiji Miyano

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
29EEYuichi 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
27EEYuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa: Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. 42(3): 289-305 (2008)
2007
26EEYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM 2007: 167-177
25EEKazuo Iwama, Eiji Miyano, Hirotaka Ono: Drawing Borders Efficiently. FUN 2007: 213-226
24EEYuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono: On Approximation of Bookmark Assignments. MFCS 2007: 115-124
23EEYuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta: Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175
22EEYuichi 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
21EEYuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20
20EEYuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano: How to Pack Directed Acyclic Graphs into Small Blocks. CIAC 2006: 272-283
19EETakahiro 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
18EEYuichi 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)
16EEKazuo Iwama, Eiji Miyano: An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41(2): 262-279 (2001)
15EEKazuo Iwama, Yahiko Kambayashi, Eiji Miyano: New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. 5(5): 17-38 (2001)
14EEKazuo 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
13EEKazuo 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
11EEKazuo Iwama, Eiji Miyano: Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA 1999: 53-64
10EEKazuo Iwama, Eiji Miyano: An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA 1999: 466-475
1998
9EEKazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki: Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON 1998: 229-240
8EEKazuo Iwama, Yahiko Kambayashi, Eiji Miyano: New Bounds for Oblivious Mesh Routing. ESA 1998: 295-306
7EEKazuo 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
5EEKazuo 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

Coauthor Index

1Hidetoshi Abeta [2]
2Yuichi Asahiro [18] [20] [21] [22] [23] [24] [26] [27] [28] [29]
3Tetsuya Furukawa [20]
4Hideo Hirose [19]
5Keiichi Ikegami [20]
6Kazuo Iwama [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [25]
7Jesper Jansson [26]
8Yahiko Kambayashi [4] [8] [15]
9Kenichi Kawahara [28]
10Shuichi Miyazaki [23]
11Toshihide Murata [24]
12Shin-ya Ohi [19]
13Hirotaka Ono [21] [22] [24] [25] [26] [29]
14Shinichi Shimoirisa [18] [27]
15Satoshi Tajima [9] [14]
16Hisao Tamaki [9] [14]
17Takuro Yoshimuta [23]
18Takahiro Yukizane [19]
19Kouhei Zenmyo [21] [22] [26]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)