Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,984,629 papers from all fields of science
Search
Sign In
Create Free Account
Ed Scheinerman
Known as:
Edward Scheinerman
, Scheinerman
Edward R. Scheinerman is an American mathematician, specializing in graph theory and order theory. He is a professor of applied mathematics…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Graph theory
Planar graph
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Effective demand and Say’s law in Marxist theory: an evolutionary perspective
Tomás N. Rotta
2017
Corpus ID: 67761678
In this paper I theorize the roles of effective demand and Say’s Law in the Marxist theory of exploitation and accumulation. I…
Expand
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
2015
2015
1-string B1-VPG-representations of planar partial 3-trees and some subclasses
T. Biedl
,
Martin Derka
Canadian Conference on Computational Geometry
2015
Corpus ID: 15264389
Planar partial $3$-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree $3$ into a face…
Expand
2014
2014
1-string B2-VPG representation of planar graphs
T. Biedl
,
Martin Derka
Journal of Computational Geometry
2014
Corpus ID: 15841077
In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation---a string representation using paths in…
Expand
2014
2014
1-String CZ-Representation of Planar Graphs
T. Biedl
,
Martin Derka
arXiv.org
2014
Corpus ID: 1682123
In this paper, we prove that every planar 4-connected graph has a CZ-representation---a string representation using paths in a…
Expand
2013
2013
The Coupling Method for Inhomogeneous Random Intersection Graphs
K. Rybarczyk
Electronic Journal of Combinatorics
2013
Corpus ID: 10043146
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we apply the…
Expand
2011
2011
THE BRING-JERRARD QUINTIC EQUATION, ITS SOLUTIONS AND A FORMULA FOR THE UNIVERSAL GRAVITATIONAL CONSTANT
Edward Thabo Motlotle
2011
Corpus ID: 123606616
In this research the Bring-Jerrard quintic polynomial equation is investigated for a formula. Firstly, an explanation given as to…
Expand
2009
2009
Bidirectional Ballot Sequences, Random Walks, and a New Construction of MSTD Sets
Yufei Zhao
2009
Corpus ID: 54543787
We introduce bidirectional ballot sequences, which are 0-1 sequences where every prefix and every suffix contains more 1’s than 0…
Expand
2000
2000
The Independence Number of Random Interval Graphs
W. Fernandez
2000
Corpus ID: 118426288
It is proved, sharpening previous results of Scheinerman and by analysing an algorithm, that the independence number of the…
Expand
1995
1995
Close-to-optimal and Near-optimal Broadcasting in Random Graphs
A. Gerbessiotis
Discrete Applied Mathematics
1995
Corpus ID: 9291485
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE