Visibility of disjoint polygons T Asano, T Asano, L Guibas, J Hershberger, H Imai Algorithmica 1, 49-63, 1986 | 321 | 1986 |

Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane H Imai, T Asano Journal of algorithms 4 (4), 310-323, 1983 | 233 | 1983 |

Visibility-polygon search and euclidean shortest paths T Asano, T Asano, L Guibas, J Hershberger, H Imai 26th annual symposium on foundations of computer science (SFCS 1985), 155-164, 1985 | 187 | 1985 |

Efficient algorithms for geometric graph search problems H Imai, T Asano SIAM Journal on Computing 15 (2), 478-494, 1986 | 151 | 1986 |

Practical use of bucketing techniques in computational geometry T Asano, M Edahiro, I Hiroshi, IRI Masao, K Murota Machine Intelligence and Pattern Recognition 2, 153-195, 1985 | 141 | 1985 |

Improved approximation algorithms for MAX SAT T Asano, DP Williamson Journal of Algorithms 42 (1), 173-202, 2002 | 113 | 2002 |

Partitioning a polygonal region into trapezoids T Asano, T Asano, H Imai Journal of the ACM (JACM) 33 (2), 290-312, 1986 | 92 | 1986 |

An approach to the subgraph homeomorphism problem T Asano Theoretical Computer Science 38, 249-267, 1985 | 89 | 1985 |

Minimum partition of polygonal regions into trapezoids T Asano, T Asano 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 233-241, 1983 | 63 | 1983 |

Dynamic orthogonal segment intersection search H Imai, T Asano Journal of Algorithms 8 (1), 1-18, 1987 | 60 | 1987 |

Edge-contraction problems T Asano, T Hirata Journal of Computer and System Sciences 26 (2), 197-208, 1983 | 56 | 1983 |

Edge-deletion and edge-contraction problems T Asano, T Hirata Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 55 | 1982 |

Approximation algorithms for the maximum satisfiability problem T Asano, T Ono, T Hirata Scandinavian Workshop on Algorithm Theory, 100-111, 1996 | 53 | 1996 |

Approximation algorithms for max sat: Yannakakis vs. goemans-williamson T Asano Proceedings of the Fifth Israeli Symposium on Theory of Computing and …, 1997 | 48 | 1997 |

An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs T Nishizeki, T Asano, T Watanabe Discrete applied mathematics 5 (2), 211-222, 1983 | 46 | 1983 |

Dynamic segment intersection search with applications H Imai, T Asano 25th Annual Symposium onFoundations of Computer Science, 1984., 393-402, 1984 | 45 | 1984 |

Polygon triangulation: Efficiency and minimality T Asano, T Asano, RY Pinter Journal of Algorithms 7 (2), 221-231, 1986 | 42 | 1986 |

An upper bound on the length of a Hamiltonian walk of a maximal planar graph T Asano, T Nishizeki, T Watanabe Journal of Graph Theory 4 (3), 315-336, 1980 | 36 | 1980 |

An improved algorithm for the minimum Manhattan network problem R Kato, K Imai, T Asano Algorithms and Computation: 13th International Symposium, ISAAC 2002 …, 2002 | 35 | 2002 |

An application of duality to edge-deletion problems T Asano SIAM Journal on Computing 16 (2), 312-331, 1987 | 35 | 1987 |