◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Tale

35 papers hereh-index 9214 citations53 works total

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

author position
  • sole author4
  • middle author2
  • last author29

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

fields
  • cs.DS25
  • cs.DM5
  • cs.CC4
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedDouble Exponential Lower Bound for Telephone Broadcast

2 citations · 4 across the 22 of their papers we have counts for

collaborators
Showing 2022 · cs.CCShow all

1 paper · 2 filters

cs.CC2022

The Complexity of Contracting Bipartite Graphs into Small Cycles

R. Krithika, Roohani Sharma, Prafullkumar Tale

For a positive integer ℓ≥3, the Cℓ​-Contractibility problem takes as input an undirected simple graph G and determines whether G can be transformed into a graph…

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