Edward R. Scheinerman

According to our database, Edward R. Scheinerman authored at least 56 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

A Third Real Solution to <i>x</i>=<i>x</i>^-1, Not Really.

Ed Scheinerman

Am. Math. Mon., July, 2023

2022

Finding a Compositional Square Root of Sine.

Tongtong Chen, Edward R. Scheinerman

Am. Math. Mon., 2022

2019

Containment Graphs, Posets, and Related Classes of Graphs.

Martin Charles Golumbic, Edward R. Scheinerman

CoRR, 2019

2014

Random Threshold Digraphs.

Elizabeth Perez Reilly, Edward R. Scheinerman, Yiguang Zhang

Electron. J. Comb., 2014

2011

Dot Product Representations of Planar Graphs.

Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman

Electron. J. Comb., 2011

On Vertex, Edge, and Vertex-Edge Random Graphs.

Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman

Electron. J. Comb., 2011

2010

Modeling graphs using dot product representations.

Edward R. Scheinerman, Kimberly Tucker

Comput. Stat., 2010

2009

A Simple Complex Analysis and an Advanced Calculus Proof of the Fundamental Theorem of Algebra.

Ed Scheinerman, Anton R. Schep

Am. Math. Mon., 2009

Random Threshold Graphs.

Elizabeth Perez Reilly, Edward R. Scheinerman

Electron. J. Comb., 2009

2008

Another Continued Fraction for π.

Ed Scheinerman, Thomas J. Pickett, Ann Coleman

Am. Math. Mon., 2008

Four Shots for a Convex Quadrilateral.

Ed Scheinerman, Christian Blatter

Am. Math. Mon., 2008

Directed Random Dot Product Graphs.

Stephen J. Young, Edward R. Scheinerman

Internet Math., 2008

2007

Random Dot Product Graph Models for Social Networks.

Stephen J. Young, Edward R. Scheinerman

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

2004

Plucking Stirling Numbers from Trees: 10976.

Vitaly I. Voloshin, José Heber Nieto, Edward R. Scheinerman, Robin Chapman

Am. Math. Mon., 2004

2001

Determining planar location via complement-free de Brujin sequences using discrete optical sensors.

Edward R. Scheinerman

IEEE Trans. Robotics Autom., 2001

Theory, Design, and Implementation of a Spherical Encoder.

David Stein, Gregory S. Chirikjian, Edward R. Scheinerman

Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000

When Close Enough is Close Enough.

Edward R. Scheinerman

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.

James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen

Random Struct. Algorithms, 2000

Clique covering the edges of a locally cobipartite graph.

Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang

Discret. Math., 2000

1999

Graph Theory.

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

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

On the Fractional Intersection Number of a Graph.

Edward R. Scheinerman, Ann N. Trenk

Graphs Comb., 1999

Local representations using very short labels.

Edward R. Scheinerman

Discret. Math., 1999

1998

Dot product representations of graphs.

Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito

Discret. Math., 1998

1997

On fractional Ramsey numbers.

Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman

Discret. Math., 1997

1995

On point-halfspace graphs.

Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman

J. Graph Theory, 1995

The dual of a circle order is not necessarilty a circle order.

Graham R. Brightwell, Edward R. Scheinerman

Ars Comb., 1995

1994

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

Edward R. Scheinerman

Networks, 1994

Editorial.

Carsten Thomassen, Edward R. Scheinerman

J. Graph Theory, 1994

On the Size of Hereditary Classes of Graphs.

Edward R. Scheinerman, Jennifer S. Zito

J. Comb. Theory, Ser. B, 1994

Fractional isomorphism of graphs.

Motakuri V. Ramana, Edward R. Scheinerman, Daniel Ullman

Discret. Math., 1994

Characterization and Recognition of Point-Halfspace and Related Orders.

Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Undirected Edge Geography.

Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman

Theor. Comput. Sci., 1993

Representations of Planar Graphs.

Graham R. Brightwell, Edward R. Scheinerman

SIAM J. Discret. Math., 1993

A note on graphs and sphere orders.

Edward R. Scheinerman

J. Graph Theory, 1993

On the chordality of a graph.

Terry A. McKee, Edward R. Scheinerman

J. Graph Theory, 1993

On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection.

Edward R. Scheinerman, Ann N. Trenk

Discret. Appl. Math., 1993

1992

Generalized Chromatic Numbers of Random Graphs.

Edward R. Scheinerman

SIAM J. Discret. Math., 1992

Generalized sum graphs.

Noga Alon, Edward R. Scheinerman

Graphs Comb., 1992

1991

A Note on Planar Graphs and Circle Orders.

Edward R. Scheinerman

SIAM J. Discret. Math., 1991

General results on tolerance intersection graphs.

Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman

J. Graph Theory, 1991

On the thickness and arboricity of a graph.

Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman

J. Comb. Theory, Ser. B, 1991

Connectivity threshold for random chordal graphs.

Fred R. McMorris, Edward R. Scheinerman

Graphs Comb., 1991

A deletion game on hypergraphs.

Aviezri S. Fraenkel, Edward R. Scheinerman

Discret. Appl. Math., 1991

1990

On the Expected Capacity of Binomial and Random Concentrators.

Edward R. Scheinerman

SIAM J. Comput., 1990

Not All Graphs are Segment T-graphs.

Noga Alon, Meir Katchalski, Edward R. Scheinerman

Eur. J. Comb., 1990

An evolution of interval graphs.

Edward R. Scheinerman

Discret. Math., 1990

On the interval number of random graphs.

Edward R. Scheinerman

Discret. Math., 1990

1989

Optimal and near-optimal broadcast in random graphs.

Edward R. Scheinerman, John C. Wierman

Discret. Appl. Math., 1989

1988

On the interval number of a chordal graph.

Edward R. Scheinerman

J. Graph Theory, 1988

Random interval graphs.

Edward R. Scheinerman

Comb., 1988

1987

Almost Sure Fault Tolerance in Random Graphs.

Edward R. Scheinerman

SIAM J. Comput., 1987

The maximum interval number of graphs with given genus.

Edward R. Scheinerman

J. Graph Theory, 1987

Irredundancy in multiple interval representations.

Edward R. Scheinerman

Discret. Math., 1987

1985

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

Edward R. Scheinerman

Discret. Math., 1985

Characterizing intersection classes of graphs.

Edward R. Scheinerman

Discret. Math., 1985

1983

The interval number of a planar graph: Three intervals suffice.

Edward R. Scheinerman, Douglas B. West

J. Comb. Theory, Ser. B, 1983