PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Miyano, Eiji"

Author of the publication

copydeleteadd this publication to your clipboard
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree.

, , and . Discrete Applied Mathematics, 159 (7): 498-508 (2011)

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.

No persons found for author name Miyano, Eiji
add a person with the name Miyano, Eiji
 

Other publications of authors with the same name

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty., , , and . CATS, volume 128 of CRPIT, page 139-146. Australian Computer Society, (2012)Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses., , , and . COCOON, volume 1449 of Lecture Notes in Computer Science, page 229-240. Springer, (1998)Routing Problems on the Mesh of Buses., and . ISAAC, volume 650 of Lecture Notes in Computer Science, page 155-164. Springer, (1992)Graph Orientation with Splits., , , , and . ISCO, volume 10856 of Lecture Notes in Computer Science, page 52-63. Springer, (2018)NP-Hardness of the Sorting Buffer Problem on the Uniform Metric., , and . FCS, page 137-143. CSREA Press, (2008)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)Intractability of Read-Once Resolution., and . Computational Complexity Conference, page 29-36. IEEE Computer Society, (1995)The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics., , , and . IEICE Transactions, 89-D (8): 2332-2339 (2006)Graph Orientations Optimizing the Number of Light or Heavy Vertices., , , and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 332-343. Springer, (2012)