Maria Chudnovsky
| Maria Chudnovsky | |
|---|---|
| File:Chudnovsky 2012 hi-res-download 2.jpg | |
| Born | January 6, 1977 |
| Residence | U.S. |
| Nationality | Israeli-American |
| Fields | Mathematics |
| 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]
Contents
Biography
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]
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. [5]
Research
| External video | |
|---|---|
| 210px | |
 Mathematician Maria Chudnovsky: 2012 MacArthur Fellow, MacArthur Foundation[6] |
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.[7][8][9] Other research contributions of Chudnovsky include co-authorship of the first polynomial time algorithm for recognizing perfect graphs (degree 9),[10] and of a structural characterization of the claw-free graphs.[11]
Selected publications
- Lua error in package.lua at line 80: module 'strict' not found..
- Lua error in package.lua at line 80: module 'strict' not found..
- Lua error in package.lua at line 80: module 'strict' not found..
Awards and honors
In 2004 Chudnovsky was named one of the “Brilliant 10” by Popular Science magazine.[12] Her work on the strong perfect graph theorem won for her and her co-authors the 2009 Fulkerson Prize.[13] In 2012 she was awarded a "genius award" under the MacArthur Fellows Program.[14][15]
References
- ↑ 1.0 1.1 1.2 Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ 3.0 3.1 Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Maria Chudnovsky at the Mathematics Genealogy Project
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Chudnovsky et al. (2005).
- ↑ Chudnovsky & Seymour (2005).
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Maria Chudnovsky, MacArthur Foundation, October 2, 2012.
External links
Lua error in package.lua at line 80: module 'strict' not found.
