◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Pawan Tamta

5 papers hereh-index 331 citations17 works total

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

author position
  • first author3
  • middle author2

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

fields
  • cs.DS2
  • cs.IR2
  • math.OC1

identity via Semantic Scholar / OpenAlex

most citedGeneration, Implementation and Appraisal of an N-gram based Stemming Algorithm

5 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2013

Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem

Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami

Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reducti…

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