Random generation of test instances with controlled attributes Y Asahiro, K Iwama, E Miyano DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26 (1 …, 1996 | 98 | 1996 |

Intriactability of Read-Once Resolution K Iwama, E Miyano Structure in Complexity Theory Conference, Annual, 29-29, 1995 | 55 | 1995 |

Graph orientation algorithms to minimize the maximum outdegree Y Asahiro, E Miyano, H Ono, K Zenmyo International Journal of Foundations of Computer Science 18 (02), 197-215, 2007 | 52 | 2007 |

Approximating maximum diameter-bounded subgraphs Y Asahiro, E Miyano, K Samizo Latin American Symposium on Theoretical Informatics, 615-626, 2010 | 45 | 2010 |

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree Y Asahiro, E Miyano, H Ono Discrete applied mathematics 159 (7), 498-508, 2011 | 37 | 2011 |

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree Y Asahiro, J Jansson, E Miyano, H Ono, K Zenmyo Journal of combinatorial optimization 22 (1), 78-96, 2011 | 32 | 2011 |

Distance- independent set problems for bipartite and chordal graphs H Eto, F Guo, E Miyano Journal of Combinatorial Optimization 27 (1), 88-99, 2014 | 25 | 2014 |

NP-hardness of the sorting buffer problem on the uniform metric Y Asahiro, K Kawahara, E Miyano Discrete Applied Mathematics 160 (10-11), 1453-1464, 2012 | 25 | 2012 |

Improved approximation algorithms for the maximum happy vertices and edges problems P Zhang, Y Xu, T Jiang, A Li, G Lin, E Miyano Algorithmica 80 (5), 1412-1438, 2018 | 24 | 2018 |

The role of service abstraction and service variability and its impact on requirements engineering for service-oriented systems S Adam, J Doerr 2008 32nd Annual IEEE International Computer Software and Applications …, 2008 | 18 | 2008 |

Optimal approximation algorithms for maximum distance-bounded subgraph problems Y Asahiro, Y Doi, E Miyano, K Samizo, H Shimizu Algorithmica 80 (6), 1834-1856, 2018 | 16 | 2018 |

New bounds for oblivious mesh routing K Iwama, Y Kambayashi, E Miyano Graph Algorithms And Applications 2, 433-454, 2004 | 16 | 2004 |

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. Y Asahiro, J Jansson, E Miyano, H Ono CATS 12, 139-145, 2012 | 15 | 2012 |

Grasp and delivery for moving objects on broken lines Y Asahiro, E Miyano, S Shimoirisa Theory of Computing Systems 42 (3), 289-305, 2008 | 15 | 2008 |

The bump hunting method using the genetic algorithm with the extreme-value statistics T Yukizane, S Ohi, E Miyano, H Hirose IEICE transactions on information and systems 89 (8), 2332-2339, 2006 | 15 | 2006 |

Weighted nearest neighbor algorithms for the graph exploration problem on cycles Y Asahiro, E Miyano, S Miyazaki, T Yoshimuta Information Processing Letters 110 (3), 93-98, 2010 | 14 | 2010 |

Approximability of the distance independent set problem on regular graphs and planar graphs H Eto, T Ito, Z Liu, E Miyano International Conference on Combinatorial Optimization and Applications, 270-284, 2016 | 13 | 2016 |

Degree-constrained graph orientation: Maximum satisfaction and minimum violation Y Asahiro, J Jansson, E Miyano, H Ono Theory of Computing Systems 58 (1), 60-93, 2016 | 13 | 2016 |

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree Y Asahiro, J Jansson, E Miyano, H Ono, K Zenmyo International Conference on Algorithmic Applications in Management, 167-177, 2007 | 13 | 2007 |

Graph orientation to maximize the minimum weighted outdegree Y Asahiro, J Jansson, E Miyano, H Ono 2009 IEEE International Symposium on Parallel & Distributed Processing, 1-8, 2009 | 12 | 2009 |