◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Seshadhri Comandur

12 papers hereh-index 282.7k citations72 works total

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

author position
  • middle author3
  • last author9

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

fields
  • cs.DS6
  • cs.SI5
  • cs.CE1

identity via Semantic Scholar / OpenAlex

activity
20122021
most citedLocal Algorithms for Hierarchical Dense Subgraph Discovery

55 citations · 116 across the 11 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.DS2019★ 14 cited

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

We consider the problem of counting all k-vertex subgraphs in an input graph, for any constant k. This problem (denoted sub-cntk​) has been studied extensively in both theory…

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