Eiji Miyano

Professor

Kyushu Institute of Technology

Japan

Research Interests

Explore related searches

Professors in Japan

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

About

Professor Eiji Miyano is a faculty member at Kyushu Institute of Technology in Japan. His research focuses on algorithmic complexity and graph theory, with recent publications addressing topics such as longest common subsequence variants, multiprocessor scheduling, and graph orientation problems. His work also explores approximation algorithms and complexity issues related to various computational problems.

Articles (11)

Year:

2024

Year:

2023

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Year:

2020

Collaborators (2)

Jesper Jansson

Kyoto University

JAPAN

View details

Hirotaka Ono

Professor

Nagoya University

JAPAN

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Eiji Miyano

Research Interests

Explore related searches

Contact this professor

About

Articles (11)

Polynomial-time equivalences and refined algorithms for longest common subsequence variants

Path Cover Problems with Length Cost

Upper and lower degree-constrained graph orientation with minimum penalty

Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing

Graph Orientation with Edge Modifications

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

Complexity and approximability of the happy set problem

How to pack directed acyclic graphs into small blocks

Parameterized algorithms for the Happy Set problem

Exact algorithms for the repetition-bounded longest common subsequence problem

Complexity of the maximum k-path vertex cover problem

Collaborators (2)

Jesper Jansson

Hirotaka Ono

Make your next move.