2007 |
27 | EE | Stephen J. Young,
Edward R. Scheinerman:
Random Dot Product Graph Models for Social Networks.
WAW 2007: 138-149 |
2001 |
26 | | David Stein,
Gregory S. Chirikjian,
Edward R. Scheinerman:
Theory, Design, and Implementation of a Spherical Encoder.
ICRA 2001: 1773-1779 |
2000 |
25 | EE | Guantao Chen,
Michael S. Jacobson,
André E. Kézdy,
Jenö Lehel,
Edward R. Scheinerman,
Chi Wang:
Clique covering the edges of a locally cobipartite graph.
Discrete Mathematics 219(1-3): 17-26 (2000) |
24 | | James Allen Fill,
Edward R. Scheinerman,
Karen B. Singer-Cohen:
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 16(2): 156-176 (2000) |
1999 |
23 | EE | Edward R. Scheinerman:
Local representations using very short labels.
Discrete Mathematics 203(1-3): 287-290 (1999) |
1998 |
22 | EE | Charles M. Fiduccia,
Edward R. Scheinerman,
Ann N. Trenk,
Jennifer S. Zito:
Dot product representations of graphs.
Discrete Mathematics 181(1-3): 113-138 (1998) |
1997 |
21 | EE | Michael S. Jacobson,
Gregory M. Levin,
Edward R. Scheinerman:
On fractional Ramsey numbers.
Discrete Mathematics 176(1-3): 159-175 (1997) |
1994 |
20 | | Paul J. Tanenbaum,
Michael T. Goodrich,
Edward R. Scheinerman:
Characterization and Recognition of Point-Halfspace and Related Orders.
Graph Drawing 1994: 234-245 |
19 | EE | Motakuri V. Ramana,
Edward R. Scheinerman,
Daniel Ullman:
Fractional isomorphism of graphs.
Discrete Mathematics 132(1-3): 247-265 (1994) |
18 | EE | Edward R. Scheinerman,
Jennifer S. Zito:
On the Size of Hereditary Classes of Graphs.
J. Comb. Theory, Ser. B 61(1): 16-39 (1994) |
1993 |
17 | EE | Edward R. Scheinerman,
Ann N. Trenk:
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection.
Discrete Applied Mathematics 44(1-3): 233-245 (1993) |
16 | | Graham Brightwell,
Edward R. Scheinerman:
Representations of Planar Graphs.
SIAM J. Discrete Math. 6(2): 214-229 (1993) |
15 | | Aviezri S. Fraenkel,
Edward R. Scheinerman,
Daniel Ullman:
Undirected Edge Geography.
Theor. Comput. Sci. 112(2): 371-381 (1993) |
1992 |
14 | | Edward R. Scheinerman:
Generalized Chromatic Numbers of Random Graphs.
SIAM J. Discrete Math. 5(1): 74-80 (1992) |
1991 |
13 | EE | Aviezri S. Fraenkel,
Edward R. Scheinerman:
A deletion game on hypergraphs.
Discrete Applied Mathematics 30(2-3): 155-162 (1991) |
12 | EE | Alice M. Dean,
Joan P. Hutchinson,
Edward R. Scheinerman:
On the thickness and arboricity of a graph.
J. Comb. Theory, Ser. B 52(1): 147-151 (1991) |
11 | | Edward R. Scheinerman:
A Note on Planar Graphs and Circle Orders.
SIAM J. Discrete Math. 4(3): 448-451 (1991) |
1990 |
10 | EE | Edward R. Scheinerman:
On the interval number of random graphs.
Discrete Mathematics 82(1): 105-109 (1990) |
9 | EE | Edward R. Scheinerman:
An evolution of interval graphs.
Discrete Mathematics 82(3): 287-302 (1990) |
8 | | Edward R. Scheinerman:
On the Expected Capacity of Binomial and Random Concentrators.
SIAM J. Comput. 19(1): 156-163 (1990) |
1989 |
7 | EE | Edward R. Scheinerman,
John C. Wierman:
Optimal and near-optimal broadcast in random graphs.
Discrete Applied Mathematics 25(3): 289-297 (1989) |
1988 |
6 | | Edward R. Scheinerman:
Random interval graphs.
Combinatorica 8(4): 357-371 (1988) |
1987 |
5 | EE | Edward R. Scheinerman:
Irredundancy in multiple interval representations.
Discrete Mathematics 63(1): 101-108 (1987) |
4 | | Edward R. Scheinerman:
Almost Sure Fault Tolerance in Random Graphs.
SIAM J. Comput. 16(6): 1124-1134 (1987) |
1985 |
3 | EE | Edward R. Scheinerman:
Characterizing intersection classes of graphs.
Discrete Mathematics 55(2): 185-193 (1985) |
2 | EE | Edward R. Scheinerman:
Irrepresentability by multiple intersection, or why the interval number is unbounded.
Discrete Mathematics 55(2): 195-211 (1985) |
1983 |
1 | EE | Edward R. Scheinerman,
Douglas B. West:
The interval number of a planar graph: Three intervals suffice.
J. Comb. Theory, Ser. B 35(3): 224-239 (1983) |