default search action
Edward R. Scheinerman
Person information
- affiliation: Johns Hopkins University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j51]Ed Scheinerman
:
A Third Real Solution to x=x-1, Not Really. Am. Math. Mon. 130(6): 514 (2023) - 2022
- [j50]Tongtong Chen, Edward R. Scheinerman
Finding a Compositional Square Root of Sine. Am. Math. Mon. 129(9): 816-830 (2022)
2010 – 2019
- 2019
- [i1]Martin Charles Golumbic, Edward R. Scheinerman:
Containment Graphs, Posets, and Related Classes of Graphs. CoRR abs/1907.07414 (2019) - 2014
- [j49]Elizabeth Perez Reilly, Edward R. Scheinerman, Yiguang Zhang:
Random Threshold Digraphs. Electron. J. Comb. 21(2): 2 (2014) - 2011
- [j48]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. 18(1) (2011) - [j47]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) - [c4]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO 2011: 16-22 - 2010
- [j46]Edward R. Scheinerman, Kimberly Tucker:
Modeling graphs using dot product representations. Comput. Stat. 25(1): 1-16 (2010)
2000 – 2009
- 2009
- [j45]Elizabeth Perez Reilly, Edward R. Scheinerman:
Random Threshold Graphs. Electron. J. Comb. 16(1) (2009) - [j44]Ed Scheinerman, Anton R. Schep:
A Simple Complex Analysis and an Advanced Calculus Proof of the Fundamental Theorem of Algebra. Am. Math. Mon. 116(1): 67-68 (2009) - 2008
- [j43]Stephen J. Young
Directed Random Dot Product Graphs. Internet Math. 5(1): 91-111 (2008) - [j42]Ed Scheinerman, Christian Blatter:
Four Shots for a Convex Quadrilateral. Am. Math. Mon. 115(9): 837-843 (2008) - [j41]Ed Scheinerman, Thomas J. Pickett, Ann Coleman:
Another Continued Fraction for π. Am. Math. Mon. 115(10): 930-933 (2008) - 2007
- [c3]Stephen J. Young, Edward R. Scheinerman:
Random Dot Product Graph Models for Social Networks. WAW 2007: 138-149 - 2004
- [j40]Vitaly I. Voloshin, José Heber Nieto, Edward R. Scheinerman, Robin Chapman:
Plucking Stirling Numbers from Trees: 10976. Am. Math. Mon. 111(5): 444-445 (2004) - 2001
- [j39]Edward R. Scheinerman:
Determining planar location via complement-free de Brujin sequences using discrete optical sensors. IEEE Trans. Robotics Autom. 17(6): 883-889 (2001) - [c2]David Stein, Gregory S. Chirikjian, Edward R. Scheinerman:
Theory, Design, and Implementation of a Spherical Encoder. ICRA 2001: 1773-1779 - 2000
- [j38]Guantao Chen, Michael S. Jacobson, André E. Kézdy
Clique covering the edges of a locally cobipartite graph. Discret. Math. 219(1-3): 17-26 (2000) - [j37]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) - [j36]Edward R. Scheinerman:
When Close Enough is Close Enough. Am. Math. Mon. 107(6): 489-499 (2000)
1990 – 1999
- 1999
- [j35]Edward R. Scheinerman:
Local representations using very short labels. Discret. Math. 203(1-3): 287-290 (1999) - [j34]Edward R. Scheinerman, Ann N. Trenk:
On the Fractional Intersection Number of a Graph. Graphs Comb. 15(3): 341-351 (1999) - [r1]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:
Graph Theory. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j33]Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito:
Dot product representations of graphs. Discret. Math. 181(1-3): 113-138 (1998) - 1997
- [j32]Michael S. Jacobson, Gregory M. Levin, Edward R. Scheinerman:
On fractional Ramsey numbers. Discret. Math. 176(1-3): 159-175 (1997) - 1995
- [j31]Graham R. Brightwell, Edward R. Scheinerman:
The dual of a circle order is not necessarilty a circle order. Ars Comb. 41 (1995) - [j30]Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman:
On point-halfspace graphs. J. Graph Theory 20(1): 19-35 (1995) - 1994
- [j29]Motakuri V. Ramana, Edward R. Scheinerman, Daniel Ullman:
Fractional isomorphism of graphs. Discret. Math. 132(1-3): 247-265 (1994) - [j28]Edward R. Scheinerman, Jennifer S. Zito:
On the Size of Hereditary Classes of Graphs. J. Comb. Theory B 61(1): 16-39 (1994) - [j27]Carsten Thomassen, Edward R. Scheinerman:
Editorial. J. Graph Theory 18(4): 323 (1994) - [j26]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): 125-126 (1994) - [c1]Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman:
Characterization and Recognition of Point-Halfspace and Related Orders. GD 1994: 234-245 - 1993
- [j25]Edward R. Scheinerman, Ann N. Trenk:
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. Discret. Appl. Math. 44(1-3): 233-245 (1993) - [j24]Terry A. McKee, Edward R. Scheinerman:
On the chordality of a graph. J. Graph Theory 17(2): 221-232 (1993) - [j23]Edward R. Scheinerman:
A note on graphs and sphere orders. J. Graph Theory 17(3): 283-289 (1993) - [j22]Graham R. Brightwell, Edward R. Scheinerman:
Representations of Planar Graphs. SIAM J. Discret. Math. 6(2): 214-229 (1993) - [j21]Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman:
Undirected Edge Geography. Theor. Comput. Sci. 112(2): 371-381 (1993) - 1992
- [j20]Noga Alon, Edward R. Scheinerman:
Generalized sum graphs. Graphs Comb. 8(1): 23-29 (1992) - [j19]Edward R. Scheinerman:
Generalized Chromatic Numbers of Random Graphs. SIAM J. Discret. Math. 5(1): 74-80 (1992) - 1991
- [j18]Aviezri S. Fraenkel, Edward R. Scheinerman:
A deletion game on hypergraphs. Discret. Appl. Math. 30(2-3): 155-162 (1991) - [j17]Fred R. McMorris, Edward R. Scheinerman:
Connectivity threshold for random chordal graphs. Graphs Comb. 7(2): 177-181 (1991) - [j16]Alice M. Dean, Joan P. Hutchinson, Edward R. Scheinerman:
On the thickness and arboricity of a graph. J. Comb. Theory B 52(1): 147-151 (1991) - [j15]Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman:
General results on tolerance intersection graphs. J. Graph Theory 15(6): 573-577 (1991) - [j14]Edward R. Scheinerman:
A Note on Planar Graphs and Circle Orders. SIAM J. Discret. Math. 4(3): 448-451 (1991) - 1990
- [j13]Edward R. Scheinerman:
On the interval number of random graphs. Discret. Math. 82(1): 105-109 (1990) - [j12]Edward R. Scheinerman:
An evolution of interval graphs. Discret. Math. 82(3): 287-302 (1990) - [j11]Noga Alon, Meir Katchalski, Edward R. Scheinerman:
Not All Graphs are Segment T-graphs. Eur. J. Comb. 11(1): 7-13 (1990) - [j10]Edward R. Scheinerman:
On the Expected Capacity of Binomial and Random Concentrators. SIAM J. Comput. 19(1): 156-163 (1990)
1980 – 1989
- 1989
- [j9]Edward R. Scheinerman, John C. Wierman:
Optimal and near-optimal broadcast in random graphs. Discret. Appl. Math. 25(3): 289-297 (1989) - 1988
- [j8]Edward R. Scheinerman:
Random interval graphs. Comb. 8(4): 357-371 (1988) - [j7]Edward R. Scheinerman:
On the interval number of a chordal graph. J. Graph Theory 12(3): 311-316 (1988) - 1987
- [j6]Edward R. Scheinerman:
Irredundancy in multiple interval representations. Discret. Math. 63(1): 101-108 (1987) - [j5]Edward R. Scheinerman:
The maximum interval number of graphs with given genus. J. Graph Theory 11(3): 441-446 (1987) - [j4]Edward R. Scheinerman:
Almost Sure Fault Tolerance in Random Graphs. SIAM J. Comput. 16(6): 1124-1134 (1987) - 1985
- [j3]Edward R. Scheinerman:
Characterizing intersection classes of graphs. Discret. Math. 55(2): 185-193 (1985) - [j2]Edward R. Scheinerman:
Irrepresentability by multiple intersection, or why the interval number is unbounded. Discret. Math. 55(2): 195-211 (1985) - 1983
- [j1]Edward R. Scheinerman, Douglas B. West:
The interval number of a planar graph: Three intervals suffice. J. Comb. Theory B 35(3): 224-239 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: