◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Aravind

16 papers hereh-index 9208 citations35 works total

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

author position
  • first author15
  • last author1

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

fields
  • cs.DS8
  • cs.DM3
  • math.CO3
  • cs.CC1
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20142026
most citedAlgorithms and hardness results for happy coloring problems

15 citations · 20 across the 14 of their papers we have counts for

collaborators
Showing 2022Show all

2 papers · 1 filter

cs.DS2022

Parameterized Complexity of Path Set Packing

N. R. Aravind, Roopam Saxena

In Path Set Packing, the input is an undirected graph G, a collection $\calp$ of simple paths in G, and a positive integer k. The problem is to decide whether there exist k…

cs.DS2022

Chess is hard even for a single player

N. R. Aravind, Neeldhara Misra, Harshil Mittal

We introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 x 8 ch…

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