| Publication | Date of Publication | Type |
|---|
| The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 | 2024-12-23 | Paper |
| On uniqueness in Steiner problem | 2024-10-25 | Paper |
| On the chromatic number of 2-dimensional spheres | 2024-02-09 | Paper |
| Erdős-Hajnal problem for \(H\)-free hypergraphs | 2024-01-29 | Paper |
| The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 | 2023-12-08 | Paper |
| On stability of weighted spanning tree degree enumerators | 2023-10-27 | Paper |
| On stability of spanning tree degree enumerators | 2023-10-04 | Paper |
| Branching points in the planar Gilbert--Steiner problem have degree 3 | 2023-09-08 | Paper |
| Independence numbers of Johnson-type graphs | 2023-07-12 | Paper |
| On small non-uniform hypergraphs without property B | 2023-03-07 | Paper |
| An overview of maximal distance minimizers problem | 2022-12-11 | Paper |
| Inverse maximal and average distance minimizer problems | 2022-12-04 | Paper |
| Lovász theta approach to eventown problem | 2022-10-18 | Paper |
| On the minimal sum of edges in a signed edge-dominated graph | 2022-09-06 | Paper |
| Maximal distance minimizers for a rectangle | 2021-06-01 | Paper |
| On the Erdős-Hajnal problem for 3-graphs | 2021-05-26 | Paper |
| On list chromatic numbers of 2-colorable hypergraphs | 2021-02-04 | Paper |
| On minimizers of the maximal distance functional for a planar convex closed smooth curve | 2020-11-20 | Paper |
| Regular Behavior of the Maximal Hypergraph Chromatic Number | 2020-07-30 | Paper |
| Extremal problems in hypergraph colourings | 2020-05-29 | Paper |
| On small \(n\)-uniform hypergraphs with positive discrepancy | 2019-11-21 | Paper |
| Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs | 2019-06-18 | Paper |
| On the Erd{\H o}s--Hajnal problem in the case of 3-graphs | 2019-05-07 | Paper |
| On the horseshoe conjecture for maximal distance minimizers | 2018-12-21 | Paper |
| On a question of Sidorenko | 2018-12-20 | Paper |
| On uniqueness in Steiner problem | 2018-09-05 | Paper |
| On the chromatic number of an infinitesimal plane layer | 2018-08-15 | Paper |
| Coloring cross-intersecting families | 2018-05-25 | Paper |
| Weak forms of shadowing in topological dynamics | 2018-03-16 | Paper |
| A note on panchromatic colorings | 2018-01-19 | Paper |
| On the chromatic numbers of low-dimensional spaces | 2017-06-15 | Paper |
| A note on random greedy coloring of uniform hypergraphs | 2015-11-13 | Paper |
| Multishadowing in topological dynamics | 2015-06-18 | Paper |
| A new randomized algorithm for the Erdos--Hajnal problem | 2013-08-30 | Paper |
| On hypergraph cliques with chromatic number 3 | 2012-09-05 | Paper |
| On two-colorings of hypergraphs | 2012-01-17 | Paper |
| About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3 | 2011-10-08 | Paper |
| About maximal number of edges in hypergraph-clique with chromatic number 3 | 2011-07-10 | Paper |
| On the chromatic numbers of 3-dimensional slices | N/A | Paper |
| Steiner trees with infinitely many terminals on the sides of an angle | N/A | Paper |
