Edward R. Scheinerman
Orcid: 0000-0003-4124-7838Affiliations:
- Johns Hopkins University, USA
According to our database1,
Edward R. Scheinerman
authored at least 56 papers
between 1983 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on ams.jhu.edu
On csauthors.net:
Bibliography
2023
Am. Math. Mon., July, 2023
2022
2019
2014
2011
2010
2009
A Simple Complex Analysis and an Advanced Calculus Proof of the Fundamental Theorem of Algebra.
Am. Math. Mon., 2009
2008
2007
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007
2004
2001
Determining planar location via complement-free de Brujin sequences using discrete optical sensors.
IEEE Trans. Robotics Autom., 2001
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001
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.
Random Struct. Algorithms, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
1998
1997
1995
The dual of a circle order is not necessarilty a circle order.
Ars Comb., 1995
1994
Foundations of applied combinatorics, by Edward A. Bender and S. Gil Williamson, Addison-Wesley, Reading, MA, 1991, 425 pp.
Networks, 1994
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
1993
Discret. Appl. Math., 1993
1992
1991
1990
1989
1988
1987
1985
Irrepresentability by multiple intersection, or why the interval number is unbounded.
Discret. Math., 1985
1983
J. Comb. Theory B, 1983