Edward R. Scheinerman

发表

Modeling graphs using dot product representations

Edward R. Scheinerman, Kimberly Tucker, E. Scheinerman, 2010, Comput. Stat..

Theory, design, and implementation of a spherical encoder

Gregory S. Chirikjian, Edward R. Scheinerman, David Stein, 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

Editorial

Edward R. Scheinerman, Carsten Thomassen, 1994, J. Graph Theory.

Characterizing intersection classes of graphs

Edward R. Scheinerman, 1985, Discret. Math..

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

Edward R. Scheinerman, 1994, Networks.

Random interval graphs

Edward R. Scheinerman, E. Scheinerman, 1988, Comb..

On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection

Edward R. Scheinerman, Ann N. Trenk, 1993, Discret. Appl. Math..

Connectivity threshold for random chordal graphs

Fred R. McMorris, Edward R. Scheinerman, 1991, Graphs Comb..

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

Edward R. Scheinerman, 1985, Discret. Math..

Local representations using very short labels

Edward R. Scheinerman, 1999, Discret. Math..

When Close Enough Is Close Enough

Edward R. Scheinerman, E. Scheinerman, 2000, Am. Math. Mon..

On Vertex, Edge, and Vertex-Edge Random Graphs

Svante Janson, James Allen Fill, Edward R. Scheinerman, 2011, Electron. J. Comb..

General results on tolerance intersection graphs

Fred R. McMorris, Michael S. Jacobson, Edward R. Scheinerman, 1991, J. Graph Theory.

Characterization and Recognition of Point-Halfspace and Related Orders

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

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

Edward R. Scheinerman, E. Scheinerman, 2001, IEEE Trans. Robotics Autom..

Random Dot Product Graph Models for Social Networks

Edward R. Scheinerman, Stephen J. Young, Stephen J. Young, 2007, WAW.

A deletion game on hypergraphs

Edward R. Scheinerman, Aviezri S. Fraenkel, E. Scheinerman, 1991, Discret. Appl. Math..

Plucking Stirling Numbers from Trees: 10976

Vitaly I. Voloshin, Robin J. Chapman, José Heber Nieto, 2004, Am. Math. Mon..

On the thickness and arboricity of a graph

Edward R. Scheinerman, Joan P. Hutchinson, Alice M. Dean, 1991, J. Comb. Theory, Ser. B.

Irredundancy in multiple interval representations

Edward R. Scheinerman, 1987, Discret. Math..

Representations of Planar Graphs

Graham R. Brightwell, Edward R. Scheinerman, G. Brightwell, 1993, SIAM J. Discret. Math..

On the interval number of random graphs

Edward R. Scheinerman, 1990, Discret. Math..

Random Threshold Graphs

Edward R. Scheinerman, Elizabeth Perez Reilly, E. Scheinerman, 2009, Electron. J. Comb..

Dot product representations of graphs

Edward R. Scheinerman, Ann N. Trenk, Charles M. Fiduccia, 1998, Discret. Math..

An evolution of interval graphs

Edward R. Scheinerman, E. Scheinerman, 1990, Discret. Math..

Almost Sure Fault Tolerance in Random Graphs

Edward R. Scheinerman, 1987, SIAM J. Comput..

A note on graphs and sphere orders

Edward R. Scheinerman, E. Scheinerman, 1993, Journal of Graph Theory.

Dot Product Representations of Planar Graphs

László Lovász, Edward R. Scheinerman, Ross J. Kang, 2010, Electron. J. Comb..

The interval number of a planar graph: Three intervals suffice

Douglas B. West, Edward R. Scheinerman, 1983, J. Comb. Theory, Ser. B.

Directed Random Dot Product Graphs

Edward R. Scheinerman, Stephen J. Young, Stephen J. Young, 2008, Internet Math..

A Note on Planar Graphs and Circle Orders

Edward R. Scheinerman, E. Scheinerman, 1991, SIAM J. Discret. Math..

On the Fractional Intersection Number of a Graph

Edward R. Scheinerman, Ann N. Trenk, 1999, Graphs Comb..

On fractional Ramsey numbers

Michael S. Jacobson, Edward R. Scheinerman, Gregory M. Levin, 1997, Discret. Math..

On point-halfspace graphs

Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman, 1995, J. Graph Theory.

Undirected Edge Geography

Edward R. Scheinerman, Aviezri S. Fraenkel, Daniel Ullman, 1993, Theor. Comput. Sci..

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

Graham R. Brightwell, Edward R. Scheinerman, 1995, Ars Comb..

On the Size of Hereditary Classes of Graphs

Edward R. Scheinerman, Jennifer S. Zito, E. Scheinerman, 1994, J. Comb. Theory, Ser. B.

Graph Theory

Michael Doob, Paul K. Stockmeyer, András Gyárfás, 1999, Handbook of Discrete and Combinatorial Mathematics.

Not All Graphs are Segment T-graphs

Noga Alon, Edward R. Scheinerman, Meir Katchalski, 1990, Eur. J. Comb..

Optimal and near-optimal broadcast in random graphs

Edward R. Scheinerman, John C. Wierman, E. Scheinerman, 1989, Discret. Appl. Math..

Introduction To Discrete Mathematics

Edward R. Scheinerman, 2010 .

Generalized sum graphs

Noga Alon, Edward R. Scheinerman, 1992, Graphs Comb..

On the chordality of a graph

Terry A. McKee, Edward R. Scheinerman, T. McKee, 1993, J. Graph Theory.

Mathematics: A Discrete Introduction

Edward R. Scheinerman, 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, 2000, Random Struct. Algorithms.

On the interval number of a chordal graph

Edward R. Scheinerman, 1988, J. Graph Theory.

Invitation to Dynamical Systems

Edward R. Scheinerman, E. Scheinerman, 1995 .

Random Threshold Digraphs

Edward R. Scheinerman, Yiguang Zhang, Elizabeth Perez Reilly, 2009, Electron. J. Comb..

Fractional isomorphism of graphs

Edward R. Scheinerman, Daniel Ullman, Motakuri V. Ramana, 1994, Discret. Math..

On circle containment orders

Edward R. Scheinerman, John C. Wierman, E. Scheinerman, 1988 .

The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometri

Edward R. Scheinerman, Herbert S. Wilf, 1994 .

On Random Intersection Graphs: The Subgraph Problem

Edward R. Scheinerman, Karen B. Singer-Cohen, E. Scheinerman, 1999, Combinatorics, Probability and Computing.

Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models

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

Dot Product Representations of Planar Graphs

László Lovász, Edward R. Scheinerman, Ross J. Kang, 2011 .

Random intervals

Edward R. Scheinerman, P. Winkler, E. Scheinerman, 1990 .

Hamiltonian Closure in Random Graphs

Edward R. Scheinerman, John C. Wierman, Linda Lesniak, 1987 .

Fractional dimension of partial orders

Edward R. Scheinerman, Graham Brightwell, G. Brightwell, 1992 .

On the structure of hereditary classes of graphs

Edward R. Scheinerman, E. Scheinerman, 1986 .

Degrees of freedom versus dimension for containment orders

Noga Alon, Edward R. Scheinerman, N. Alon, 1988 .

Interval Representations of Cliques and of Subset Intersection Graphs a

Douglas B. West, Edward R. Scheinerman, 1989 .

Containment Graphs, Posets, and Related Classes of Graphs

Martin Charles Golumbic, Edward R. Scheinerman, M. Golumbic, 1989, ArXiv.