Maria Chudnovsky

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Maria Chudnovsky
Chudnovsky 2012 hi-res-download 2.jpg
Born (1977-01-06) January 6, 1977 (age 38)
Residence U.S.
Nationality Israeli-American
Fields Computer Science
Institutions Princeton University
Alma mater Technion,
Princeton University
Thesis Berge Trigraphs and Their Applications. (2005)
Doctoral advisor Paul Seymour
Known for Graph theory,
Combinatorial optimization

Maria Chudnovsky (born January 6, 1977) is an Israeli-American mathematician working on graph theory and combinatorial optimization.[1] She is a 2012 MacArthur Fellow.[2]

Biography[edit]

Chudnovsky is a professor in the department of mathematics at Princeton University. She grew up in Russia and Israel, studying at the Technion,[3] and received her Ph.D. in 2003 from Princeton University under the supervision of Paul Seymour.[4] After postdoctoral research at the Clay Mathematics Institute,[3] she became an assistant professor at Princeton University in 2005, and moved to Columbia University in 2006. By 2014 she was the Liu Family Professor of Industrial Engineering and Operations Research at Columbia. She returned to Princeton as a professor of mathematics in 2015.[1]

She is a citizen of Israel and a permanent resident of the USA.[1]

Research[edit]

External video
Chudnovsky 2012 hi-res-download 1.jpg
Mathematician Maria Chudnovsky: 2012 MacArthur Fellow, MacArthur Foundation[5]

Chudnovsky's contributions to graph theory include the proof of the strong perfect graph theorem (with Robertson, Seymour, and Thomas) characterizing perfect graphs as being exactly the graphs with no odd induced cycles of length at least 5 or their complements.[6][7][8] Other research contributions of Chudnovsky include co-authorship of the first polynomial time algorithm for recognizing perfect graphs (degree 9),[9] and of a structural characterization of the claw-free graphs.[10]

Selected publications[edit]

Awards and honors[edit]

In 2004 Chudnovsky was named one of the “Brilliant 10” by Popular Science magazine.[11] Her work on the strong perfect graph theorem won for her and her co-authors the 2009 Fulkerson Prize.[12] In 2012 she was awarded a "genius award" under the MacArthur Fellows Program.[13][14]

References[edit]

  1. ^ a b c "Maria Chudnovsky Curriculum Vitae" (PDF). Princeton University. Retrieved 25 May 2015. 
  2. ^ "2012 MacArthur Foundation 'Genius Grant' Winners". 1 October 2012. AP. Retrieved 1 October 2012. 
  3. ^ a b Interview with Research Fellow Maria Chudnovsky (PDF), Clay Mathematics Institute, 2005 .
  4. ^ Maria Chudnovsky at the Mathematics Genealogy Project
  5. ^ "Maria Chudnovsky". MacArthur Fellows Program. MacArthur Foundation. October 2, 2012. Retrieved December 13, 2014. 
  6. ^ Mackenzie, Dana (July 5, 2002), "Mathematics: Graph theory uncovers the roots of perfection", Science 297 (5578): 38, doi:10.1126/science.297.5578.38, PMID 12098683 .
  7. ^ Cornuéjols, Gérard (2002), "The strong perfect graph conjecture", Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002) (PDF), Beijing: Higher Ed. Press, pp. 547–559, MR 1957560 .
  8. ^ Roussel, F.; Rusu, I.; Thuillier, H. (2009), "The strong perfect graph conjecture: 40 years of attempts, and its resolution", Discrete Mathematics 309 (20): 6092–6113, doi:10.1016/j.disc.2009.05.024, MR 2552645 .
  9. ^ Chudnovsky et al. (2005).
  10. ^ Chudnovsky & Seymour (2005).
  11. ^ Minkel, J. R. (June 29, 2004), "Maria Chudnovsky", Popular Science 
  12. ^ "2009 Fulkerson Prizes" (PDF), Notices of the American Mathematical Society, December 2011: 1475–1476 .
  13. ^ Lee, Felicia R. (October 1, 2012), "Surprise Grants Transforming 23 More Lives", New York Times 
  14. ^ Maria Chudnovsky, MacArthur Foundation, October 2, 2012.

External links[edit]