Resource allocation problems: algorithmic approaches T Ibaraki, N Katoh MIT press, 1988 | 1012 | 1988 |

Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering M Inaba, N Katoh, H Imai Proceedings of the tenth annual symposium on Computational geometry, 332-339, 1994 | 579 | 1994 |

An efficient algorithm for k shortest simple paths N Katoh, T Ibaraki, H Mine Networks 12 (4), 411-427, 1982 | 351 | 1982 |

Fining k points with minimum spanning trees and related problems A Aggarwal, H Imai, N Katoh, S Suri Proceedings of the fifth annual symposium on Computational geometry, 283-291, 1989 | 201* | 1989 |

Resource allocation problems N Katoh, A Shioura, T Ibaraki Handbook of combinatorial optimization, 2897-2988, 2013 | 141* | 2013 |

Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints M Ohsaki, K Fujisawa, N Katoh, Y Kanno Computer Methods in Applied Mechanics and Engineering 180 (1), 203-217, 1999 | 123 | 1999 |

An algorithm for finding k minimum spanning trees N Katoh, T Ibaraki, H Mine SIAM Journal on Computing 10 (2), 247-255, 1981 | 104 | 1981 |

A proof of the molecular conjecture N Katoh, S Tanigawa Discrete & Computational Geometry 45 (4), 647-700, 2011 | 97 | 2011 |

On-line computation of transitive closures of graphs T Ibaraki, N Katoh Information Processing Letters 16 (2), 95-97, 1983 | 93 | 1983 |

Polynomial-time solutions to image segmentation T Asano, DZ Chen, N Katoh, T Tokuyama SODA 96, 104-113, 1996 | 92 | 1996 |

Mining pharmacy data helps to make profits Y Hamuro, N Katoh, Y Matsuda, K Yada Data Mining and Knowledge Discovery 2 (4), 391-398, 1998 | 76 | 1998 |

Topology optimization of trusses with stress and local constraints on nodal stability and member intersection M Ohsaki, N Katoh Structural and Multidisciplinary Optimization 29 (3), 190-197, 2005 | 73 | 2005 |

Triangulations intersect nicely O Aichholzer, F Aurenhammer, SW Cheng, N Katoh, G Rote, M Taschwer, ... Discrete & Computational Geometry 16 (4), 339-359, 1996 | 70 | 1996 |

Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k T Asano, N Katoh, H Tamaki, T Tokuyama Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 69 | 1997 |

The supported solutions used as a genetic information in a population heuristic X Gandibleux, H Morita, N Katoh Evolutionary Multi-Criterion Optimization, 429-442, 2001 | 67 | 2001 |

Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning T Asano, N Katoh, K Obokata, T Tokuyama SIAM Journal on Computing 32 (6), 1423-1435, 2003 | 62 | 2003 |

A polynomial time algorithm for the resource allocation problem with a convex objective function N Katoh, T Ibaraki, H Mine Journal of the Operational Research Society, 449-455, 1979 | 60 | 1979 |

Testing maximal 1-planarity of graphs with a rotation system in linear time P Eades, SH Hong, N Katoh, G Liotta, P Schweitzer, Y Suzuki Graph Drawing, 339-345, 2013 | 59* | 2013 |

Group symmetry in interior-point methods for semidefinite program Y Kanno, M Ohsaki, K Murota, N Katoh Optimization and Engineering 2 (3), 293-320, 2001 | 59 | 2001 |

Efficient algorithms for optimization-based image segmentation T Asano, DZ Chen, N Katoh, T Tokuyama International Journal of Computational Geometry & Applications 11 (02), 145-166, 2001 | 54 | 2001 |