| Topological inference M Grigni, D Papadias, C Papadimitriou IJCAI (1), 901-907, 1995 | 221 | 1995 |
| Ray shooting in polygons using geodesic triangulations B Chazelle, H Edelsbrunner, M Grigni, L Guibas, J Hershberger, M Sharir, ... Algorithmica 12 (1), 54-68, 1994 | 191 | 1994 |
| Quantum mechanical algorithms for the nonabelian hidden subgroup problem M Grigni, L Schulman, M Vazirani, U Vazirani Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 177 | 2001 |
| A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. S Arora, M Grigni, DR Karger, PN Klein, A Woloszyn SODA 98, 33-41, 1998 | 144 | 1998 |
| Tight bounds on mimimum broadcast networks M Grigni, D Peleg SIAM Journal on Discrete Mathematics 4 (2), 207-222, 1991 | 144 | 1991 |
| An approximation scheme for planar graph TSP M Grigni, E Koutsoupias, C Papadimitriou Proceedings of IEEE 36th Annual Foundations of Computer Science, 640-645, 1995 | 139 | 1995 |
| Map graphs ZZ Chen, M Grigni, CH Papadimitriou Journal of the ACM (JACM) 49 (2), 127-138, 2002 | 80 | 2002 |
| Improved bounds on weak ε-nets for convex sets B Chazelle, H Edelsbrunner, M Grigni, L Guibas, M Sharir, E Welzl Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 73 | 1993 |
| Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem D Bertsimas, M Grigni Operations Research Letters 8 (5), 241-244, 1989 | 72 | 1989 |
| On the complexity of the generalized block distribution M Grigni, F Manne International Workshop on Parallel Algorithms for Irregularly Structured …, 1996 | 65 | 1996 |
| Planar map graphs ZZ Chen, E Grigni, CH Papadimitriou Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 63 | 1998 |
| Ray shooting in polygons using geodesic triangulations B Chazelle, H Edelsbrunner, M Grigni, L Guibas, J Hershberger, M Sharir, ... International Colloquium on Automata, Languages, and Programming, 661-673, 1991 | 54 | 1991 |
| Jamming model for the extremal optimization heuristic S Boettcher, M Grigni Journal of Physics A: Mathematical and General 35 (5), 1109, 2002 | 44 | 2002 |
| Monotone complexity M Grigni, M Sipser Boolean function complexity 169, 57-75, 1992 | 43 | 1992 |
| Monotone separation of logarithmic space from logarithmic depth M Grigni, M Sipser Journal of Computer and System Sciences 50 (3), 433-437, 1995 | 41 | 1995 |
| A Sperner lemma complete for PPA M Grigni Information Processing Letters 77 (5-6), 255-259, 2001 | 37 | 2001 |
| Monotone separation of logspace from NC/sup 1 M Grigni, M Sipser 1991 Proceedings of the Sixth Annual Structure in Complexity Theory …, 1991 | 30 | 1991 |
| Approximate TSP in graphs with forbidden minors M Grigni International Colloquium on Automata, Languages, and Programming, 869-877, 2000 | 28 | 2000 |
| Recognizing hole-free 4-map graphs in cubic time ZZ Chen, M Grigni, CH Papadimitriou Algorithmica 45 (2), 227-262, 2006 | 26 | 2006 |
| Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs A Berger, A Czumaj, M Grigni, H Zhao European Symposium on Algorithms, 472-483, 2005 | 25* | 2005 |
