default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanley M. Selkow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j32]András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow:
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. Graphs Comb. 31(1): 131-140 (2015)- 2013
- [j31]Gábor N. Sárközy, Stanley M. Selkow, Fei Song:
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs. J. Graph Theory 73(2): 127-145 (2013) - 2011
- [j30]Gábor N. Sárközy, Stanley M. Selkow, Fei Song:
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs. Discret. Math. 311(18-19): 2079-2084 (2011) - 2010
- [j29]András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow:
Ramsey-type results for Gallai colorings. J. Graph Theory 64(3): 233-243 (2010)
2000 – 2009
- 2009
- [b1]George T. Heineman, Gary Pollice, Stanley M. Selkow:
Algorithms in a nutshell - a desktop quick reference. O'Reilly 2009, ISBN 978-0-596-51624-6, pp. I-XV, 1-343 - 2008
- [j28]Gábor N. Sárközy, Stanley M. Selkow:
Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discret. Math. 308(23): 5757-5770 (2008) - [j27]Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow:
Inequalities for the first-fit chromatic number. J. Graph Theory 59(1): 75-88 (2008) - 2006
- [j26]Gábor N. Sárközy, Stanley M. Selkow:
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós. J. Graph Theory 52(2): 147-156 (2006) - 2005
- [j25]Gábor N. Sárközy, Stanley M. Selkow:
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós. Discret. Math. 297(1-3): 190-195 (2005) - 2004
- [j24]Gábor N. Sárközy, Stanley M. Selkow:
An Extension Of The Ruzsa-Szemerédi Theorem. Comb. 25(1): 77-84 (2004) - [j23]Daniel J. Dougherty, Stanley M. Selkow:
The complexity of the certification of properties of Stable Marriage. Inf. Process. Lett. 92(6): 275-277 (2004) - 2003
- [j22]Gábor N. Sárközy, Stanley M. Selkow:
On bipartite generalized Ramsey theory. Ars Comb. 68 (2003) - [j21]Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi:
On the number of Hamiltonian cycles in Dirac graphs. Discret. Math. 265(1-3): 237-250 (2003) - [j20]Gábor N. Sárközy, Stanley M. Selkow:
An application of the regularity lemma in generalized Ramsey theory. J. Graph Theory 44(1): 39-49 (2003) - 2001
- [j19]Gábor N. Sárközy, Stanley M. Selkow:
On Edge Colorings with at Least q Colors in Every Subset of p Vertices. Electron. J. Comb. 8(1) (2001) - 2000
- [j18]Gábor N. Sárközy, Stanley M. Selkow:
Vertex Partitions by Connected Monochromatic k-Regular Graphs. J. Comb. Theory B 78(1): 115-122 (2000)
1990 – 1999
- 1999
- [j17]Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow:
Counting irregular multigraphs. Discret. Math. 195(1-3): 235-237 (1999) - [j16]Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow:
On k-ordered Hamiltonian graphs. J. Graph Theory 32(1): 17-25 (1999) - 1998
- [j15]Stanley M. Selkow:
The enumeration of labeled graphs by number of cutpoints. Discret. Math. 185(1-3): 183-191 (1998) - 1997
- [j14]Steve Taylor, Nabil I. Hachem, Stanley M. Selkow:
The Average Height of a Node in the BANG Abstract Directory Tree. Inf. Process. Lett. 61(1): 55-61 (1997) - 1996
- [j13]Claude A. Christen, Giovanni Coray, Stanley M. Selkow:
A characterization of n-component graphs. Discret. Math. 149(1-3): 279-281 (1996) - 1994
- [j12]Stanley M. Selkow:
A Probabilistic lower bound on the independence number of graphs. Discret. Math. 132(1-3): 363-365 (1994) - 1993
- [j11]Stanley M. Selkow:
The independence number of graphs in terms of degrees. Discret. Math. 122(1-3): 343-348 (1993) - 1990
- [j10]O. J. Murphy, Stanley M. Selkow:
Finding Nearest Neighbors with Voronoi Tessellations. Inf. Process. Lett. 34(1): 37-41 (1990)
1980 – 1989
- 1986
- [j9]O. J. Murphy, Stanley M. Selkow:
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. Inf. Process. Lett. 23(4): 215-218 (1986) - 1981
- [j8]Charles E. Hughes
, Stanley M. Selkow:
The Finite Power Property for Context-Free Languages. Theor. Comput. Sci. 15: 111-114 (1981) - 1980
- [j7]László Babai, Paul Erdös, Stanley M. Selkow:
Random Graph Isomorphism. SIAM J. Comput. 9(3): 628-635 (1980)
1970 – 1979
- 1979
- [j6]Claude A. Christen, Stanley M. Selkow:
Some perfect coloring properties of graphs. J. Comb. Theory B 27(1): 49-59 (1979) - 1978
- [j5]Stanley M. Selkow:
New Bounds for the Clique Number of a Graph. Inf. Process. Lett. 7(4): 173-174 (1978) - 1977
- [j4]Stanley M. Selkow:
The Tree-to-Tree Editing Problem. Inf. Process. Lett. 6(6): 184-186 (1977) - 1974
- [j3]Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart:
Cost-minimal trees in directed acyclic graphs. Z. Oper. Research 18(1): 59-67 (1974) - [j2]Stanley M. Selkow:
Diagnostic Keys as a Representation for Context in Pattern Recognition. IEEE Trans. Computers 23(9): 970-971 (1974) - 1972
- [j1]Stanley M. Selkow:
One-Pass Complexity of Digital Picture Properties. J. ACM 19(2): 283-295 (1972)
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 21:27 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:
