Edward R. Scheinerman

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 2

Top Topics

Kalman Filtering

Threshold Selection

Randomly Distributed

Top Venues

Electron. J. Comb.

Publications

Tongtong Chen, Edward R. Scheinerman
Finding a Compositional Square Root of Sine. Am. Math. Mon. 129 (9) (2022)
Martin Charles Golumbic, Edward R. Scheinerman
Containment Graphs, Posets, and Related Classes of Graphs. CoRR (2019)
Elizabeth Perez Reilly, Edward R. Scheinerman, Yiguang Zhang
Random Threshold Digraphs. Electron. J. Comb. 21 (2) (2014)
Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman
Dot Product Representations of Planar Graphs. Electron. J. Comb. 18 (1) (2011)
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO (2011)
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. 18 (1) (2011)
Edward R. Scheinerman, Kimberly Tucker
Modeling graphs using dot product representations. Comput. Stat. 25 (1) (2010)
Elizabeth Perez Reilly, Edward R. Scheinerman
Random Threshold Graphs. Electron. J. Comb. 16 (1) (2009)
Stephen J. Young, Edward R. Scheinerman
Directed Random Dot Product Graphs. Internet Math. 5 (1) (2008)
Stephen J. Young, Edward R. Scheinerman
Random Dot Product Graph Models for Social Networks. WAW (2007)
Vitaly I. Voloshin, José Heber Nieto, Edward R. Scheinerman, Robin Chapman
Plucking Stirling Numbers from Trees: 10976. Am. Math. Mon. 111 (5) (2004)
Edward R. Scheinerman
Determining planar location via complement-free de Brujin sequences using discrete optical sensors. IEEE Trans. Robotics Autom. 17 (6) (2001)
David Stein, Gregory S. Chirikjian, Edward R. Scheinerman
Theory, Design, and Implementation of a Spherical Encoder. ICRA (2001)
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) (2000)
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. Discret. Math. 219 (1-3) (2000)
Edward R. Scheinerman
When Close Enough is Close Enough. Am. Math. Mon. 107 (6) (2000)
Edward R. Scheinerman, Ann N. Trenk
On the Fractional Intersection Number of a Graph. Graphs Comb. 15 (3) (1999)
Edward R. Scheinerman
Local representations using very short labels. Discret. Math. 203 (1-3) (1999)
Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito
Dot product representations of graphs. Discret. Math. 181 (1-3) (1998)
Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman
On fractional Ramsey numbers. Discret. Math. 176 (1-3) (1997)
Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman
On point-halfspace graphs. J. Graph Theory 20 (1) (1995)
Graham R. Brightwell, Edward R. Scheinerman
The dual of a circle order is not necessarilty a circle order. Ars Comb. 41 (1995)
Edward R. Scheinerman, Jennifer S. Zito
On the Size of Hereditary Classes of Graphs. J. Comb. Theory, Ser. B 61 (1) (1994)
Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman
Characterization and Recognition of Point-Halfspace and Related Orders. Graph Drawing (1994)
Motakuri V. Ramana, Edward R. Scheinerman, Daniel Ullman
Fractional isomorphism of graphs. Discret. Math. 132 (1-3) (1994)
Edward R. Scheinerman
Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp. Networks 24 (2) (1994)
Carsten Thomassen, Edward R. Scheinerman
Editorial. J. Graph Theory 18 (4) (1994)
Edward R. Scheinerman
A note on graphs and sphere orders. J. Graph Theory 17 (3) (1993)
Edward R. Scheinerman, Ann N. Trenk
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. Discret. Appl. Math. 44 (1-3) (1993)
Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman
Undirected Edge Geography. Theor. Comput. Sci. 112 (2) (1993)
Terry A. McKee, Edward R. Scheinerman
On the chordality of a graph. J. Graph Theory 17 (2) (1993)
Graham R. Brightwell, Edward R. Scheinerman
Representations of Planar Graphs. SIAM J. Discret. Math. 6 (2) (1993)
Noga Alon, Edward R. Scheinerman
Generalized sum graphs. Graphs Comb. 8 (1) (1992)
Edward R. Scheinerman
Generalized Chromatic Numbers of Random Graphs. SIAM J. Discret. Math. 5 (1) (1992)
Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman
On the thickness and arboricity of a graph. J. Comb. Theory, Ser. B 52 (1) (1991)
Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman
General results on tolerance intersection graphs. J. Graph Theory 15 (6) (1991)
Edward R. Scheinerman
A Note on Planar Graphs and Circle Orders. SIAM J. Discret. Math. 4 (3) (1991)
Fred R. McMorris, Edward R. Scheinerman
Connectivity threshold for random chordal graphs. Graphs Comb. 7 (2) (1991)
Aviezri S. Fraenkel, Edward R. Scheinerman
A deletion game on hypergraphs. Discret. Appl. Math. 30 (2-3) (1991)
Edward R. Scheinerman
On the Expected Capacity of Binomial and Random Concentrators. SIAM J. Comput. 19 (1) (1990)
Edward R. Scheinerman
On the interval number of random graphs. Discret. Math. 82 (1) (1990)
Edward R. Scheinerman
An evolution of interval graphs. Discret. Math. 82 (3) (1990)
Noga Alon, Meir Katchalski, Edward R. Scheinerman
Not All Graphs are Segment T-graphs. Eur. J. Comb. 11 (1) (1990)
Edward R. Scheinerman, John C. Wierman
Optimal and near-optimal broadcast in random graphs. Discret. Appl. Math. 25 (3) (1989)
Edward R. Scheinerman
Random interval graphs. Comb. 8 (4) (1988)
Edward R. Scheinerman
On the interval number of a chordal graph. J. Graph Theory 12 (3) (1988)
Edward R. Scheinerman
Irredundancy in multiple interval representations. Discret. Math. 63 (1) (1987)
Edward R. Scheinerman
The maximum interval number of graphs with given genus. J. Graph Theory 11 (3) (1987)
Edward R. Scheinerman
Almost Sure Fault Tolerance in Random Graphs. SIAM J. Comput. 16 (6) (1987)
Edward R. Scheinerman
Irrepresentability by multiple intersection, or why the interval number is unbounded. Discret. Math. 55 (2) (1985)
Edward R. Scheinerman
Characterizing intersection classes of graphs. Discret. Math. 55 (2) (1985)
Edward R. Scheinerman, Douglas B. West
The interval number of a planar graph: Three intervals suffice. J. Comb. Theory, Ser. B 35 (3) (1983)