Edward R. Scheinerman

According to our database1, Edward R. Scheinerman authored at least 51 papers between 1983 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Containment Graphs, Posets, and Related Classes of Graphs.
CoRR, 2019

2014
Random Threshold Digraphs.
Electron. J. Comb., 2014

2011
Dot Product Representations of Planar Graphs.
Electron. J. Comb., 2011

On Vertex, Edge, and Vertex-Edge Random Graphs.
Electron. J. Comb., 2011

2010
Modeling graphs using dot product representations.
Comput. Stat., 2010

2009
Random Threshold Graphs.
Electron. J. Comb., 2009

2008
Directed Random Dot Product Graphs.
Internet Math., 2008

2007
Random Dot Product Graph Models for Social Networks.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

2004
Plucking Stirling Numbers from Trees: 10976.
Am. Math. Mon., 2004

2001
Determining planar location via complement-free de Brujin sequences using discrete optical sensors.
IEEE Trans. Robotics Autom., 2001

Theory, Design, and Implementation of a Spherical Encoder.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
When Close Enough is Close Enough.
Am. Math. Mon., 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 Struct. Algorithms, 2000

Clique covering the edges of a locally cobipartite graph.
Discret. Math., 2000

1999
Graph Theory.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

On the Fractional Intersection Number of a Graph.
Graphs Comb., 1999

Local representations using very short labels.
Discret. Math., 1999

1998
Dot product representations of graphs.
Discret. Math., 1998

1997
On fractional Ramsey numbers.
Discret. Math., 1997

1995
On point-halfspace graphs.
J. Graph Theory, 1995

The dual of a circle order is not necessarilty a circle order.
Ars Comb., 1995

1994
Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp.
Networks, 1994

Editorial.
J. Graph Theory, 1994

On the Size of Hereditary Classes of Graphs.
J. Comb. Theory, Ser. B, 1994

Fractional isomorphism of graphs.
Discret. Math., 1994

Characterization and Recognition of Point-Halfspace and Related Orders.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993
Undirected Edge Geography.
Theor. Comput. Sci., 1993

Representations of Planar Graphs.
SIAM J. Discret. Math., 1993

A note on graphs and sphere orders.
J. Graph Theory, 1993

On the chordality of a graph.
J. Graph Theory, 1993

On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection.
Discret. Appl. Math., 1993

1992
Generalized Chromatic Numbers of Random Graphs.
SIAM J. Discret. Math., 1992

Generalized sum graphs.
Graphs Comb., 1992

1991
A Note on Planar Graphs and Circle Orders.
SIAM J. Discret. Math., 1991

General results on tolerance intersection graphs.
J. Graph Theory, 1991

On the thickness and arboricity of a graph.
J. Comb. Theory, Ser. B, 1991

Connectivity threshold for random chordal graphs.
Graphs Comb., 1991

A deletion game on hypergraphs.
Discret. Appl. Math., 1991

1990
On the Expected Capacity of Binomial and Random Concentrators.
SIAM J. Comput., 1990

Not All Graphs are Segment T-graphs.
Eur. J. Comb., 1990

An evolution of interval graphs.
Discret. Math., 1990

On the interval number of random graphs.
Discret. Math., 1990

1989
Optimal and near-optimal broadcast in random graphs.
Discret. Appl. Math., 1989

1988
On the interval number of a chordal graph.
J. Graph Theory, 1988

Random interval graphs.
Comb., 1988

1987
Almost Sure Fault Tolerance in Random Graphs.
SIAM J. Comput., 1987

The maximum interval number of graphs with given genus.
J. Graph Theory, 1987

Irredundancy in multiple interval representations.
Discret. Math., 1987

1985
Irrepresentability by multiple intersection, or why the interval number is unbounded.
Discret. Math., 1985

Characterizing intersection classes of graphs.
Discret. Math., 1985

1983
The interval number of a planar graph: Three intervals suffice.
J. Comb. Theory, Ser. B, 1983


  Loading...