Edward R. Scheinerman

53 papers A* 1A 1C 1Journal 48Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
Finding a Compositional Square Root of Sine.
Am. Math. Mon.
Tongtong Chen, Edward R. Scheinerman
2019 J jnl
Containment Graphs, Posets, and Related Classes of Graphs.
CoRR
Martin Charles Golumbic, Edward R. Scheinerman
2014 J jnl
Random Threshold Digraphs.
Electron. J. Comb.
Elizabeth Perez Reilly, Edward R. Scheinerman, Yiguang Zhang
2011 J jnl
Dot Product Representations of Planar Graphs.
Electron. J. Comb.
Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman
2011 J jnl
On Vertex, Edge, and Vertex-Edge Random Graphs.
Electron. J. Comb.
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
2011 — conf
On Vertex, Edge, and Vertex-edge Random Graphs.
ANALCO
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
2010 J jnl
Modeling graphs using dot product representations.
Comput. Stat.
Edward R. Scheinerman, Kimberly Tucker
2009 J jnl
Random Threshold Graphs.
Electron. J. Comb.
Elizabeth Perez Reilly, Edward R. Scheinerman
2008 J jnl
Directed Random Dot Product Graphs.
Internet Math.
Stephen J. Young, Edward R. Scheinerman
2007 C conf
Random Dot Product Graph Models for Social Networks.
WAW
Stephen J. Young, Edward R. Scheinerman
2004 J jnl
Plucking Stirling Numbers from Trees: 10976.
Am. Math. Mon.
Vitaly I. Voloshin, José Heber Nieto, Edward R. Scheinerman, Robin Chapman
2001 J jnl
Determining planar location via complement-free de Brujin sequences using discrete optical sensors.
IEEE Trans. Robotics Autom.
Edward R. Scheinerman
2001 A* conf
Theory, Design, and Implementation of a Spherical Encoder.
ICRA
David Stein, Gregory S. Chirikjian, Edward R. Scheinerman
2000 J jnl
Clique covering the edges of a locally cobipartite graph.
Discret. Math.
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang
2000 J jnl
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
James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen
2000 J jnl
When Close Enough is Close Enough.
Am. Math. Mon.
Edward R. Scheinerman
1999 — ch.
Graph Theory.
Handbook of Discrete and Combinatorial Mathematics
Lowell W. Beineke, Stephen B. Maurer, Edward R. Scheinerman, Bennet Manvel, Arthur T. White, Paul K. Stockmeyer, Michael Doob, Stefan A. Burr, András Gyárfás
1999 J jnl
Local representations using very short labels.
Discret. Math.
Edward R. Scheinerman
1999 J jnl
On the Fractional Intersection Number of a Graph.
Graphs Comb.
Edward R. Scheinerman, Ann N. Trenk
1998 J jnl
Dot product representations of graphs.
Discret. Math.
Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito
1997 J jnl
On fractional Ramsey numbers.
Discret. Math.
Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman
1995 J jnl
On point-halfspace graphs.
J. Graph Theory
Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman
1995 J jnl
The dual of a circle order is not necessarilty a circle order.
Ars Comb.
Graham R. Brightwell, Edward R. Scheinerman
1994 A conf
Characterization and Recognition of Point-Halfspace and Related Orders.
GD
Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman
1994 J jnl
Editorial.
J. Graph Theory
Carsten Thomassen, Edward R. Scheinerman
1994 J jnl
Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp.
Networks
Edward R. Scheinerman
1994 J jnl
Fractional isomorphism of graphs.
Discret. Math.
Motakuri V. Ramana, Edward R. Scheinerman, Daniel Ullman
1994 J jnl
On the Size of Hereditary Classes of Graphs.
J. Comb. Theory B
Edward R. Scheinerman, Jennifer S. Zito
1993 J jnl
A note on graphs and sphere orders.
J. Graph Theory
Edward R. Scheinerman
1993 J jnl
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection.
Discret. Appl. Math.
Edward R. Scheinerman, Ann N. Trenk
1993 J jnl
On the chordality of a graph.
J. Graph Theory
Terry A. McKee, Edward R. Scheinerman
1993 J jnl
Representations of Planar Graphs.
SIAM J. Discret. Math.
Graham R. Brightwell, Edward R. Scheinerman
1993 J jnl
Undirected Edge Geography.
Theor. Comput. Sci.
Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman
1992 J jnl
Generalized Chromatic Numbers of Random Graphs.
SIAM J. Discret. Math.
Edward R. Scheinerman
1992 J jnl
Generalized sum graphs.
Graphs Comb.
Noga Alon, Edward R. Scheinerman
1991 J jnl
A Note on Planar Graphs and Circle Orders.
SIAM J. Discret. Math.
Edward R. Scheinerman
1991 J jnl
A deletion game on hypergraphs.
Discret. Appl. Math.
Aviezri S. Fraenkel, Edward R. Scheinerman
1991 J jnl
Connectivity threshold for random chordal graphs.
Graphs Comb.
Fred R. McMorris, Edward R. Scheinerman
1991 J jnl
General results on tolerance intersection graphs.
J. Graph Theory
Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman
1991 J jnl
On the thickness and arboricity of a graph.
J. Comb. Theory B
Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman
1990 J jnl
An evolution of interval graphs.
Discret. Math.
Edward R. Scheinerman
1990 J jnl
Not All Graphs are Segment T-graphs.
Eur. J. Comb.
Noga Alon, Meir Katchalski, Edward R. Scheinerman
1990 J jnl
On the Expected Capacity of Binomial and Random Concentrators.
SIAM J. Comput.
Edward R. Scheinerman
1990 J jnl
On the interval number of random graphs.
Discret. Math.
Edward R. Scheinerman
1989 J jnl
Optimal and near-optimal broadcast in random graphs.
Discret. Appl. Math.
Edward R. Scheinerman, John C. Wierman
1988 J jnl
On the interval number of a chordal graph.
J. Graph Theory
Edward R. Scheinerman
1988 J jnl
Random interval graphs.
Comb.
Edward R. Scheinerman
1987 J jnl
Almost Sure Fault Tolerance in Random Graphs.
SIAM J. Comput.
Edward R. Scheinerman
1987 J jnl
Irredundancy in multiple interval representations.
Discret. Math.
Edward R. Scheinerman
1987 J jnl
The maximum interval number of graphs with given genus.
J. Graph Theory
Edward R. Scheinerman
1985 J jnl
Characterizing intersection classes of graphs.
Discret. Math.
Edward R. Scheinerman
1985 J jnl
Irrepresentability by multiple intersection, or why the interval number is unbounded.
Discret. Math.
Edward R. Scheinerman
1983 J jnl
The interval number of a planar graph: Three intervals suffice.
J. Comb. Theory B
Edward R. Scheinerman, Douglas B. West