Serguei Norine

1.3k total citations
27 papers, 492 citations indexed

About

Serguei Norine is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Serguei Norine has authored 27 papers receiving a total of 492 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 18 papers in Discrete Mathematics and Combinatorics and 10 papers in Geometry and Topology. Recurrent topics in Serguei Norine's work include Advanced Graph Theory Research (18 papers), Limits and Structures in Graph Theory (14 papers) and Graph Labeling and Dimension Problems (10 papers). Serguei Norine is often cited by papers focused on Advanced Graph Theory Research (18 papers), Limits and Structures in Graph Theory (14 papers) and Graph Labeling and Dimension Problems (10 papers). Serguei Norine collaborates with scholars based in United States, Canada and Czechia. Serguei Norine's co-authors include Matthew Baker, Daniel Král͏̌, Mark D. Baker, Robin Thomas, Jan Hladký, Hamed Hatami, Alexander Razborov, Paul Wollan, Paul Seymour and František Kardoš and has published in prestigious journals such as American Mathematical Monthly, Advances in Mathematics and Linear Algebra and its Applications.

In The Last Decade

Serguei Norine

27 papers receiving 450 citations

Peers

Serguei Norine
Caroline J. Klivans United States
Steven D. Noble United Kingdom
Criel Merino Mexico
Svante Linusson Sweden
Tullio Ceccherini‐Silberstein Italy
Anna de Mier Spain
Gregory A. Freiman Israel
M. Delest France
Dino Lorenzini United States
Petter Brändén Sweden
Caroline J. Klivans United States
Serguei Norine
Citations per year, relative to Serguei Norine Serguei Norine (= 1×) peers Caroline J. Klivans

Countries citing papers authored by Serguei Norine

Since Specialization
Citations

This map shows the geographic impact of Serguei Norine'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 Serguei Norine with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Serguei Norine more than expected).

Fields of papers citing papers by Serguei Norine

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Serguei Norine. 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 Serguei Norine. The network helps show where Serguei Norine may publish in the future.

Co-authorship network of co-authors of Serguei Norine

This figure shows the co-authorship network connecting the top 25 collaborators of Serguei Norine. A scholar is included among the top collaborators of Serguei Norine 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 Serguei Norine. Serguei Norine 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.
Kawarabayashi, Ken‐ichi, Serguei Norine, Robin Thomas, & Paul Wollan. (2017). K6 minors in 6-connected graphs of bounded tree-width. Journal of Combinatorial Theory Series B. 136. 1–32. 3 indexed citations
2.
Hatami, Hamed, et al.. (2014). The inducibility of blow-up graphs. Journal of Combinatorial Theory Series B. 109. 196–212. 12 indexed citations
3.
Hatami, Hamed, Jan Hladký, Daniel Král͏̌, Serguei Norine, & Alexander Razborov. (2013). On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory Series A. 120(3). 722–732. 66 indexed citations
4.
Hladký, Jan, Daniel Král͏̌, & Serguei Norine. (2013). Rank of divisors on tropical curves. Journal of Combinatorial Theory Series A. 120(7). 1521–1538. 11 indexed citations
5.
Landsberg, J. M., Jason Morton, & Serguei Norine. (2012). Holographic algorithms without matchgates. Linear Algebra and its Applications. 438(2). 782–795. 6 indexed citations
6.
Hatami, Hamed, Jan Hladký, Daniel Král͏̌, Serguei Norine, & Alexander Razborov. (2012). Non-Three-Colourable Common Graphs Exist. Combinatorics Probability Computing. 21(5). 734–742. 26 indexed citations
7.
Esperet, Louis, František Kardoš, Andrew D. King, Daniel Král͏̌, & Serguei Norine. (2011). Exponentially many perfect matchings in cubic graphs. Advances in Mathematics. 227(4). 1646–1664. 32 indexed citations
8.
Dvořák, Zdenĕk & Serguei Norine. (2009). Small graph classes and bounded expansion. Journal of Combinatorial Theory Series B. 100(2). 171–175. 12 indexed citations
9.
Král͏̌, Daniel, et al.. (2009). Markov bases of binary graph models of K4-minor free graphs. Journal of Combinatorial Theory Series A. 117(6). 759–765. 7 indexed citations
10.
Norine, Serguei. (2009). Drawing 4-Pfaffian graphs on the torus. COMBINATORICA. 29(1). 109–119. 4 indexed citations
11.
Baker, Mark D. & Serguei Norine. (2009). Harmonic Morphisms and Hyperelliptic Graphs. International Mathematics Research Notices. 58 indexed citations
12.
Norine, Serguei & Jean‐Sébastien Sereni. (2008). Graphs with full rank 3-color matrix and few 3-colorings. Journal of Combinatorial Theory Series B. 98(5). 1115–1116. 1 indexed citations
13.
Norine, Serguei & Robin Thomas. (2008). Minimally non-Pfaffian graphs. Journal of Combinatorial Theory Series B. 98(5). 1038–1055. 7 indexed citations
14.
Norine, Serguei. (2008). On two questions about circular choosability. Journal of Graph Theory. 58(3). 261–269. 7 indexed citations
15.
Norine, Serguei & Robin Thomas. (2008). Pfaffian labelings and signs of edge colorings. COMBINATORICA. 28(1). 99–111. 2 indexed citations
16.
Norine, Serguei, Tsai–Lien Wong, & Xuding Zhu. (2008). Circular choosability via combinatorial Nullstellensatz. Journal of Graph Theory. 59(3). 190–204. 4 indexed citations
17.
Baker, Matthew & Serguei Norine. (2007). Riemann–Roch and Abel–Jacobi theory on a finite graph. Advances in Mathematics. 215(2). 766–788. 138 indexed citations
18.
Norine, Serguei & Robin Thomas. (2007). Generating bricks. Journal of Combinatorial Theory Series B. 97(5). 769–817. 15 indexed citations
19.
Norine, Serguei, Paul Seymour, Robin Thomas, & Paul Wollan. (2006). Proper minor-closed families are small. Journal of Combinatorial Theory Series B. 96(5). 754–757. 42 indexed citations
20.
Norine, Serguei, et al.. (2004). A new proof of a characterisation of Pfaffian bipartite graphs. Journal of Combinatorial Theory Series B. 91(1). 123–126. 2 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

Breakdown of academic impact, for papers by Caroline J. Klivans Breakdown of academic impact, for papers by Steven D. Noble Breakdown of academic impact, for papers by Criel Merino Breakdown of academic impact, for papers by Svante Linusson Breakdown of academic impact, for papers by Tullio Ceccherini‐Silberstein Breakdown of academic impact, for papers by Anna de Mier Breakdown of academic impact, for papers by Gregory A. Freiman Breakdown of academic impact, for papers by M. Delest Breakdown of academic impact, for papers by Dino Lorenzini Breakdown of academic impact, for papers by Petter Brändén
Rankless by CCL
2026