◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Shabanov

8 papers hereh-index 10331 citations56 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author1
  • last author5

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • math.CO7
  • math.NT1
same name
  • D. Shabanov — 1 paper, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedEquitable colorings of hypergraphs with few edges

10 citations · 22 across the 7 of their papers we have counts for

collaborators
Showing 2025Show all

1 paper · 1 filter

math.CO2025

On the random minimum edge-disjoint spanning trees problem

Dmitry Shabanov, Nikita Zvonkov

It is well known that finding extremal values and structures can be hard in weighted graphs. However, if the weights are random, this problem can become way easier. In this paper,…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.