Eiji Miyano

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 49

Top Venues

Theor. Comput. Sci.

Algorithmica

WALCOM

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

Publications

Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335 (1) (2024)
Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir
Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA (2024)
Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano
Approximation Algorithms for Covering Vertices by Long Paths. Algorithmica 86 (8) (2024)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353 (2024)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. FCT (2023)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. Algorithmica 85 (11) (2023)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975 (2023)
Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
Approximation Algorithms for the Longest Run Subsequence Problem. CPM (2023)
Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
Shortest Longest-Path Graph Orientations. COCOON (1) (2023)
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85 (11) (2023)
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
Independent Set Under a Change Constraint from an Initial Solution. CIAC (2023)
Mingyang Gong, Randy Goebel, Guohui Lin, Eiji Miyano
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. 44 (1) (2022)
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM (2022)
Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano
Approximation algorithms for covering vertices by long paths. CoRR (2022)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. WALCOM (2022)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900 (2022)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM (2022)
Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano
Approximation Algorithms for Covering Vertices by Long Paths. MFCS (2022)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304 (2021)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32 (2) (2021)
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882 (2021)
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita
How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. 288 (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866 (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Graph Classes and Approximability of the Happy Set Problem. COCOON (2020)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph orientation with splits. Theor. Comput. Sci. 844 (2020)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized Algorithms for the Happy Set Problem. WALCOM (2020)
Qiaojun Shu, Guohui Lin, Eiji Miyano
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. CoRR (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838 (2020)
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA (2019)
Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
Graph Orientation with Edge Modifications. FAW (2019)
Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems. Rev. Socionetwork Strateg. 13 (2) (2019)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. CoRR (2019)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM (2018)
Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita
Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. ICCSA (2) (2018)
Yuichi Asahiro, Yuya Doi, Eiji Miyano, Kazuaki Samizo, Hirotaka Shimizu
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. Algorithmica 80 (6) (2018)
Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80 (5) (2018)
Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano, Natsuki Nonoue
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. IEICE Trans. Inf. Syst. (3) (2018)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph Orientation with Splits. ISCO (2018)
Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. 734 (2018)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM (2017)
Yuichi Asahiro, Tomohiro Kubo, Eiji Miyano
Experimental Evaluation of Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. SCIS&ISIS (2016)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58 (1) (2016)
Daiki Hoshika, Eiji Miyano
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2016)
Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW (2016)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA (2016)
Yuichi Asahiro, Yuya Doi, Eiji Miyano, Hirotaka Shimizu
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems. COCOA (2015)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19 (1) (2015)
Daiki Hoshika, Eiji Miyano
Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes. AAIM (2014)
Eiji Miyano, Keisuke Tahara
Evolutionary algorithms for the pursuit problem. SCIS&ISIS (2014)
Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27 (1) (2014)
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550 (2014)
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT (2013)
Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
-Regular Induced Connected Subgraph Problems. IEICE Trans. Inf. Syst. (3) (2013)
Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation. J. Comb. Optim. 26 (4) (2013)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. WAOA (2013)
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161 (16-17) (2013)
Masao Kumamoto, Eiji Miyano
Optimal distortion embedding of complete binary trees into lines. Inf. Process. Lett. 112 (10) (2012)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO (2012)
Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
NP-hardness of the sorting buffer problem on the uniform metric. Discret. Appl. Math. 160 (10-11) (2012)
Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA (2012)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. CATS (2012)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discret. Appl. Math. 159 (7) (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) (2011)
Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON (2011)
Eiji Miyano, Hirotaka Ono
Maximum Domination Problem. CATS (2011)
Eiji Miyano
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2011)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22 (3) (2011)
Masao Kumamoto, Eiji Miyano
Optimal Distortion Embedding of Complete Binary Trees into Lines. FCS (2010)
Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo
Approximating Maximum Diameter-Bounded Subgraphs. LATIN (2010)
Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110 (3) (2010)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph orientation to maximize the minimum weighted outdegree. IPDPS (2009)
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
Drawing Borders Efficiently. Theory Comput. Syst. 44 (2) (2009)
Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka
Computational Complexities of University Interview Timetabling. IEICE Trans. Inf. Syst. (2) (2009)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS (2008)
Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
Grasp and Delivery for Moving Objects on Broken Lines. Theory Comput. Syst. 42 (3) (2008)
Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. FCS (2008)
Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
On Approximation of Bookmark Assignments. MFCS (2007)
Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) (2007)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. AAIM (2007)
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
Drawing Borders Efficiently. FUN (2007)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. 18 (2) (2007)
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
How to Pack Directed Acyclic Graphs into Small Blocks. CIAC (2006)
Takahiro Yukizane, Shin-ya Ohi, Eiji Miyano, Hideo Hirose
The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics. IEICE Trans. Inf. Syst. (8) (2006)
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS (2006)
Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
Pickup and Delivery for Moving Objects on Broken Lines. ICTCS (2005)
Kazuo Iwama, Eiji Miyano
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. J. Algorithms 39 (2) (2001)
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. 5 (5) (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) (2001)
Kazuo Iwama, Eiji Miyano
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41 (2) (2001)
Kazuo Iwama, Eiji Miyano
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. SPAA (2000)
Kazuo Iwama, Eiji Miyano
Oblivious Routing Algorithms on the Mesh of Buses. J. Parallel Distributed Comput. 60 (2) (2000)
Kazuo Iwama, Eiji Miyano
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA (1999)
Kazuo Iwama, Eiji Miyano
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA (1999)
Kazuo Iwama, Eiji Miyano
Better Approximations of Non-Hamiltonian Graphs. Discret. Appl. Math. 81 (1-3) (1998)
Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON (1998)
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
New Bounds for Oblivious Mesh Routing. ESA (1998)

Eiji Miyano.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eiji Miyano