☰

MichelAngelo Grigni - Publications

Affiliations: 
Emory University, Atlanta, GA 
Area:
Mathematics, Computer Science
Tree Info Similar researchers PubMed Report error

14 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2012 Grigni M, Hung HH. Light spanners in bounded pathwidth graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7464: 467-477. DOI: 10.1007/978-3-642-32589-2_42  0.324
2007 Berger A, Grigni M. Minimum weight 2-edge-connected spanning subgraphs in planar graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 90-101.  0.379
2006 Chen ZZ, Grigni M, Papadimitriou CH. Recognizing hole-free 4-map graphs in cubic time Algorithmica (New York). 45: 227-262. DOI: 10.1007/S00453-005-1184-8  0.386
2005 Berger A, Czumaj A, Grigni M, Zhao H. Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs Lecture Notes in Computer Science. 3669: 472-483.  0.325
2004 Czumaj A, Grigni M, Sissokho P, Zhao H. Approximation Schemes for Minimum 2-Edge-Connected and Biconnected Subgraphs in Planar Graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 489-498.  0.371
2002 Chen ZZ, Grigni M, Papadimitriou CH. Map graphs Journal of the Acm. 49: 127-138. DOI: 10.1145/506147.506148  0.357
2002 Grigni M, Sissokho P. Light spanners and approximate TSP in weighted graphs with forbidden minors Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 852-857.  0.384
2001 Grigni M. Sperner lemma complete for PPA Information Processing Letters. 77: 255-259. DOI: 10.1016/S0020-0190(00)00152-6  0.4
2000 Grigni M, Mirelli V, Papadimitriou CH. On the difficulty of designing good classifiers Siam Journal On Computing. 30: 318-323. DOI: 10.1137/S009753979630814X  0.393
2000 Grigni M. Approximate TSP in graphs with forbidden minors Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1853: 869-877.  0.336
1995 Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. Improved bounds on weak ε-nets for convex sets Discrete & Computational Geometry. 13: 1-15. DOI: 10.1007/Bf02574025  0.32
1994 Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. Ray shooting in polygons using geodesic triangulations Algorithmica. 12: 54-68. DOI: 10.1007/Bf01377183  0.324
1991 Grigni M, Peleg D. Tight Bounds on Mimimum Broadcast Networks Siam Journal On Discrete Mathematics. 4: 207-222. DOI: 10.1137/0404021  0.363
1989 Bertsimas D, Grigni M. Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem Operations Research Letters. 8: 241-244. DOI: 10.1016/0167-6377(89)90047-3  0.362
Show low-probability matches.