◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dibyayan Chakraborty

26 papers hereh-index 7193 citations45 works total

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

author position
  • sole author1
  • first author21
  • middle author4

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

fields
  • cs.DM10
  • cs.DS8
  • math.CO6
  • cs.CC1
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20162026
most citedHardness and approximation for the geodetic set problem in some graph classes

9 citations · 22 across the 21 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2023★ 1 cited

Cutting Barnette graphs perfectly is hard

Édouard Bonnet, Dibyayan Chakraborty, Julien Duron

A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorith…

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