Ed Scheinerman
#63,139
Most Influential Person Now
American mathematician
Ed Scheinerman's AcademicInfluence.com Rankings
Ed Scheinermanmathematics Degrees
Mathematics
#3103
World Rank
#4647
Historical Rank
#1175
USA Rank
Measure Theory
#3761
World Rank
#4436
Historical Rank
#1075
USA Rank
Download Badge
Mathematics
Ed Scheinerman's Degrees
- PhD Mathematics Princeton University
Why Is Ed Scheinerman Influential?
(Suggest an Edit or Addition)According to Wikipedia, 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. 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.
Ed Scheinerman's Published Works
Published Works
- Fractional Graph Theory: A Rational Approach to the Theory of Graphs (1997) (390)
- Random Dot Product Graph Models for Social Networks (2007) (247)
- On Random Intersection Graphs: The Subgraph Problem (1999) (210)
- Representations of Planar Graphs (1993) (134)
- Invitation to Dynamical Systems (1995) (126)
- On the Size of Hereditary Classes of Graphs (1994) (95)
- Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models (2000) (91)
- Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models (2000) (77)
- Mathematical models of binary spherical-motion encoders (2003) (73)
- Modeling graphs using dot product representations (2010) (62)
- The interval number of a planar graph: Three intervals suffice (1983) (60)
- Fractional isomorphism of graphs (1994) (58)
- Undirected Edge Geography (1993) (52)
- Almost Sure Fault Tolerance in Random Graphs (1987) (49)
- Random interval graphs (1988) (47)
- Mathematics: A Discrete Introduction (2000) (47)
- Degrees of freedom versus dimension for containment orders (1988) (44)
- The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometri (1994) (43)
- On the thickness and arboricity of a graph (1991) (43)
- Fractional dimension of partial orders (1992) (41)
- Random intervals (1990) (35)
- General results on tolerance intersection graphs (1991) (31)
- An evolution of interval graphs (1990) (30)
- Characterizing intersection classes of graphs (1985) (27)
- On circle containment orders (1988) (26)
- Directed Random Dot Product Graphs (2008) (21)
- On the Fractional Intersection Number of a Graph (1999) (21)
- Optimal and near-optimal broadcast in random graphs (1989) (20)
- A deletion game on hypergraphs (1991) (20)
- Connectivity threshold for random chordal graphs (1991) (19)
- When Close Enough Is Close Enough (2000) (19)
- A Note on Planar Graphs and Circle Orders (1991) (16)
- Generalized Chromatic Numbers of Random Graphs (1992) (16)
- The maximum interval number of graphs with given genus (1987) (16)
- Determining planar location via complement-free de Brujin sequences using discrete optical sensors (2001) (14)
- On the structure of hereditary classes of graphs (1986) (14)
- Dot Product Representations of Planar Graphs (2010) (13)
- Clique covering the edges of a locally cobipartite graph (2000) (12)
- Local representations using very short labels (1999) (12)
- Containment Graphs, Posets, and Related Classes of Graphs (1989) (12)
- Dot product representations of graphs (1998) (11)
- On Vertex, Edge, and Vertex-Edge Random Graphs (2008) (11)
- Random Threshold Graphs (2009) (10)
- On the chordality of a graph (1993) (10)
- A note on graphs and sphere orders (1993) (9)
- Theory, design, and implementation of a spherical encoder (2001) (8)
- Random Threshold Digraphs (2009) (8)
- On the interval number of random graphs (1990) (7)
- Irrepresentability by multiple intersection, or why the interval number is unbounded (1985) (7)
- The many faces of circle orders (1992) (6)
- A Simple Complex Analysis and an Advanced Calculus Proof of the Fundamental Theorem of Algebra (2009) (6)
- Another Continued Fraction for π (2008) (6)
- On the interval number of a chordal graph (1988) (6)
- Characterization and Recognition of Point-Halfspace and Related Orders (1994) (6)
- Irredundancy in multiple interval representations (1987) (6)
- On fractional Ramsey numbers (1997) (6)
- Infinite AB percolation clusters exist (1987) (5)
- Hamiltonian Closure in Random Graphs (1987) (4)
- On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection (1993) (4)
- Not All Graphs are Segment T-graphs (1990) (4)
- Generalized sum graphs (1992) (4)
- Arbitrage and Geometry (2017) (2)
- On point-halfspace graphs (1995) (2)
- Interval Representations of Cliques and of Subset Intersection Graphs a (1989) (2)
- The Projective Plane (2006) (2)
- Four Shots for a Convex Quadrilateral (2008) (2)
- Affine Isomorphism for Partially Ordered Sets (1998) (2)
- The Doctor of Engineering as a New Degree for a New Category of Students: Full-Time, Non-Residential, High-Touch, Research-Focused, Mentored, Professional (2019) (1)
- Efficient Local Representations of Graphs (2016) (1)
- Irrepresentability of short semilattices by euclidean subspaces (1994) (1)
- The dual of a circle order is not necessarilty a circle order (1995) (1)
- Shrinkability of Minimal Elements in Sphere Representations of Posets (1997) (1)
- C++ for Mathematicians: An Introduction for Students and Professionals (2018) (1)
- Intersection Graphs and Geometric/Combinatorial Optimization. (1996) (0)
- Characterizing Containment and Related Classes of Graphs (1985) (0)
- Editorial (1994) (0)
- Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp (1994) (0)
- The Local Representation of Graphs Conjecture (2012) (0)
- A Combinatorial Proof of the Pythagorean Theorem (1995) (0)
- Finding a Compositional Square Root of Sine (2022) (0)
- C++ for Mathematicians (2006) (0)
- Strings, Input/Output, and Visualization (2006) (0)
- Greatest Common Divisor (2006) (0)
- Graph Theory (1999) (0)
- On the Expected Capacity of Binomial and Random Concentrators (1990) (0)
- A Third Real Solution to x=x−1, Not Really (2023) (0)
- Documentation with Doxygen (2006) (0)
- A Hands-on Approach: Spatial Reasoning Training and Retention within Engineering (2015) (0)
- Using Other Packages (2006) (0)
- Open Problems from Cccg 2002 Kissing Circle Representation (2002) (0)
- Your C++ Computing Environment (2006) (0)
- Odds and Ends (2006) (0)
- Plucking Stirling Numbers from Trees: 10976 (2004) (0)
- The Mathematics Lover's Companion: Masterpieces for Everyone (2017) (0)
- Points in the Plane (2006) (0)
This paper list is powered by the following services:
Other Resources About Ed Scheinerman
What Schools Are Affiliated With Ed Scheinerman?
Ed Scheinerman is affiliated with the following schools: