◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Karpov

7 papers hereh-index 9231 citations43 works total

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

author position
  • sole author4
  • first author1
  • last author2

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

fields
  • math.CO7
same name
  • D. Karpov — 3 papers, h 4
  • D. Karpov — 2 papers, h 3
  • D. Karpov — 2 papers, h 7
  • D. Karpov — 1 paper, h 3
  • D. Karpov — 1 paper, h 0
  • D. Karpov — 1 paper, h 3

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
20112014
most citedUpper bound on the number of edges of an almost planar bipartite graph

11 citations · 32 across the 7 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

math.CO2014★ 3 cited

The tree of decomposition of a biconnected graph

Dmitri Karpov

The tree of decomposition of a k-connected graph by a set S of pairwise independent k-vertex cutsets is defined as follows. The vertices of this tree are cutsets of…

◍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.