Stanley M. Selkow
- Computational Theory and Mathematics top 1%
- Artificial Intelligence top 5%
- Discrete Mathematics and Combinatorics top 2%
- Geometry and Topology top 5%
- Computer Networks and Communications top 10%
- Co-authors
- Gábor N. SárközyLászló BabaiH. A. KiersteadNathaniel StewartAndrás SeböGeorge T. HeinemanEndre SzemerédiOwen Murphy
- Topics
- Advanced Graph Theory Research (21 papers)Limits and Structures in Graph Theory (18 papers)Graph Labeling and Dimension Problems (7 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- United StatesCanadaHungary
In The Last Decade
Stanley M. Selkow
36 papers receiving 716 citations
Peers
Comparison fields: 5 of 73
- Computational Theory and Mathematics 416
- Artificial Intelligence 245
- Discrete Mathematics and Combinatorics 242
- Geometry and Topology 156
- Computer Networks and Communications 134
Countries citing papers authored by Stanley M. Selkow
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | 2 | |
| 3 | 10 | |
| 4 | BUILDING INTELLIGENT TUTORING SYSTEMS | 5 |
| 5 | 12 | |
| 6 | On a question of Gowers concerning isosceles right-angle triangles | 3 |
| 7 | On bipartite generalized Ramsey theory. | 2 |
| 8 | 20 | |
| 9 | 11 | |
| 10 | 24 | |
| 11 | 3 | |
| 12 | 17 | |
| 13 | 9 | |
| 14 | 1 | |
| 15 | 1 | |
| 16 | 136 | |
| 17 | 51 | |
| 18 | 5 | |
| 19 | 2 | |
| 20 | 1 |
About Stanley M. Selkow
Stanley M. Selkow is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 37 papers that have together received 795 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (21 papers), Limits and Structures in Graph Theory (18 papers) and Graph Labeling and Dimension Problems (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (242 citations), Computational Theory and Mathematics (416 citations) and Geometry and Topology (156 citations). Stanley M. Selkow has collaborated with scholars based in United States, Canada and Hungary. Frequent co-authors include Gábor N. Sárközy, László Babai, H. A. Kierstead, Nathaniel Stewart, András Sebö, George T. Heineman, Endre Szemerédi, Owen Murphy, András Gyárfás and Zoltán Füredi. Their work appears in journals such as Journal of Theoretical Biology, Journal of the ACM and IEEE Transactions on Computers.
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.