Siddhesh Joshi (Editor)

Maria Chudnovsky

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Nationality
  
Israeli-American

Fields
  
Computer Science

Name
  
Maria Chudnovsky

Doctoral advisor
  

Maria Chudnovsky aussoisjpg


Born
  
January 6, 1977 (age 47) (
1977-01-06
)

Thesis
  
Berge Trigraphs and Their Applications. (2005)

Known for
  

Residence
  
United States of America

Institutions
  
Princeton University

Mathematician maria chudnovsky 2012 macarthur fellow macarthur foundation


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

Contents

Maria Chudnovsky Engineering Newsletter

Interview at cirm maria chudnovsky


Biography

Maria Chudnovsky Maria Chudnovsky MacArthur Foundation

Chudnovsky is a professor in the department of mathematics at Princeton University. She grew up in Russia and Israel, studying at the Technion, and received her Ph.D. in 2003 from Princeton University under the supervision of Paul Seymour. After postdoctoral research at the Clay Mathematics Institute, 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.

Maria Chudnovsky Mathematician Maria Chudnovsky 2012 MacArthur Fellow

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

Maria Chudnovsky Prof Chudnovsky Wins MacArthur Genius Grant The Fu

In 2012, she married Daniel Panner, a viola player who teaches at Mannes College The New School for Music and the Juilliard School. They have a son named Rafael.

Research

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. Other research contributions of Chudnovsky include co-authorship of the first polynomial time algorithm for recognizing perfect graphs (degree 9), and of a structural characterization of the claw-free graphs.

Selected publications

  • Chudnovsky, Maria; Cornuéjols, Gérard; Liu, Xinming; Seymour, Paul; Vušković, Kristina (2005), "Recognizing Berge graphs", Combinatorica, 25 (2): 143–186, MR 2127609, doi:10.1007/s00493-005-0012-8 .
  • Chudnovsky, Maria; Seymour, Paul (2005), "The structure of claw-free graphs", Surveys in Combinatorics 2005, London Mathematical Society Lecture Note Series, 327, Cambridge: Cambridge Univ. Press, pp. 153–171, MR 2187738, doi:10.1017/CBO9780511734885.008 .
  • Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem", Annals of Mathematics, 164 (1): 51–229, doi:10.4007/annals.2006.164.51 .
  • Awards and honors

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

    References

    Maria Chudnovsky Wikipedia