VITA: Michelangelo Grigni
Phone: 404-727-7922 (404-727-5611 fax)
1995 to 2001: Assistant Professor, Emory University
1993 to 1995: NSF postdoctoral fellow and lecturer, U.C. San Diego
1992 to 1993: NSF postdoctoral fellow, Princeton University
1991 to 1992: postdoctoral fellow, University of British Columbia
B.S. (1986) Duke University, Mathematics and Computer Science, summa cum laude.
2002-2004: NSF grant CCR-0208929, ``Light Spanners for Hard Metrical Optimization Problems'', sole PI ($125,712).
1999-2002: NSF grant CCR-9820931, ``Approximation Algorithms for Planar and Geometric Optimization Problems'', sole PI ($144,200).
1997, 1998: Emory UTF course development grants.
1996: Emory URC grant, ``Summer Travel and the TSP'' ($4000).
1992-1995: NSF Mathematical Sciences Postdoctoral Research Fellowship.
1986-1989: NSF Graduate Fellowship.
Spril 2017: Graduate Algorithms (CS526), Theory of Computing (CS424).
Fall 2016: Computing for Bioinformatics (CS153), Data Structures & Algorithms (CS323).
2015-2016: CS153, Theory of Computing (graduate, CS524). CS323, CS424.
2014-2015: CS524, CS153. Intro. C.S. II (CS171), CS526, Honors (CS495RW, Celis), Directed Study (CS597R, Jiang and Meng).
2013-2014: CS524, CS224, CS598R (Elser). CS323, CS424.
2012-2013: CS524, CS224, CS599R (Lou), CS526, CS153.
2011-2012: CS170, CS524, CS797R (Hung), CS153, CS323, CS597R (Lou), CS797R (Hung).
2010-2011: CS526, CS153, CS599R (Bonomi), CS797R (Hung). (Also supervised three sections of CS170.) CS171, CS524, CS598R (Bonomi).
2009-2010: CS171, CS524. CS526, CS153.
2008-2009: Topics in Comp. & Life Science (CS740R, new course), CS524. CS323, CS153, CS598R (Hung).
Previous years available on request.
Hao-Hsiang Hung, left the program in summer 2012. We published a paper on light spanners.
Math. Ph.D. program:
Papa Amar Sissokho, co-advised with V. Rödl, Summer 2003, Light Spanners and Sparse Pseudorandom Graphs. (Associate Professor, Department of Mathematics, Illinois State University.)
Andre Berger, co-advised with Ojas Parekh, August 2006, Faster Minimum Weight Subgraph Algorithms. (Assistant Professor, Quantitative Economics, Maastricht University.)
C.S. M.S. program:
Keven Haynes, Spring 1998, The Feasibility of an Approximation Algorithm for the Traveling Salesman Problem. (Held technical positions at Georgia Tech and BellSouth, with Emory IT since Fall 2004.)
Andrzej Woloszyn, Summer 1998, A Weighted Planar Graph Separator.
Baiyu Pan, Spring 1999, Content-Sensitive Implicit X Compression. (Princeton real estate agent, and part-time instructor at Phoenix online.)
Malgorzata Malowinska, Summer 1999, Synchronizing Files over a Communication Link.
Benjamin Bradford (BS/MS), Fall 2000, An Algorithm for the Multiple Alignment of Protein Sequences. (Briefly a dot-bomb developer, now a Chicago IP law attorney.)
Tao Xu, Spring 2002, Data Structures for Extremal Optimization.
Adam Sherwood (BS/MS), Spring 2004, An Efficient Implementation of Suffix Trees Indexing the Human Genome. (Attending NYU medical school.)
Shufu Xu, Summer 2004, An Improvement to the BitTorrent Peer-to-peer Protocol. (Systems Analyst at Fred Hutchinson Cancer Research Center, building parallel simulators for national flu epidemics, which continues work started at Emory Biostatistics.)
Yogya Sharma, Fall 2005, A Well-Connected Separator for Planar Graphs. (A biotechnology software developer at St. Jude Children's Research Hospital.)
Siyuan Lou, Fall 2012, Analysis of Detour Gap Numbers.
Andres Celis, Honors/MS Spring 2015, A Stochastic Model for Networks that Arise from Conference Scheduling Problems. (Entered CS Ph.D. program at UCSD.)
Todd Arnold, 497R, a directed study of subliminal channels, Fall 1996.
Christan Blystone, Emory SURE program, a directed study of detour gap numbers, Summer 2000.
Andres Celis, Emory SURE program, directed study of scheduling problems in social networks, Summer 2014.
2013-present: undergraduate committee, member.
1997-2013: Graduate Committee (mostly CS).
1996-present (except 2002): each fall, coach and organizer for Emory students taking the Putnam exam (also the VTRMC since 2005).
2010-2012: chair of CS curriculum committee, reviewing the introductory CS sequence (especially CS170 to CS171).
2006-2009: CLS education committee.
2000-present: undergraduate majors advisor (mix of Math and CS).
2008-2013: each January, organized a small math tournament day for students from Fernbank elementary school.
2003-2006: C.S. development committee (chair 2004-2005).
1999-2001: INPACS committee.
1996-1999: Emory Academic Standards Committee.
Fall 1998: Emory freshman advising program (FAME), and subsequent service as a pre-major advisor.
1997-1998: PMACS Theory and Modeling Committee.
1995-1997: proposed and developed two new courses (CS124 and CS424/524) and revised CS major requirements.
Refereeing: Annals of Operations Research, PLOS ONE, ACM Transactions on Algorithms, J. Algorithms, Combinatorica, Comp. Complexity, Disc. Comp. Geometry, JCMCC, Inf. & Comp., IPL, ORSA J. Comput, JPDC, SICOMP, SIDMA (and quick reviews for various conferences).
Reviewed Sedgewick's Algorithms (4th edition), Spring 2009.
NSF panel reviewer, 2001.
Invited participant at Dagstuhl Seminar 16221, ``Algorithms for Optimization Problems in Planar Graphs'', May-June 2016.
Invited participant at Dagstuhl Seminar 13421, ``Algorithms for Optimization Problems in Planar Graphs'', October 2013.
Invited lecture, ``Faster Approximations for TSP and 2-ECSS'', 21st Clemson mini-conference on Discrete Math and Algorithms, 12 October 2006.
This listing is roughly chronological. In cases where a conference article appears again as a journal article, I have listed the journal version immediately after the conference version, and I label the two versions with the suffixes `a' and `b', respectively. Links refer to large Postscript files; other formats may be available by browsing my papers directory.