◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nithin M. Varma

15 papers hereh-index 9311 citations29 works total

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

author position
  • first author1
  • last author14

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

fields
  • cs.DS11
  • cs.CC1
  • cs.DM1
  • cs.GT1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedRainbow Connection Number and Connected Dominating Sets

112 citations · 116 across the 10 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Testing Connectedness and Edge Connectedness

Diptaksho Palit, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova +1

We revisit the classical problem of testing connectedness of graphs represented in the adjacency lists model and obtain optimal bounds. Specifically, we show that ε-tes…

cs.DS2026

Constrained Correlation Clustering: Towards Optimality

Sina Azizeddin, Evangelos Kipouridis, Nithin Varma

In the Correlation Clustering problem, we are given an undirected graph and are tasked with computing a clustering (partition of the nodes) that minimizes the number of violated pa…

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