default search action
Michelangelo Grigni
Person information
- affiliation: Emory University, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2006
- [j9]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Recognizing Hole-Free 4-Map Graphs in Cubic Time. Algorithmica 45(2): 227-262 (2006) - 2004
- [j8]Michelangelo Grigni, Leonard J. Schulman
, Monica Vazirani, Umesh V. Vazirani:
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. Comb. 24(1): 137-154 (2004) - 2002
- [j7]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Map graphs. J. ACM 49(2): 127-138 (2002) - 2001
- [j6]Michelangelo Grigni:
A Sperner lemma complete for PPA. Inf. Process. Lett. 77(5-6): 255-259 (2001) - 2000
- [j5]Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou:
On the Difficulty of Designing Good Classifiers. SIAM J. Comput. 30(1): 318-323 (2000) - 1995
- [j4]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. 13: 1-15 (1995) - [j3]Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logarithmic Space from Logarithmic Depth. J. Comput. Syst. Sci. 50(3): 433-437 (1995) - 1994
- [j2]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) - 1991
- [j1]Michelangelo Grigni, David Peleg:
Tight Bounds on Minimum Broadcast Networks. SIAM J. Discret. Math. 4(2): 207-222 (1991)
Conference and Workshop Papers
- 2012
- [c20]Michelangelo Grigni, Hao-Hsiang Hung:
Light Spanners in Bounded Pathwidth Graphs. MFCS 2012: 467-477 - 2007
- [c19]André Berger
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. ICALP 2007: 90-101 - 2005
- [c18]André Berger
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483 - 2004
- [c17]Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao:
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505 - 2002
- [c16]Michelangelo Grigni, Papa A. Sissokho:
Light spanners and approximate TSP in weighted graphs with forbidden minors. SODA 2002: 852-857 - 2001
- [c15]Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani:
Quantum mechanical algorithms for the nonabelian hidden subgroup problem. STOC 2001: 68-74 - 2000
- [c14]Michelangelo Grigni:
Approximate TSP in Graphs with Forbidden Minors. ICALP 2000: 869-877 - [c13]Stefan Boettcher, Allon G. Percus, Michelangelo Grigni:
Optimizing through Co-evolutionary Avalanches. PPSN 2000: 447-456 - 1998
- [c12]Vaidy S. Sunderam, Shun Yan Cheung, Michael D. Hirsch, Sarah E. Chodrow, Michelangelo Grigni, Alan T. Krantz, Injong Rhee, Paul A. Gray, Soeren Olesen, Phillip W. Hutto, Julie Sult:
CCF: Collaborative Computing Frameworks. SC 1998: 23 - [c11]Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn:
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. SODA 1998: 33-41 - [c10]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Planar Map Graphs. STOC 1998: 514-523 - 1997
- [c9]Soeren Olesen, Sarah E. Chodrow, Michelangelo Grigni, Vaidy S. Sunderam:
Distributed Data Management Support for Collaborative Computing. HPCN Europe 1997: 487-490 - [c8]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Panarity, Revisited (Extended Abstract). WADS 1997: 472-473 - 1996
- [c7]Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou:
On the Difficulty of Designing Good Classifiers. COCOON 1996: 273-279 - [c6]Michelangelo Grigni, Fredrik Manne:
On the Complexity of the Generalized Block Distribution. IRREGULAR 1996: 319-326 - 1995
- [c5]Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou:
An Approximation Scheme for Planar Graph TSP. FOCS 1995: 640-645 - [c4]Michelangelo Grigni, Dimitris Papadias, Christos H. Papadimitriou:
Topological Inference. IJCAI (1) 1995: 901-907 - 1993
- [c3]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504 - 1991
- [c2]Michelangelo Grigni, Michael Sipser:
Monotone Separation of Logspace from NC. SCT 1991: 294-298 - [c1]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646
Informal and Other Publications
- 2011
- [i3]Michelangelo Grigni, Hao-Hsiang Hung:
Finding Light Spanners in Bounded Pathwidth Graphs. CoRR abs/1104.4669 (2011) - 2001
- [i2]Stefan Boettcher, Michelangelo Grigni:
Jamming Model for the Extremal Optimization Heuristic. CoRR cond-mat/0110165 (2001) - 1999
- [i1]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Map Graphs. CoRR cs.DM/9910013 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: