Sergey Norin
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
- Advanced Topology and Set Theory
Papers in
-
- Limits and Structures in Graph Theory 30
- Advanced Combinatorial Mathematics 3
-
- Advanced Graph Theory Research 27
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 6
- Co-authors
- Daniel Král͏̌ (3 shared papers)Luke Postle (2 shared papers)Jan Hladký (1 shared paper)Alex Scott (2 shared papers)Zi‐Xia Song (2 shared papers)Zdenĕk Dvořák (3 shared papers)Damian Osajda (1 shared paper)Stéphan Thomassé (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series B (8 papers)SIAM Journal on Discrete Mathematics (4 papers)COMBINATORICA (4 papers)European Journal of Combinatorics (3 papers)Journal of Combinatorial Theory Series A (3 papers)
- Partner nations
- CanadaUnited StatesUnited Kingdom
In The Last Decade
Sergey Norin
30 papers receiving 136 citations
Peers
Comparison fields: 5 of 21
- Discrete Mathematics and Combinatorics 116
- Geometry and Topology 77
- Computational Theory and Mathematics 108
- Computer Graphics and Computer-Aided Design 4
- Management Science and Operations Research 14
Countries citing papers authored by Sergey Norin
This map shows the geographic impact of Sergey Norin'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 Sergey Norin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sergey Norin more than expected).
Fields of papers citing papers by Sergey Norin
This network shows the impact of papers produced by Sergey Norin. 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 Sergey Norin. The network helps show where Sergey Norin may publish in the future.
Co-authors
The 25 scholars most cited alongside Sergey Norin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 36 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 18 | |
| 2 | 2017 | 16 | |
| 3 | 2012 | 16 | |
| 4 | 2009 | 13 | |
| 5 | 2018 | 10 | |
| 6 | 2019 | 10 | |
| 7 | 2021 | 8 | |
| 8 | 2022 | 7 | |
| 9 | 2015 | 6 | |
| 10 | 2022 | 6 | |
| 11 | 2023 | 5 | |
| 12 | 2020 | 3 | |
| 13 | 2019 | 3 | |
| 14 | 2021 | 3 | |
| 15 | 2016 | 3 | |
| 16 | 2020 | 3 | |
| 17 | 2023 | 2 | |
| 18 | 2022 | 2 | |
| 19 | 2022 | 2 | |
| 20 | 2016 | 2 |
About Sergey Norin
Sergey Norin is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 36 papers that have together received 151 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (30 papers), Advanced Graph Theory Research (27 papers), Graph theory and applications (9 papers), Graph Labeling and Dimension Problems (8 papers), Complexity and Algorithms in Graphs (6 papers), Advanced Combinatorial Mathematics (3 papers), graph theory and CDMA systems (3 papers) and Computational Geometry and Mesh Generation (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (116 citations), Geometry and Topology (77 citations), Computational Theory and Mathematics (108 citations), Computer Graphics and Computer-Aided Design (4 citations) and Management Science and Operations Research (14 citations). Sergey Norin has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Daniel Král͏̌, Luke Postle, Jan Hladký, Alex Scott, Zi‐Xia Song, Zdenĕk Dvořák, Damian Osajda, Stéphan Thomassé, Felix Brandt and Piotr Przytycki. Their work appears in journals such as Journal of Combinatorial Theory Series B, SIAM Journal on Discrete Mathematics, COMBINATORICA, European Journal of Combinatorics and Journal of Combinatorial Theory Series A.
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.