Eiji Miyano

According to our database, Eiji Miyano authored at least 86 papers between 1992 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Approximability of Longest Run Subsequence and Complementary Minimization Problems.

Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

Shortest Longest-Path Graph Orientations for Trees.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Covering Vertices by 4⁺-Paths: A Simpler Local Search Coupled with a More Delicate Amortization.

Mingyang Gong, Guangting Chen, Guohui Lin, Eiji Miyano, Abbinash Ranjitkar

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

On the Complexity of Locally Rainbow Path.

Hiroshi Eto, Tesshu Hanaka, Eiji Miyano, Shuya Yoshida

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs.

Yuichi Asahiro, Hiroshi Eto, Guohui Lin, Eiji Miyano, Yudai Oka

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Approximation Algorithms for Covering Vertices by Long Paths.

Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano

Algorithmica, August, 2024

A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops.

Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong

Ann. Oper. Res., April, 2024

Directed Path Partition Problem on Directed Acyclic Graphs.

Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., October, 2023

On Computing a Center Persistence Diagram.

Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Approximation Algorithms for the Longest Run Subsequence Problem.

Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Shortest Longest-Path Graph Orientations.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Independent Set Under a Change Constraint from an Initial Solution.

Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Upper and lower degree-constrained graph orientation with minimum penalty.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Theor. Comput. Sci., 2022

Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing.

Mingyang Gong, Randy Goebel, Guohui Lin, Eiji Miyano

J. Comb. Optim., 2022

Path Cover Problems with Length Cost.

Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita

Proceedings of the WALCOM: Algorithms and Computation, 2022

Happy Set Problem on Subclasses of Co-comparability Graphs.

Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura

Proceedings of the WALCOM: Algorithms and Computation, 2022

Approximation Algorithms for Covering Vertices by Long Paths.

Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Complexity and approximability of the happy set problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Theor. Comput. Sci., 2021

Graph Orientation with Edge Modifications.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Int. J. Found. Comput. Sci., 2021

How to pack directed acyclic graphs into small blocks.

Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita

Discret. Appl. Math., 2021

2020

Exact algorithms for the repetition-bounded longest common subsequence problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Theor. Comput. Sci., 2020

Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

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

Qiaojun Shu, Guohui Lin, Eiji Miyano

CoRR, 2020

Parameterized Algorithms for the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles.

Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang

Proceedings of the Theory and Applications of Models of Computation, 2020

Graph Classes and Approximability of the Happy Set Problem.

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

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

Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano

Rev. Socionetwork Strateg., 2019

An Approximation Algorithm for the Maximum Induced Matching Problem on <i>C</i>₅-Free Regular Graphs.

Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Graph Orientation with Edge Modifications.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops.

Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin

Theor. Comput. Sci., 2018

Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes.

Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue

IEICE Trans. Inf. Syst., 2018

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.

Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano

Algorithmica, 2018

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu

Algorithmica, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Graph Orientation with Splits.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks.

Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita

Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs.

Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

Proceedings of the WALCOM: Algorithms and Computation, 2017

2016

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

Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano

Proceedings of the 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 17th International Symposium on Advanced Intelligent Systems (ISIS), 2016

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

Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

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

Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems.

Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Evolutionary algorithms for the pursuit problem.

Eiji Miyano, Keisuke Tahara

Proceedings of the 2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS), 2014

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

Daiki Hoshika, Eiji Miyano

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems.

Yuichi Asahiro, Hiroshi Eto, Eiji Miyano

IEICE Trans. Inf. Syst., 2013

Optimal approximability of bookmark assignments.

Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono

Discret. Appl. Math., 2013

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.

Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Graph Orientations Optimizing the Number of Light or Heavy Vertices.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Distance-d Independent Set Problems for Bipartite and Chordal Graphs.

Hiroshi Eto, Fengrui Guo, Eiji Miyano

Proceedings of the Combinatorial Optimization and Applications, 2012

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Foreword.

Eiji Miyano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

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

Yuichi Asahiro, Kenta Kanmera, Eiji Miyano

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Maximum Domination Problem.

Eiji Miyano, Hirotaka Ono

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Approximating Maximum Diameter-Bounded Subgraphs.

Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Optimal Distortion Embedding of Complete Binary Trees into Lines.

Masao Kumamoto, Eiji Miyano

Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

2009

Computational Complexities of University Interview Timetabling.

Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka

IEICE Trans. Inf. Syst., 2009

Graph orientation to maximize the minimum weighted outdegree.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

Grasp and Delivery for Moving Objects on Broken Lines.

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa

Theory Comput. Syst., 2008

NP-Hardness of the Sorting Buffer Problem on the Uniform Metric.

Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano

Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007

Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.

Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

On Approximation of Bookmark Assignments.

Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Drawing Borders Efficiently.

Kazuo Iwama, Eiji Miyano, Hirotaka Ono

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

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

Takahiro Yukizane, Shin-ya Ohi, Eiji Miyano, Hideo Hirose

IEICE Trans. Inf. Syst., 2006

How to Pack Directed Acyclic Graphs into Small Blocks.

Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Graph Orientation Algorithms to Minimize the Maximum Outdegree.

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Proceedings of the Theory of Computing 2006, 2006

2005

Pickup and Delivery for Moving Objects on Broken Lines.

Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2001

An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.

Kazuo Iwama, Eiji Miyano

J. Algorithms, 2001

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

Kazuo Iwama, Eiji Miyano

J. Algorithms, 2001

2000

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

Kazuo Iwama, Eiji Miyano

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999

An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.

Kazuo Iwama, Eiji Miyano

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

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

Kazuo Iwama, Eiji Miyano

Proceedings of the Algorithms, 1999

1998

Better Approximations of Non-Hamiltonian Graphs.

Kazuo Iwama, Eiji Miyano

Discret. Appl. Math., 1998

New Bounds for Oblivious Mesh Routing.

Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano

Proceedings of the Algorithms, 1998

Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.

Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Oblivious Routing Algorithms on the Mesh of Buses.

Kazuo Iwama, Eiji Miyano

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

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

Kazuo Iwama, Eiji Miyano

Proceedings of the Algorithms, 1997

1996

Routing Problems on the Mesh of Buses.

Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi

J. Algorithms, 1996

1995

Intractability of Read-Once Resolution.

Kazuo Iwama, Eiji Miyano

Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1993

Random generation of test instances with controlled attributes.

Yuichi Asahiro, Kazuo Iwama, Eiji Miyano

Proceedings of the Cliques, 1993

1992

Routing Problems on the Mesh of Buses.

Kazuo Iwama, Eiji Miyano

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Random Generation of Satisfiable and Unsatisfiable CNF Predicates.

Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano

Proceedings of the Algorithms, Software, Architecture, 1992