Faculty

Edward Scheinerman

Professor & Vice Dean for Graduate Education

Research Interests

  • Discrete Mathematics
  • Partially Ordered Sets
  • Random Methods
  • Graph Theory
Education
  • Ph.D. 1984, PRINCETON UNIVERSITY
Experience
  • 2007 - Present:  Vice Dean, Unspecified
Awards
  • 2013:  Fellow of the American Mathematical Society
  • 2006:  Applied Mathematics & Statistics Department Faculty Teaching Award
  • 2001:  Lester R. Ford Award
  • 1994:  Robert B. Pond, Sr. Excellence in Teaching Award
  • 1992:  Fellow of the Institute for Combinatorics and its Applications
  • 1991:  Lester R. Ford Award
  • Julia is a young programming language that promises both ease of use and high execution speed.

    Learn More
  • This is a broad area in which we associate mathematical (often, geometric) objects with vertices of a graph in such a way that the interaction between the objects mirrors the adjacency structure of the graph.

    Learn More
Journal Articles
  • EDWARD SR, REILLY E, YIGUANG Z (2014).  RANDOM THRESHOLD DIGRAPHS.  The Electronic Journal of Combinatorics.  21(2).  P2. 48.
  • Reilly E, Scheinerman E, Zhang Y (2014).  Random threshold digraphs.  Electronic Journal of Combinatorics.  21(2).
  • Beer E, Janson S, Fill JA, Scheinerman ER (2011).  On vertex, edge, and vertex-edge random graphs.  Electronic Journal of Combinatorics.  18(1).
  • Beer E, Fill JA, Janson S, Scheinerman ER (2011).  On vertex, edge, and vertex-edge random graphs.  8th Workshop on Analytic Algorithmics and Combinatorics 2011, ANALCO 2011.
  • BEER E, FILL, JAMES ALLEN , JANSON S, SCHEINERMAN ER (2011).  On Vertex, Edge, and Vertex-Edge Random Graphs.  Electronic Journal of Combinatorics.  18(1).  20.
  • KANG RJ, LOVÁSZ L, MÜLLER T, SCHEINERMAN ER (2011).  DOT PRODUCT REPRESENTATIONS OF PLANAR GRAPHS.  Electronic Journal of Combinatorics.  18(1).  14.
  • Scheinerman ER, Tucker K (2010).  Modeling graphs using dot product representations.  Computational Statistics.  25(1).
  • SCHEINERMAN E, TUCKER K (2010).  Modeling graphs using dot product representations.  COMPUTATIONAL STATISTICS.  25(1).  1-16.
  • Reilly EP, Scheinerman ER (2009).  Random threshold graphs.  Electronic Journal of Combinatorics.  16(1 R).
  • SCHEINERMAN ER, YOUNG S (2009).  Directed random dot product graphs.  Internet Mathematics.  5(1-2).  91-111.
  • REILLY E, SCHEINERMAN E (2009).  Random Threshold Graphs.  ELECTRONIC JOURNAL OF COMBINATORICS.  16(1).
  • Young SJ, Scheinerman E (2008).  Directed random dot product graphs.  Internet Mathematics.  5(1-2).
  • Young SJ, Scheinerman ER (2007).  Random dot product graph models for social networks.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  4863 LNCS.
  • NIETO J, SCHEINERMAN E, CHAPMAN R (2004).  Plucking Stirling numbers from trees.  AMERICAN MATHEMATICAL MONTHLY.  111(5).  444-445.
  • Stein D, Scheinerman ER, Chirikjian GS (2003).  Mathematical models of binary spherical-motion encoders.  IEEE/ASME Transactions on Mechatronics.  8(2).
  • STEIN D, SCHEINERMAN E, CHIRIKJIAN G (2003).  Mathematical models of binary spherical-motion encoders.  IEEE-ASME TRANSACTIONS ON MECHATRONICS.  8(2).  234-244.
  • Scheinerman ER (2001).  Determining planar location via complement-free de Bruijn sequences using discrete optical sensors.  IEEE Transactions on Robotics and Automation.  17(6).
  • Stein D, Chirikjian GS, Scheinerman ER (2001).  Theory, design, and implementation of a spherical encoder.  Proceedings - IEEE International Conference on Robotics and Automation.  2.
  • SCHEINERMAN E (2001).  Determining planar location via complement-free de Bruijn sequences using discrete optical sensors.  IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION.  17(6).  883-889.
  • STEIN D, CHIRIKJIAN G, SCHEINERMAN E (2001).  Theory, design, and implementation of a spherical encoder.  2001 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS.  1773-1779.
  • Chen G, Jacobson MS, Kézdy AE, Lehel J, Scheinerman ER, Wang C (2000).  Clique covering the edges of a locally cobipartite graph.  Discrete Mathematics.  219(1-3).
  • Fill JA, Scheinerman ER, Singer-Cohen KB (2000).  Random intersection graphs when m= ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models.  Random Structures and Algorithms.  16(2).
  • SCHEINERMAN E (2000).  When close enough is close enough.  AMERICAN MATHEMATICAL MONTHLY.  107(6).  489-499.
  • CHEN G, JACOBSON M, KEZDY A, LEHEL J, SCHEINERMAN E, Wang C (2000).  Clique covering the edges of a locally cobipartite graph.  DISCRETE MATHEMATICS.  219(1-3).  17-26.
  • FILL J, SCHEINERMAN E, SINGER-COHEN K (2000).  Random intersection graphs when m = omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models.  RANDOM STRUCTURES & ALGORITHMS.  16(2).  156-176.
  • Scheinerman ER (1999).  Local representations using very short labels.  Discrete Mathematics.  203(1-3).
  • KARONSKI M, SCHEINERMAN E, SINGER-COHEN K (1999).  On random intersection graphs: The subgraph problem.  COMBINATORICS PROBABILITY & COMPUTING.  8(1-2).  131-159.
  • SCHEINERMAN E (1999).  Local representations using very short labels.  DISCRETE MATHEMATICS.  203(1-3).  287-290.
  • Scheinerman ER, Trenk AN (1999).  On the fractional intersection number of a graph.  Graphs and Combinatorics.  15(3).
  • Karonski M, Scheinerman ER, Singer-Cohen KB (1999).  On Random Intersection Graphs: The Subgraph Problem.  Combinatorics Probability and Computing.  8(1-2).
  • Fiduccia CM, Scheinerman ER, Trenk A, Zito JS (1998).  Dot product representations of graphs.  Discrete Mathematics.  181(1-3).
  • Fill JA, Fishkind DE, Scheinerman ER (1998).  Affine Isomorphism for Partially Ordered Sets.  Order.  15(2).
  • Jacobson M, Levin GM, Scheinerman ER (1997).  On fractional Ramsey numbers.  Discrete Mathematics.  176(1-3).
  • Scheinerman ER, Tanenbaum PJ (1997).  Shrinkability of Minimal Elements in Sphere Representations of Posets.  Order.  14(1).
  • JACOBSON M, LEVIN G, SCHEINERMAN E (1997).  On fractional Ramsey numbers.  DISCRETE MATHEMATICS.  176(1-3).  159-175.
  • Scheinerman ER, Trenk AN, Ullman D (1995).  On point‐halfspace graphs.  Journal of Graph Theory.  20(1).
  • Tanenbaum PJ, Goodrich MT, Scheinerman ER (1995).  Characterization and recognition of point-halfspace and related orders.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  894.
  • Sapir MV, Scheinerman ER (1994).  Irrepresentability of short semilattices by euclidean subspaces.  Algebra Universalis.  31(4).
  • Ramana MV, Scheinerman ER, Ullman D (1994).  Fractional isomorphism of graphs.  Discrete Mathematics.  132(1-3).
  • Scheinerman ER, Zito J (1994).  On the Size of Hereditary Classes of Graphs.  Journal of Combinatorial Theory, Series B.  61(1).
  • Scheinerman E, THOMASSEN C (1994).  UNTITLED.  JOURNAL OF GRAPH THEORY.  18(4).  323-323.
  • Thomassen C, Scheinerman E (1994).  Editorial.  Journal of Graph Theory.  18(4).
  • Scheinerman ER, Trenk A (1993).  On generalized perfect graphs: bounded degree and bounded edge perfection.  Discrete Applied Mathematics.  44(1-3).
  • Fraenkel AS, Scheinerman ER, Ullman D (1993).  Undirected edge geography.  Theoretical Computer Science.  112(2).
  • Scheinerman ER (1993).  A note on graphs and sphere orders.  Journal of Graph Theory.  17(3).
  • McKee TA, Scheinerman ER (1993).  On the chordality of a graph.  Journal of Graph Theory.  17(2).
  • Scheinerman ER (1992).  The many faces of circle orders.  Order.  9(4).
  • Brightwell GR, Scheinerman ER (1992).  Fractional dimension of partial orders.  Order.  9(2).
  • Alon N, Scheinerman ER (1992).  Generalized sum graphs.  Graphs and Combinatorics.  8(1).
  • McMorris FR, Scheinerman ER (1991).  Connectivity threshold for random chordal graphs.  Graphs and Combinatorics.  7(2).
  • Fraenkel AS, Scheinerman ER (1991).  A deletion game on hypergraphs.  Discrete Applied Mathematics.  30(2-3).
  • Jacobson MS, McMorris FR, Scheinerman ER (1991).  General results on tolerance intersection graphs.  Journal of Graph Theory.  15(6).
  • Dean AM, Hutchinson JP, Scheinerman ER (1991).  On the thickness and arboricity of a graph.  Journal of Combinatorial Theory, Series B.  52(1).
  • Scheinerman ER (1990).  An evolution of interval graphs.  Discrete Mathematics.  82(3).
  • Scheinerman ER (1990).  On the interval number of random graphs.  Discrete Mathematics.  82(1).
  • JUSTICZ J, SCHEINERMAN E, WINKLER P (1990).  RANDOM INTERVALS.  AMERICAN MATHEMATICAL MONTHLY.  97(10).  881-889.
  • SCHEINERMAN E (1990).  ON THE INTERVAL NUMBER OF RANDOM GRAPHS.  DISCRETE MATHEMATICS.  82(1).  105-109.
  • Scheinerman ER (1990).  On the expected capacity of binomial and random concentrators.  SIAM Journal on Computing.  19(1).
  • Alon N, Katchalski M, Scheinerman ER (1990).  Not All Graphs are Segment T-graphs.  European Journal of Combinatorics.  11(1).
  • GOLUMBIC MC, SCHEINERMAN ER (1989).  Containment Graphs, Posets, and Related Classes of Graphs.  Annals of the New York Academy of Sciences.  555(1).
  • SCHEINERMAN ER, WEST DB (1989).  Interval Representations of Cliques and of Subset Intersection Graphs.  Annals of the New York Academy of Sciences.  555(1).
  • Scheinerman ER, Wierman JC (1989).  Optimal and near-optimal broadcast in random graphs.  Discrete Applied Mathematics.  25(3).
  • SCHEINERMAN ER, WIERMAN J (1989).  OPTIMAL AND NEAR-OPTIMAL BROADCAST IN RANDOM GRAPHS.  DISCRETE APPLIED MATHEMATICS.  25(3).  289-297.
  • Scheinerman ER, Wierman JC (1988).  On circle containment orders.  Order.  4(4).
  • Scheinerman ER (1988).  Random interval graphs.  Combinatorica.  8(4).
  • Alon N, Scheinerman ER (1988).  Degrees of freedom versus dimension for containment orders.  Order.  5(1).
  • Scheinerman ER (1988).  On the interval number of a chordal graph.  Journal of Graph Theory.  12(3).
  • SCHEINERMAN ER, WIERMAN J (1988).  ON CIRCLE CONTAINMENT ORDERS.  ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS.  4(4).  315-318.
  • Scheinerman ER, Wierman JC (1987).  Infinite AB percolation clusters exist.  Journal of Physics A: General Physics.  20(5).
  • GIMBEL J, KURTZ D, LESNIAK L, SCHEINERMAN ER, WIERMAN J (1987).  Hamiltonian Closure in Random Graphs.  Annals in Discrete Mathematics.  33.  59-67.
  • Scheinerman ER (1987).  Irredundancy in multiple interval representations.  Discrete Mathematics.  63(1).
  • Scheinerman ER (1987).  The maximum interval number of graphs with given genus.  Journal of Graph Theory.  11(3).
  • Scheinerman E, Wierman J (1987).  INFINITE AB PERCOLATION CLUSTERS EXIST.  JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL.  20(5).  1305-1307.
  • Scheinerman ER (1987).  ALMOST SURE FAULT TOLERANCE IN RANDOM GRAPHS..  SIAM Journal on Computing.  16(6).
  • Gimbel J, Kurtz D, Lesniak L, Scheinerman ER, Wierman JC (1987).  Hamiltonian closure in random graphs.  North-Holland Mathematics Studies.  144(C).
  • Scheinerman ER (1986).  On the structure of hereditary classes of graphs.  Journal of Graph Theory.  10(4).
  • SCHEINERMAN E (1985).  IRREPRESENTABILITY BY MULTIPLE INTERSECTION, OR WHY THE INTERVAL NUMBER IS UNBOUNDED.  DISCRETE MATHEMATICS.  55(2).  195-211.
  • Scheinerman ER (1985).  Characterizing intersection classes of graphs.  Discrete Mathematics.  55(2).
  • Scheinerman ER (1985).  Irrepresentability by multiple intersection, or why the interval number is unbounded.  Discrete Mathematics.  55(2).
  • SCHEINERMAN E, WEST D (1983).  THE INTERVAL NUMBER OF A PLANAR GRAPH - 3 INTERVALS SUFFICE.  JOURNAL OF COMBINATORIAL THEORY SERIES B.  35(3).  224-239.
  • Scheinerman ER, West DB (1983).  The interval number of a planar graph: Three intervals suffice.  Journal of Combinatorial Theory, Series B.  35(3).
Books
  • Scheinerman E (2017).  The Mathematics Lover's Companion.  Yale University Press.
  • SCHEINERMAN ER (2012).  MATHEMATICS: A DISCRETE INTRODUCTION, THIRD EDITION.  Cengage Learning.
  • SCHEINERMAN ER (2012).  INVITATION TO DYNAMICAL SYSTEMS.  Courier Corporation.
  • SCHEINERMAN ER (2011).  Mathematical Notation: A Guide for Engineers and Scientists.  Create Space.  84.
  • YOUNG S, SCHEINERMAN E, BONATO A, CHUNG F (2007).  Random dot product graph models for social networks.  4863.  138-149.
  • SCHEINERMAN E (2006).  C++ for Mathematicians.
  • SCHEINERMAN ER (2005).  Mathematics: A Discrete Introduction, second edition.
  • SCHEINERMAN ER (2003).  Matematica Discreta: Uma Introducao.
  • SCHEINERMAN ER (2001).  Matematicas Discretas.  Thomson International.
  • SCHEINERMAN E, CHIRIKJIAN G, STEIN D, DONALD B, LYNCH K, RUS D (2001).  Encoders for spherical motion using discrete optical sensor.  309-315.
  • SCHEINERMAN E (2000).  Mathematics: A. Discrete Introduction.
Book Chapters
  • SCHEINERMAN ER (2000).  Distance, Connectivity, Traversability.  Handbook of Discrete and Combinatorial Mathematics.  CRC.  539-549.
Conference Proceedings
  • BEER E, PRIEBE C, SCHEINERMAN E (2008).  Torus graph inference for detection of localized activity.  Workshop on Link Analysis, Counterterrorism, and Security.
  • GOODRICH M, SCHEINERMAN E, TAMASSIA R, TANENBAUM P, TOLLIS I (1995).  Characterization and recognition of point-halfspace and related orders.  Graph Drawing: Proceedings of GD 94 - Lecture notes in Computer Science #894.  234-245.
  • SCHEINERMAN E, WEST D (1989).  Interval representations of cliques and subset intersection graphs.  Combinatorial Mathematics: Proceedings of the Third International Conference.  555.  363-367.
  • GOLUMBIC M, SCHEINERMAN E (1989).  Containment graphs, posets and related classes of graphs.  Combinatorial Mathematics: Proceedings of the Third International Conference.  555.  192-204.
  • Second Joint International Meeting of the American Mathematical Society and the Israel Mathematics Union.  Tel Aviv, Israel.  June 1, 2014
  • Uri Natan Peled Memorial Lecture, 14th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms.  June 1, 2014
  • AMS Special Session on Graph Theory: Structural and Extremal Problems.  Baltimore, Maryland.  January 15, 2014
  • SIAM Discrete Mathematics Conference, Minisymposium on Favorite Conjectures.  Halifax, Nova Scotia, Canada.  June 21, 2012
  • Invited Speaker for Honor Societies Induction.  Mount Saint Mary's University.  April 13, 2011
  • MAA Invited Speaker and Session Organizer, Joint Mathematical Meetings.  New Orleans, Louisiana.  January 1, 2011
  • Panelist for IBM "Build a Smarter Student".  New York.  February 10, 2010
  • Project NExT Panelist, Joint Mathematical Meetings.  San Francisco, California.  January 13, 2010
  • SIAM Minisymposium in honor of Daniel Kleitman, SIAM National Meeting.  Denver, Colorado.  July 1, 2009
  • SIAM Minisymposium, Joint Mathematical Meetings.  Washington, D.C.  January 1, 2009
  • Project NExT.  University of Wisconsin.  July 1, 2008
  • COMPSTAT 2006.  Rome, Italy.  August 1, 2006
  • Workshop on Extraction of Intelligence from Graphs and High Dimensional Data.  Institute for Pure and Applied Mathematics.  July 1, 2005
  • The Bernard Lecture.  Davidson College.  October 1, 2003
  • Sixth Workshop "Hereditarnia" on Hereditary Properties of Graphs.  Kosice, Slovakia.  June 1, 2003
  • AMS/MAA Joint Mathematical Meeting.  Baltimore, Maryland.  November 1, 2002
  • MAA Maryland/DC/Virginia Sectional Meeting.  University of Maryland College Park.  November 1, 2002
  • Panelist, 16th Annual Department Chairs Colloquium.  Washington, D.C.  November 1, 2001
  • Workshop on Interdisciplinary Applications of Graph Theory and Algorithms.  Caesarea Edmond Benjamin de Rothschild Institute, Haifa University.  April 1, 2001
  • New York Academy of Sciences Graph Theory Day.  Queens College.  May 1, 2000
  • Workshop on the Algorithmic Foundations of Robotics (WAFR).  Dartmouth College.  March 1, 2000
  • MADCAP (Mid-Atlantic Day for Combinatorics and Probability.  November 1, 1999
  • Ninth SIAM Conference on Discrete Mathematics.  Toronto, Ontario, Canada.  July 1, 1998
  • Applied Physics Labortory Colloquium.  Johns Hopkins University.  April 1, 1997
  • AMS/MAA Combined Meeting, Special Session on Posets.  San Diego, California.  January 1, 1997
  • AMS/MAA Winter Meeting.  San Diego, California.  January 1, 1997
  • Eighth SIAM Conference on Discrete Mathematics.  Baltimore, Maryland.  June 1, 1996
  • Fourteenth British Combinatorial Conference.  University of Keele.  July 1, 1993
  • AMS Regional Coference.  Washington, D.C.  April 1, 1993
  • MIGHTY Conference.  Miami University, Ohio.  March 1, 1993
  • Seventh International Conference on the Theory and Applications of Graphs.  Western Michigan University.  June 1, 1992
  • Sixth SIAM Conference on Discrete Mathematics.  Vancouver, British Columbia, Canada.  June 1, 1992
  • Workshop on Planar Graphs, DIMACS.  Rutgers University.  November 1, 1991
  • Sixth Clemson Miniconference on Discrete Mathematics.  October 1, 1991
  • Thirteenth British Combinatorial Conference.  United Kingdom.  July 1, 1991
  • Fourth International Colloquium on the Theory of Graphs and Combinatorics.  Marseille, France.  June 1, 1990
  • Fifth SIAM Conference on Discrete Mathematics.  Atlanta, Georgia.  June 1, 1990
  • The Southeastern Conference on Combinatorics, Graph Theory and Computing.  Florida Atlantic University.  January 1, 1989
  • Fourth SIAM Conference on Discrete Mathematics.  San Francisco, California.  June 1, 1988
  • Sixth International Conference on the Theory and Applications of Graphs.  Western Michigan University.  June 1, 1988
  • ORSA-TIMS National Conference.  Washington, D.C.  April 1, 1988
  • Interface '88 Conference.  Reston, Virginia.  April 1, 1988
  • SIAM National Meeting, Mathematics.  Denver, Colorado.  November 1, 1987
  • ARIDAM II.  Rutgers Center for Operational Research.  January 1, 1987
  • The Eleventh British Combinatorial Conference.  Goldsmiths College, University of London.  January 1, 1987
  • The Two Hundred Fiftieth Anniversary Conference on Graph Theory.  Indiana University- Purdue University, For Wayne, Indiana.  January 1, 1986
  • The Southeastern Conference on Combinatorics, Graph Theory and Computing.  Florida Atlantic University.  January 1, 1986
  • The Southeastern Conference on Combinatorics, Graph Theory and Computing.  Florida Atlantic University.  January 1, 1985
  • The Downeast Conference on Graph Theory.  Colby College.  January 1, 1984
  • The Third International Conference on Combinatorial Mathematics.  New York City.  January 1, 1984
  • Regional A.M.S Conference.  Bryn Mawr College.  January 1, 1983
Back to top