| Random generation of test instances with controlled attributes Y Asahiro, K Iwama, E Miyano Cliques, Coloring, and Satisfiability, 377-393, 1996 | 110 | 1996 |
| Intriactability of Read-Once Resolution K Iwama, E Miyano Structure in Complexity Theory Conference, Annual, 29-29, 1995 | 79 | 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 | 63 | 2007 |
| Distance-independent set problems for bipartite and chordal graphs H Eto, F Guo, E Miyano Journal of Combinatorial Optimization 27 (1), 88-99, 2014 | 49 | 2014 |
| Approximating maximum diameter-bounded subgraphs Y Asahiro, E Miyano, K Samizo Latin American Symposium on Theoretical Informatics, 615-626, 2010 | 48 | 2010 |
| 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 | 39 | 2011 |
| 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 | 38 | 2011 |
| 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 | 32 | 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, 1412-1438, 2018 | 29 | 2018 |
| Optimal approximation algorithms for maximum distance-bounded subgraph problems Y Asahiro, Y Doi, E Miyano, K Samizo, H Shimizu Algorithmica 80, 1834-1856, 2018 | 24 | 2018 |
| Routing problems on the mesh of buses K Iwama, E Miyano, Y Kambayashi Journal of Algorithms 20 (3), 613-631, 1996 | 23 | 1996 |
| 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 | 18 | 2016 |
| Complexity of finding maximum regular induced subgraphs with prescribed degree Y Asahiro, H Eto, T Ito, E Miyano Theoretical Computer Science 550, 21-35, 2014 | 18 | 2014 |
| Degree-constrained graph orientation: Maximum satisfaction and minimum violation Y Asahiro, J Jansson, E Miyano, H Ono Theory of Computing Systems 58, 60-93, 2016 | 17 | 2016 |
| 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 | 17 | 2010 |
| Grasp and delivery for moving objects on broken lines Y Asahiro, E Miyano, S Shimoirisa Theory of Computing Systems 42 (3), 289-305, 2008 | 17 | 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 | 17 | 2006 |
| Approximation algorithm for the distance-3 independent set problem on cubic graphs H Eto, T Ito, Z Liu, E Miyano International Workshop on Algorithms and Computation, 228-240, 2017 | 16 | 2017 |
| Maximum domination problem E Miyano, H Ono Proceedings of the Seventeenth Computing on The Australasian Theory …, 2011 | 16 | 2011 |
| Upper and lower degree bounded graph orientation with minimum penalty Y Asahiro, J Jansson, E Miyano, H Ono CRPIT 128, 2011 | 15 | 2011 |
Hirotaka OnoNagoya University, JapanZweryfikowany adres z i.nagoya-u.ac.jp