Eiji Miyano

发表

Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing

Kazuo Iwama, Eiji Miyano, K. Iwama, 1999, ESA.

Collect Tours for Moving Objects with Release Times and Deadlines

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa, 2005 .

Optimal approximability of bookmark assignments

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2013, Discret. Appl. Math..

A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.

Eiji Miyano, Kazuo Iwama, 2000, SPAA 2000.

Evolutionary algorithms for the pursuit problem

Eiji Miyano, Keisuke Tahara, Eiji Miyano, 2014, 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS).

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs

Takehiro Ito, Eiji Miyano, Hiroshi Eto, 2016, COCOA.

Graph Orientation Algorithms to minimize the Maximum Outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2006, Int. J. Found. Comput. Sci..

Optimal distortion embedding of complete binary trees into lines

Eiji Miyano, Masao Kumamoto, 2012, Inf. Process. Lett..

Intractability of read-once resolution

Kazuo Iwama, Eiji Miyano, K. Iwama, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

How to Pack Directed Acyclic Graphs into Small Blocks

Tetsuya Furukawa, Yuichi Asahiro, Eiji Miyano, 2006, CIAC.

Fast Oblivious Routing Algorithms on Meshes

Eiji Miyano, Kazuo Iwama, 2000 .

Oblivious Routing Algorithms on the Mesh of Buses

Kazuo Iwama, Eiji Miyano, 2000, J. Parallel Distributed Comput..

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes

Eiji Miyano, Hiroshi Eto, Hiroyuki Kawahara, 2018, IEICE Trans. Inf. Syst..

Random generation of test instances with controlled attributes

Yuichi Asahiro, Kazuo Iwama, Eiji Miyano, 1993, Cliques, Coloring, and Satisfiability.

An O( N ) oblivious routing algorithm for 2-D meshes of constant queue-size

Kazuo Iwama, Eiji Miyano, 1999, SODA '99.

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2013, WAOA.

A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes

Kazuo Iwama, Eiji Miyano, 2001, J. Algorithms.

Better Approximations of Non-Hamiltonian Graphs

Kazuo Iwama, Eiji Miyano, 1998, Discret. Appl. Math..

Graph Orientations Optimizing the Number of Light or Heavy Vertices

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2012, ISCO.

Complexity of the Maximum k-Path Vertex Cover Problem

Toshiki Saitoh, Ryuhei Uehara, Eiji Miyano, 2020, WALCOM.

Collecting Moving Objects

Masafumi Yamashita, Yuichi Asahiro, Hirotaka Ono, 2007 .

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2007, AAIM.

(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation

Yuichi Asahiro, Eiji Miyano, Kenta Kanmera, 2013, J. Comb. Optim..

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2011, CATS.

Graph orientation to maximize the minimum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2009, IPDPS.

Maximum Domination Problem

Hirotaka Ono, Eiji Miyano, 2011, CATS.

A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan

Randy Goebel, Guohui Lin, Eiji Miyano, 2016, FAW.

10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'08

Arnold L. Rosenberg, Oscar H. Ibarra, Albert Y. Zomaya, 2008, IPDPS.

Oblivious routing algorithms on the mesh of buses

Kazuo Iwama, Eiji Miyano, 1997, Proceedings 11th International Parallel Processing Symposium.

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems

Yuichi Asahiro, Eiji Miyano, Hirotaka Shimizu, 2015, COCOA.

Efficient randomized routing algorithms on the two-dimensional mesh of buses

Hisao Tamaki, Kazuo Iwama, Eiji Miyano, 2001, Theor. Comput. Sci..

Pickup and Delivery for Moving Objects on Broken Lines

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa, 2005, ICTCS.

NP-hardness of the sorting buffer problem on the uniform metric

Yuichi Asahiro, Eiji Miyano, Kenichi Kawahara, 2008, Discret. Appl. Math..

Graph Orientations Optimizing the Number of Light or Heavy Vertices

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2012, J. Graph Algorithms Appl..

Graph Orientation with Splits

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2018, ISCO.

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2008, Discret. Appl. Math..

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem

Guohui Lin, Yuichi Asahiro, Hirotaka Ono, 2019, COCOA.

Distance-$$d$$ independent set problems for bipartite and chordal graphs

Eiji Miyano, Hiroshi Eto, Fengrui Guo, 2012, J. Comb. Optim..

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems

Yuichi Asahiro, Eiji Miyano, Hirotaka Shimizu, 2017, Algorithmica.

Approximating Maximum Diameter-Bounded Subgraphs

Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo, 2010, LATIN.

Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes

Eiji Miyano, Daiki Hoshika, 2014, AAIM.

On Computing a Center Persistence Diagram pdf

Binhai Zhu, Guohui Lin, Eiji Miyano, 2019, ArXiv.

Graph orientation with splits

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, 2020, Theor. Comput. Sci..

Parameterized Algorithms for the Happy Set Problem

Guohui Lin, Yuichi Asahiro, Eiji Miyano, 2020, WALCOM.

Graph Classes and Approximability of the Happy Set Problem

Guohui Lin, Yuichi Asahiro, Eiji Miyano, 2020, COCOON.

New Bounds for Oblivious Mesh Routing

Yahiko Kambayashi, Kazuo Iwama, Eiji Miyano, 1998, ESA.

Grasp and Delivery for Moving Objects on Broken Lines

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa, 2007, Theory of Computing Systems.

The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics

Hideo Hirose, Eiji Miyano, Takahiro Yukizane, 2006, IEICE Trans. Inf. Syst..

Graph orientation to maximize the minimum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

Recent developments in mesh routing algorithms

Eiji Miyano, Kazuo Iwama, 2000 .

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

Guohui Lin, Eiji Miyano, Qiaojun Shu, 2020, TAMC.

Drawing Borders Efficiently

Hirotaka Ono, Kazuo Iwama, Eiji Miyano, 2007, FUN.

Weighted nearest neighbor algorithms for the graph exploration problem on cycles

Yuichi Asahiro, Shuichi Miyazaki, Eiji Miyano, 2007, Inf. Process. Lett..

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2014, Theory of Computing Systems.

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2011, J. Comb. Optim..

Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems

Yuichi Asahiro, Eiji Miyano, Tomohiro Kubo, 2019, Rev. Socionetwork Strateg..

Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems

Yuichi Asahiro, Eiji Miyano, Hiroshi Eto, 2013, IEICE Trans. Inf. Syst..

Computational Complexity Issues in University Interview Timetabling

Shuichi Miyazaki, Eiji Miyano, Yuuki Kiyonari, 2006 .

An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs

Guohui Lin, Yuichi Asahiro, Eiji Miyano, 2019, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Exact algorithms for the repetition-bounded longest common subsequence problem

Guohui Lin, Yuichi Asahiro, Eiji Miyano, 2020, Theor. Comput. Sci..

Advances in parallel and distributed computing models - APDCM

Lali Barrière, Henri Casanova, Paola Flocchini, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

Oblivious Routing on the Three Dimensional Mesh Computers

Eiji Miyano, Kazuo Iwama, 1997 .

Fundamentals of Computation Theory

Takehiro Ito, Yuichi Asahiro, Eiji Miyano, 2013, Lecture Notes in Computer Science.

Weighted nearest neighbor algorithms for the graph exploration problem on cycles

Yuichi Asahiro, Shuichi Miyazaki, Eiji Miyano, 2010, Inf. Process. Lett..

Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing

Kazuo Iwama, Eiji Miyano, 1997, ESA.

A (2.954 + ε)n oblivious routing algorithm on 2D meshes

Kazuo Iwama, Eiji Miyano, 2000, SPAA '00.

Routing Problems on the Mesh of Buses

Kazuo Iwama, Eiji Miyano, 1992, ISAAC.

Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems

Yuichi Asahiro, Eiji Miyano, Tomohiro Kubo, 2016, 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS).

How to pack directed acyclic graphs into small blocks

Tetsuya Furukawa, Yuichi Asahiro, Eiji Miyano, 2021, Discret. Appl. Math..

Graph Orientation with Edge Modifications

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2019, FAW.

(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation

Yuichi Asahiro, Eiji Miyano, Kenta Kanmera, 2011, COCOON.

Computational Complexities of University Interview Timetabling

Naoyuki Kamiyama, Shuichi Miyazaki, Eiji Miyano, 2009, IEICE Trans. Inf. Syst..

Complexity of finding maximum regular induced subgraphs with prescribed degree

Takehiro Ito, Yuichi Asahiro, Eiji Miyano, 2014, Theor. Comput. Sci..

Towards an Optimal Oblivious Routing Algorithm on 2D Meshes (Algorithm Engineering as a New Paradigm)

Eiji Miyano, Kazuo Iwama, 2001 .