default search action
Sergey Norin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j44]Zdenek Dvorák, Sergey Norin:
Asymptotic dimension of intersection graphs. Eur. J. Comb. 123: 103631 (2025) - 2024
- [j43]Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
On an Induced Version of Menger's Theorem. Electron. J. Comb. 31(4) (2024) - [j42]David Eppstein, Robert Hickingbotham
, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood
Three-Dimensional Graph Products with Unbounded Stack-Number. Discret. Comput. Geom. 71(4): 1210-1237 (2024) - [j41]Zdenek Dvorák, Sergey Norin:
Weak diameter coloring of graphs on surfaces. Eur. J. Comb. 121: 103845 (2024) - [j40]Stefan Grosser, Hamed Hatami, Peter Nelson
Typical structure of hereditary properties of binary matroids. J. Comb. Theory B 167: 283-302 (2024) - [j39]Ping Hu, Jie Ma, Sergey Norin, Hehui Wu
The inducibility of oriented stars. J. Comb. Theory B 168: 11-46 (2024) - [j38]Sergey Norin, Jérémie Turcotte
The burning number conjecture holds asymptotically. J. Comb. Theory B 168: 208-235 (2024) - [j37]Maria Chudnovsky
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. SIAM J. Discret. Math. 38(1): 845-856 (2024) - [i10]Chun-Hung Liu, Sergey Norin, David R. Wood:
Product Structure and Tree-Decompositions. CoRR abs/2410.20333 (2024) - 2023
- [j36]Sergey Norin, Alex Scott, David R. Wood:
Clustered colouring of graph classes with bounded treedepth or pathwidth. Comb. Probab. Comput. 32(1): 122-133 (2023) - [j35]Sergey Norin, Luke Postle
Connectivity and choosability of graphs with no Kt minor. J. Comb. Theory B 158(Part): 283-300 (2023) - [j34]Sergey Norin, Robin Thomas, Hein van der Holst:
On 2-cycles of graphs. J. Comb. Theory B 162: 184-222 (2023) - [j33]Natasha Morrison, JD Nir
Every graph is eventually Turán-good. J. Comb. Theory B 162: 231-243 (2023) - [j32]József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37(2): 1173-1179 (2023) - [c6]József Balogh, Bernard Lidický
Crossing numbers of complete bipartite graphs. LAGOS 2023: 78-87 - [i9]Maria Chudnovsky
Cops and robbers on P5-free graphs. CoRR abs/2301.13175 (2023) - [i8]Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
Twin-width of sparse random graphs. CoRR abs/2312.03688 (2023) - 2022
- [j31]Daniel Král'
Non-Bipartite K-Common Graphs. Comb. 42(1): 87-114 (2022) - [j30]Sergey Norin, Zi-Xia Song:
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor. Comb. 42(1): 137-149 (2022) - [j29]Ringi Kim, Sergey Norin, Sang-il Oum
Obstructions for partitioning into forests and outerplanar graphs. Discret. Appl. Math. 312: 15-28 (2022) - [j28]Adam Blumenthal, Bernard Lidický
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36(3): 1678-1686 (2022) - [c5]Louis Esperet, Sergey Norin:
Testability and Local Certification of Monotone Properties in Minor-Closed Classes. ICALP 2022: 58:1-58:15 - [i7]Louis Esperet, Sergey Norin:
Testability and local certification of monotone properties in minor-closed classes. CoRR abs/2202.00543 (2022) - [i6]David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michal T. Seweryn, David R. Wood:
Three-dimensional graph products with unbounded stack-number. CoRR abs/2202.05327 (2022) - [i5]Sergey Norin, Jérémie Turcotte:
The Burning Number Conjecture Holds Asymptotically. CoRR abs/2207.04035 (2022) - 2021
- [j27]Peter Nelson, Sergey Norin:
The Smallest Matroids with no Large Independent Flat. Electron. J. Comb. 28(1): 1 (2021) - [j26]Zdenek Dvorák
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91: 103206 (2021) - [j25]Rohan Kapadia, Sergey Norin, Yingjie Qian:
Asymptotic density of graphs excluding disconnected minors. J. Comb. Theory B 146: 151-175 (2021) - [j24]Zdenek Dvorák
Sublinear Separators in Intersection Graphs of Convex Shapes. SIAM J. Discret. Math. 35(2): 1149-1164 (2021) - [c4]Ndiamé Ndiaye, Sergey Norin, Adrian Vetta:
Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? SAGT 2021: 281-295 - 2020
- [j23]Sergey Norin, Bruce A. Reed, Andrew Thomason, David R. Wood:
A Lower Bound on the Average Degree Forcing a Minor. Electron. J. Comb. 27(2): 2 (2020)
2010 – 2019
- 2019
- [j22]Adam Bene Watts, Sergey Norin, Liana Yepremyan:
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians. Comb. 39(5): 1149-1171 (2019) - [j21]Sergey Norin, Alex Scott, Paul D. Seymour
Clustered Colouring in Minor-Closed Classes. Comb. 39(6): 1387-1412 (2019) - [j20]Zdenek Dvorák
Treewidth of graphs with balanced separations. J. Comb. Theory B 137: 137-144 (2019) - [j19]Daniel Král'
A bound on the inducibility of cycles. J. Comb. Theory A 161: 359-363 (2019) - [j18]Zdenek Dvorák
List coloring with requests. J. Graph Theory 92(3): 191-206 (2019) - 2018
- [j17]Eli Berger, Zdenek Dvorák, Sergey Norin:
Treewidth of Grid Subsets. Comb. 38(6): 1337-1352 (2018) - [j16]Dmitry Jakobson, Calum MacRury, Sergey Norin, Lise Turner:
Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j15]Sergey Norin, Liana Yepremyan
Turán numbers of extensions. J. Comb. Theory A 155: 476-492 (2018) - [j14]Vida Dujmovic, Gwenaël Joret, Pat Morin
Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(2): 839-863 (2018) - [j13]Vida Dujmovic, Gwenaël Joret, Pat Morin
Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(4): 3003-3004 (2018) - 2017
- [j12]Jan Hladký
Counting flags in triangle-free digraphs. Comb. 37(1): 49-76 (2017) - [j11]Endre Csóka, Irene Lo
The extremal function for disconnected minors. J. Comb. Theory B 126: 162-174 (2017) - [j10]Sergey Norin, Liana Yepremyan
Turán number of generalized triangles. J. Comb. Theory A 146: 312-343 (2017) - 2016
- [j9]Sergey Norin, Yelena Yuditsky
Erdős-Szekeres Without Induction. Discret. Comput. Geom. 55(4): 963-971 (2016) - [j8]Stavros Garoufalidis
Flag algebras and the stable coefficients of the Jones polynomial. Eur. J. Comb. 51: 165-189 (2016) - [j7]Sergey Norin, Robin Thomas:
Non-planar extensions of subdivisions of planar graphs. J. Comb. Theory B 121: 326-366 (2016) - [j6]Zdenek Dvorák
Strongly Sublinear Separators and Polynomial Expansion. SIAM J. Discret. Math. 30(2): 1095-1101 (2016) - 2015
- [j5]Sergey Norin, Liana Yepremyan
Sparse halves in dense triangle-free graphs. J. Comb. Theory B 115: 1-25 (2015) - [j4]Maria Chudnovsky
Excluding a Substar and an Antisubstar. SIAM J. Discret. Math. 29(1): 297-308 (2015) - [c3]Yogesh Anbalagan, Hao Huang, Shachar Lovett
Large Supports are Required for Well-Supported Nash Equilibria. APPROX-RANDOM 2015: 78-84 - [p1]Sergey Norin:
New tools and results in graph minor structure theory. Surveys in Combinatorics 2015: 221-260 - [i4]Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu:
Large Supports are required for Well-Supported Nash Equilibria. CoRR abs/1504.03602 (2015) - 2014
- [c2]Nicolas Bousquet
A Near-Optimal Mechanism for Impartial Selection. WINE 2014: 133-146 - [i3]Nicolas Bousquet, Sergey Norin, Adrian Vetta:
A Near-Optimal Mechanism for Impartial Selection. CoRR abs/1407.8535 (2014) - [i2]Zdenek Dvorák, Sergey Norin:
Treewidth of graphs with balanced separations. CoRR abs/1408.3869 (2014) - 2013
- [j3]Sergey Norin, Liana Yepremyan:
Sparse halves in dense triangle-free graphs. Electron. Notes Discret. Math. 43: 271-278 (2013) - [j2]Felix Brandt, Maria Chudnovsky
A counterexample to a conjecture of Schwartz. Soc. Choice Welf. 40(3): 739-743 (2013) - [c1]Yogesh Anbalagan, Sergey Norin, Rahul Savani
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3. WINE 2013: 15-23 - [i1]Yogesh Anbalagan, Sergey Norin, Rahul Savani
Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria below 2/3. CoRR abs/1309.7258 (2013)
2000 – 2009
- 2009
- [j1]Jan Hladký
Counting flags in triangle-free digraphs. Electron. Notes Discret. Math. 34: 621-625 (2009)
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-12-01 00:17 CET 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: