Stanley M. Selkow

1.4k total citations
37 papers, 795 citations indexed

About

Stanley M. Selkow is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Stanley M. Selkow has authored 37 papers receiving a total of 795 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 19 papers in Discrete Mathematics and Combinatorics and 11 papers in Geometry and Topology. Recurrent topics in Stanley M. Selkow's work include Advanced Graph Theory Research (21 papers), Limits and Structures in Graph Theory (18 papers) and Graph Labeling and Dimension Problems (7 papers). Stanley M. Selkow is often cited by papers focused on Advanced Graph Theory Research (21 papers), Limits and Structures in Graph Theory (18 papers) and Graph Labeling and Dimension Problems (7 papers). Stanley M. Selkow collaborates with scholars based in United States, Canada and Hungary. Stanley M. Selkow's co-authors include Gábor N. Sárközy, László Babai, H. A. Kierstead, András Sebö, Nathaniel Stewart, George T. Heineman, Endre Szemerédi, Owen Murphy, András Gyárfás and Fei Song and has published in prestigious journals such as Journal of Theoretical Biology, Journal of the ACM and IEEE Transactions on Computers.

In The Last Decade

Stanley M. Selkow

36 papers receiving 716 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Stanley M. Selkow United States 13 416 245 242 156 134 37 795
George Havas Australia 14 181 0.4× 283 1.2× 250 1.0× 153 1.0× 94 0.7× 62 610
Feodor F. Dragan United States 20 781 1.9× 86 0.4× 147 0.6× 245 1.6× 275 2.1× 82 1.0k
C. Pandu Rangan India 17 608 1.5× 306 1.2× 73 0.3× 65 0.4× 344 2.6× 102 901
Stanisław Radziszowski United States 13 371 0.9× 196 0.8× 347 1.4× 241 1.5× 53 0.4× 80 660
R. C. Mullin Canada 19 293 0.7× 734 3.0× 267 1.1× 124 0.8× 79 0.6× 59 1.3k
Ivan Rival Canada 23 1.1k 2.6× 150 0.6× 214 0.9× 326 2.1× 155 1.2× 123 1.6k
Shmuel Zaks Israel 18 407 1.0× 215 0.9× 154 0.6× 36 0.2× 691 5.2× 109 1.2k
Michał Pilipczuk Poland 14 1.3k 3.1× 203 0.8× 217 0.9× 89 0.6× 456 3.4× 101 1.5k
D. H. Younger Canada 8 350 0.8× 493 2.0× 60 0.2× 39 0.3× 94 0.7× 17 817
Pinar Heggernes Norway 16 790 1.9× 106 0.4× 122 0.5× 100 0.6× 328 2.4× 90 940

Countries citing papers authored by Stanley M. Selkow

Since Specialization
Citations

This map shows the geographic impact of Stanley M. Selkow's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stanley M. Selkow with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stanley M. Selkow more than expected).

Fields of papers citing papers by Stanley M. Selkow

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stanley M. Selkow. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stanley M. Selkow. The network helps show where Stanley M. Selkow may publish in the future.

Co-authorship network of co-authors of Stanley M. Selkow

This figure shows the co-authorship network connecting the top 25 collaborators of Stanley M. Selkow. A scholar is included among the top collaborators of Stanley M. Selkow based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stanley M. Selkow. Stanley M. Selkow is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gyárfás, András, Gábor N. Sárközy, & Stanley M. Selkow. (2013). Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. Graphs and Combinatorics. 31(1). 131–140. 7 indexed citations
2.
Sárközy, Gábor N., Stanley M. Selkow, & Fei Song. (2011). Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs. Discrete Mathematics. 311(18-19). 2079–2084. 2 indexed citations
3.
Sárközy, Gábor N. & Stanley M. Selkow. (2008). Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discrete Mathematics. 308(23). 5757–5770. 10 indexed citations
4.
Heineman, George T., et al.. (2008). Algorithms in a Nutshell. CERN Document Server (European Organization for Nuclear Research). 30 indexed citations
5.
Richardson, Candice, et al.. (2007). BUILDING INTELLIGENT TUTORING SYSTEMS. Nursing times. 84(37). 69–71. 5 indexed citations
6.
Sárközy, Gábor N. & Stanley M. Selkow. (2005). On a Turán-type hypergraph problem of Brown, Erdős and T. Sós. Discrete Mathematics. 297(1-3). 190–195. 12 indexed citations
7.
Sárközy, Gábor N. & Stanley M. Selkow. (2003). On bipartite generalized Ramsey theory.. Ars Combinatoria. 68. 2 indexed citations
8.
Sárközy, Gábor N. & Stanley M. Selkow. (2003). On a question of Gowers concerning isosceles right-angle triangles. Digital WPI. 3 indexed citations
9.
Sárközy, Gábor N., Stanley M. Selkow, & Endre Szemerédi. (2003). On the number of Hamiltonian cycles in Dirac graphs. Discrete Mathematics. 265(1-3). 237–250. 20 indexed citations
10.
Sárközy, Gábor N. & Stanley M. Selkow. (2000). Vertex Partitions by Connected Monochromatic k-Regular Graphs. Journal of Combinatorial Theory Series B. 78(1). 115–122. 11 indexed citations
11.
Sárközy, Gábor N. & Stanley M. Selkow. (2000). On Edge Colorings with at Least q Colors in Every Subset of p Vertices. The Electronic Journal of Combinatorics. 8(1). 12 indexed citations
12.
Kierstead, H. A., et al.. (1999). Onk-ordered Hamiltonian graphs. Journal of Graph Theory. 32(1). 17–25. 24 indexed citations
13.
Selkow, Stanley M.. (1998). The enumeration of labeled graphs by number of cutpoints. Discrete Mathematics. 185(1-3). 183–191. 3 indexed citations
14.
Selkow, Stanley M.. (1994). A Probabilistic lower bound on the independence number of graphs. Discrete Mathematics. 132(1-3). 363–365. 17 indexed citations
15.
Selkow, Stanley M.. (1993). The independence number of graphs in terms of degrees. Discrete Mathematics. 122(1-3). 343–348. 9 indexed citations
16.
Hughes, Charles E. & Stanley M. Selkow. (1981). The finite power property for context-free languages. Theoretical Computer Science. 15(1). 111–114. 1 indexed citations
17.
Garfinkel, Robert & Stanley M. Selkow. (1981). On Some Conjectures of Gould on the Parities of the Binomial Coefficients. ˜The œFibonacci quarterly. 19(1). 61–63. 1 indexed citations
18.
Babai, László, et al.. (1980). Random Graph Isomorphism. SIAM Journal on Computing. 9(3). 628–635. 136 indexed citations
19.
Selkow, Stanley M., et al.. (1979). Some perfect coloring properties of graphs. Journal of Combinatorial Theory Series B. 27(1). 49–59. 51 indexed citations
20.
Selkow, Stanley M., et al.. (1973). The enumeration of minimal phylograms. Bulletin of Mathematical Biology. 35(4). 525–533. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026