( en | de | ru )

 

Disambiguation of "Miyano, Eiji"

Author of the publication

copydeleteadd this publication to your clipboard
How to pack directed acyclic graphs into small blocks.

, , , , and . Discret. Appl. Math., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Eiji Hisamatsu

Eiji Habuto

Eiji Takahashi

Eiji Kudo

Eiji Kouno

 

Other publications of authors with the same name

Experimental Evaluation of Approximation and Heuristic Algorithms for Maximum Distance-Bounded Subgraph Problems., , and . Rev. Socionetwork Strateg., 13 (2): 143-161 (2019)NP-Hardness of the Sorting Buffer Problem on the Uniform Metric., , and . FCS, page 137-143. CSREA Press, (2008)Corrigendum to "Complexity and approximability of the happy set problem" Theor. Comput. Sci. 866 (2021) 123-144., , , , , and . Theor. Comput. Sci., (October 2023)Graph orientation with splits., , , , and . Theor. Comput. Sci., (2020)Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems., , , , and . Algorithmica, 80 (6): 1834-1856 (2018)Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems., , , , , and . Algorithmica, 80 (5): 1412-1438 (2018)A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes., and . J. Algorithms, 39 (2): 145-161 (2001)Graph Orientation Algorithms to minimize the Maximum Outdegree., , , and . Int. J. Found. Comput. Sci., 18 (2): 197-215 (2007)Path Cover Problems with Length Cost., , , , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 396-408. Springer, (2022)Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty., , , and . CATS, volume 128 of CRPIT, page 139-146. Australian Computer Society, (2012)