Follow
Michelangelo Grigni
Michelangelo Grigni
Professor of Mathematics and Computer Science, Emory University
Verified email at mathcs.emory.edu
Title
Cited by
Cited by
Year
Topological inference
M Grigni, D Papadias, C Papadimitriou
IJCAI (1), 901-907, 1995
2351995
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
2141994
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
1902001
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
1591995
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
1581998
Tight bounds on mimimum broadcast networks
M Grigni, D Peleg
SIAM Journal on Discrete Mathematics 4 (2), 207-222, 1991
1551991
Map graphs
ZZ Chen, M Grigni, CH Papadimitriou
Journal of the ACM (JACM) 49 (2), 127-138, 2002
942002
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
851993
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
81*1989
On the complexity of the generalized block distribution
M Grigni, F Manne
Lecture Notes in Computer Science 1117, 319-326, 1996
781996
Planar map graphs
ZZ Chen, E Grigni, CH Papadimitriou
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
691998
Ray shooting in polygons using geodesic triangulations
B Chazelle, H Edelsbrunner, M Grigni, L Guibas, J Hershberger, M Sharir, ...
Automata, Languages and Programming: 18th International Colloquium Madrid …, 1991
601991
Monotone complexity
M Grigni, M Sipser
Boolean function complexity 169, 57-75, 1992
501992
Jamming model for the extremal optimization heuristic
S Boettcher, M Grigni
Journal of Physics A: Mathematical and General 35 (5), 1109, 2002
442002
Monotone separation of logarithmic space from logarithmic depth
M Grigni, M Sipser
Journal of Computer and System Sciences 50 (3), 433-437, 1995
441995
A Sperner lemma complete for PPA
M Grigni
Information Processing Letters 77 (5-6), 255-259, 2001
372001
Approximate TSP in graphs with forbidden minors
M Grigni
Automata, Languages and Programming: 27th International Colloquium, ICALP …, 2000
362000
Recognizing hole-free 4-map graphs in cubic time
ZZ Chen, M Grigni, CH Papadimitriou
Algorithmica 45, 227-262, 2006
332006
Monotone separation of logspace from NC/sup 1
M Grigni, M Sipser
1991 Proceedings of the Sixth Annual Structure in Complexity Theory …, 1991
311991
Light spanners and approximate TSP in weighted graphs with forbidden minors
M Grigni, P Sissokho
SODA 2, 852-857, 2002
292002
The system can't perform the operation now. Try again later.
Articles 1–20