Michelangelo Grigni

Affiliations:
  • Emory University, Atlanta, GA, USA


According to our database1, Michelangelo Grigni authored at least 27 papers between 1991 and 2012.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Light Spanners in Bounded Pathwidth Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Finding Light Spanners in Bounded Pathwidth Graphs
CoRR, 2011

2007
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Recognizing Hole-Free 4-Map Graphs in Cubic Time.
Algorithmica, 2006

2005
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.
Proceedings of the Algorithms, 2005

2004
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem.
Comb., 2004

Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002
Map graphs.
J. ACM, 2002

Light spanners and approximate TSP in weighted graphs with forbidden minors.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
A Sperner lemma complete for PPA.
Inf. Process. Lett., 2001

Jamming Model for the Extremal Optimization Heuristic
CoRR, 2001

2000
On the Difficulty of Designing Good Classifiers.
SIAM J. Comput., 2000

Optimizing through Co-evolutionary Avalanches.
Proceedings of the Parallel Problem Solving from Nature, 2000

Approximate TSP in Graphs with Forbidden Minors.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1998
Planar Map Graphs.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

CCF: Collaborative Computing Frameworks.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1998

1997
Panarity, Revisited (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Distributed Data Management Support for Collaborative Computing.
Proceedings of the High-Performance Computing and Networking, 1997

1996
On the Complexity of the Generalized Block Distribution.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995
Monotone Separation of Logarithmic Space from Logarithmic Depth.
J. Comput. Syst. Sci., 1995

Improved Bounds on Weak epsilon-Nets for Convex Sets.
Discret. Comput. Geom., 1995

Topological Inference.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

An Approximation Scheme for Planar Graph TSP.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Ray Shooting in Polygons Using Geodesic Triangulations.
Algorithmica, 1994

1991
Tight Bounds on Minimum Broadcast Networks.
SIAM J. Discret. Math., 1991

Monotone Separation of Logspace from NC.
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991


  Loading...