| Latent semantic indexing: A probabilistic analysis CH Papadimitriou, H Tamaki, P Raghavan, S Vempala Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1998 | 1692 | 1998 |
| Unfold/fold transformation of logic programs H Tamaki Proceedings of the second international conference on logic programming, 127-138, 1984 | 716 | 1984 |
| OLD resolution with tabulation H Tamaki, T Sato Third International Conference on Logic Programming: Imperial College of …, 1986 | 650 | 1986 |
| Greedily finding a dense subgraph Y Asahiro, K Iwama, H Tamaki, T Tokuyama Journal of Algorithms 34 (2), 203-221, 2000 | 349* | 2000 |
| Motion planning for a steering-constrained robot through moderate obstacles PK Agarwal, P Raghavan, H Tamaki Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 130 | 1995 |
| Optimal branch-decomposition of planar graphs in O(n3) Time QP Gu, H Tamaki ACM Transactions on Algorithms (TALG) 4 (3), 1-13, 2008 | 122 | 2008 |
| Enumeration of success patterns in logic programs T Sato, H Tamaki Automata, Languages and Programming: 10th Colloquium Barcelona, Spain, July …, 1983 | 113 | 1983 |
| Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets T Akutsu, H Tamaki, T Tokuyama Proceedings of the thirteenth annual symposium on Computational geometry …, 1997 | 103 | 1997 |
| Positive-instance driven dynamic programming for treewidth H Tamaki Journal of Combinatorial Optimization 37 (4), 1283-1311, 2019 | 101 | 2019 |
| Transformational logic program synthesis T Sato International Conference on Fifth Generation Computer Systems, 1984, 1984 | 99 | 1984 |
| Motion planning on a graph CH Papadimitriou, P Raghavan, M Sudan, H Tamaki Proceedings 35th Annual Symposium on Foundations of Computer Science, 511-520, 1994 | 96 | 1994 |
| Algorithms for the maximum subarray problem based on matrix multiplication H Tamaki, T Tokuyama Interdisciplinary information sciences 6 (2), 99-104, 2000 | 82 | 2000 |
| 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 | 82 | 1997 |
| How to cut pseudo-parabolas into segments H Tamaki, T Tokuyama Proceedings of the eleventh annual symposium on Computational geometry, 230-237, 1995 | 82 | 1995 |
| Improved bounds on the planar branchwidth with respect to the largest grid minor size QP Gu, H Tamaki Algorithmica 64 (3), 416-453, 2012 | 81 | 2012 |
| Fast deflection routing for packets and worms A Bar-Noy, P Raghavan, B Schieber, H Tamaki Proceedings of the twelfth annual ACM symposium on Principles of distributed …, 1993 | 69 | 1993 |
| Routing a permutation in the hypercube by two sets of edge disjoint paths QP Gu, H Tamaki Journal of parallel and distributed computing 44 (2), 147-152, 1997 | 67 | 1997 |
| Matching algorithms are fast in sparse random graphs H Bast, K Mehlhorn, G Schafer, H Tamaki Theory of Computing Systems 39, 3-14, 2006 | 50 | 2006 |
| A generalized correctness proof of the unfold/fold logic program transformation H Tamaki, T Satō Department of Information Science, Ibaraki University, 1986 | 50 | 1986 |
| First order compiler: A deterministic logic program synthesis algorithm T Sato, H Tamaki J. Symb. Comput. 8 (6), 605-627, 1989 | 43 | 1989 |
Takeshi TokuyamaKwansei Gakuin UniversityE-mail confirmado em kwansei.ac.jp