Eiji Miyano

Yuichi Asahiro, Hiroshi Eto, Eiji Miyano: Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. IEICE Transactions 96-D(3): 443-449 (2013)

Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano: NP-hardness of the sorting buffer problem on the uniform metric. Discrete Applied Mathematics 160(10-11): 1453-1464 (2012)

Masao Kumamoto, Eiji Miyano: Optimal distortion embedding of complete binary trees into lines. Inf. Process. Lett. 112(10): 365-370 (2012)

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS 2012: 139-146

Hiroshi Eto, Fengrui Guo, Eiji Miyano: Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA 2012: 234-244

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discrete Applied Mathematics 159(7): 498-508 (2011)

Eiji Miyano: Foreword. IEICE Transactions 94-A(6): 1221 (2011)

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011)

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1): 78-96 (2011)

Eiji Miyano, Hirotaka Ono: Maximum Domination Problem. CATS 2011: 55-62

Yuichi Asahiro, Kenta Kanmera, Eiji Miyano: (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON 2011: 259-270

Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta: Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110(3): 93-98 (2010)

Masao Kumamoto, Eiji Miyano: Optimal Distortion Embedding of Complete Binary Trees into Lines. FCS 2010: 16-21

Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo: Approximating Maximum Diameter-Bounded Subgraphs. LATIN 2010: 615-626

Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka: Computational Complexities of University Interview Timetabling. IEICE Transactions 92-D(2): 130-140 (2009)

Kazuo Iwama, Eiji Miyano, Hirotaka Ono: Drawing Borders Efficiently. Theory Comput. Syst. 44(2): 230-244 (2009)

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa: Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. 42(3): 289-305 (2008)

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono: Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS 2008: 97-106

Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano: NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. FCS 2008: 137-143

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)

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

Kazuo Iwama, Eiji Miyano, Hirotaka Ono: Drawing Borders Efficiently. FUN 2007: 213-226

Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono: On Approximation of Bookmark Assignments. MFCS 2007: 115-124

Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta: Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175

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)

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20

Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano: How to Pack Directed Acyclic Graphs into Small Blocks. CIAC 2006: 272-283

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa: Pickup and Delivery for Moving Objects on Broken Lines. ICTCS 2005: 36-50

Kazuo Iwama, Eiji Miyano: A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. J. Algorithms 39(2): 145-161 (2001)

Kazuo Iwama, Eiji Miyano: An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41(2): 262-279 (2001)

Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano: New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. 5(5): 17-38 (2001)

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)

Kazuo Iwama, Eiji Miyano: Oblivious Routing Algorithms on the Mesh of Buses. J. Parallel Distrib. Comput. 60(2): 137-149 (2000)

Kazuo Iwama, Eiji Miyano: A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. SPAA 2000: 186-195

Kazuo Iwama, Eiji Miyano: Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA 1999: 53-64

Kazuo Iwama, Eiji Miyano: An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA 1999: 466-475

Kazuo Iwama, Eiji Miyano: Better Approximations of Non-Hamiltonian Graphs. Discrete Applied Mathematics 81(1-3): 239-261 (1998)

Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki: Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON 1998: 229-240

Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano: New Bounds for Oblivious Mesh Routing. ESA 1998: 295-306

Kazuo Iwama, Eiji Miyano: Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. ESA 1997: 284-295

Kazuo Iwama, Eiji Miyano: Oblivious Routing Algorithms on the Mesh of Buses. IPPS 1997: 721-727

Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi: Routing Problems on the Mesh of Buses. J. Algorithms 20(3): 613-631 (1996)

Kazuo Iwama, Eiji Miyano: Intractability of Read-Once Resolution. Structure in Complexity Theory Conference 1995: 29-36

Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano: Random Generation of Satisfiable and Unsatisfiable CNF Predicates. IFIP Congress (1) 1992: 322-328

Kazuo Iwama, Eiji Miyano: Routing Problems on the Mesh of Buses. ISAAC 1992: 155-164