◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

R. Gautam

4 papers hereh-index 218 citations6 works total

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

author position
  • sole author1
  • first author3

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

fields
  • cs.DS2
  • cs.SI2
same name
  • R. Gautam — 22 papers, h 13
  • R. Gautam — 2 papers, h 4
  • R. Gautam — 2 papers, h 39
  • R. Gautam — 2 papers, h 3
  • R. Gautam — 1 paper, h 2
  • R. Gautam — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20222025
most citedImproved Approximation Algorithm for Graph Burning on Trees

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

collaborators

4 papers

cs.SI2025

Community-Based Efficient Algorithms for User-Driven Competitive Influence Maximization in Social Networks

Rahul Kumar Gautam

Nowadays, people in the modern world communicate with their friends, relatives, and colleagues through the internet. Persons/nodes and communication/edges among them form a network…

cs.SI2024

Heuristics for Influence Maximization with Tiered Influence and Activation thresholds

Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S

The information flows among the people while they communicate through social media websites. Due to the dependency on digital media, a person shares important information or regula…

cs.DS2023

Approximation Algorithms for the Graph Burning on Cactus and Directed Trees

Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani

Given a graph G=(V,E), the problem of Graph Burning is to find a sequence of nodes from V, called a burning sequence, to burn the whole graph. This is a discrete-step process,…

cs.DS2022★ 2 cited

Improved Approximation Algorithm for Graph Burning on Trees

Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S

Given a graph G=(V,E), the problem of \gb{} is to find a sequence of nodes from V, called burning sequence, in order to burn the whole graph. This is a discrete-step process, i…

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