Ed Scheinerman

Edward R. Scheinerman is an American mathematician, working in graph theory and order theory. He is a professor of applied mathematics, statistics, and computer science at Johns Hopkins University.[1] His contributions to mathematics include Scheinerman's conjecture, now proven, stating that every planar graph may be represented as an intersection graph of line segments.[2]

Scheinerman did his undergraduate studies at Brown University, graduating in 1980, and earned his Ph.D. in 1984 from Princeton University under the supervision of Douglas B. West.[1][3] He joined the Johns Hopkins faculty in 1984, and since 2000 he has been an administrator there, serving as department chair, associate dean, vice dean for education, vice dean for graduate education, and vice dean for faculty (effective September 2019).[1]

He is a two-time winner of the Mathematical Association of America's Lester R. Ford Award for expository writing, in 1991 for his paper "Random intervals" with Joyce Justicz and Peter Winkler, and in 2001 for his paper "When Close is Close Enough".[4] In 1992 he became a fellow of the Institute of Combinatorics and its Applications,[1] and in 2012 he became a fellow of the American Mathematical Society.[5]

  1. ^ a b c d Faculty profile, Johns Hopkins University, retrieved 2013-07-12.
  2. ^ Chalopin, J.; Gonçalves, D. (2009), "Every planar graph is the intersection graph of segments in the plane" (PDF), ACM Symposium on Theory of Computing.
  3. ^ Ed Scheinerman at the Mathematics Genealogy Project
  4. ^ List of Ford Award winners Archived 1999-09-10 at the Wayback Machine, MAA, retrieved 2013-07-12.
  5. ^ List of Fellows of the American Mathematical Society, retrieved 2013-07-12.