◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Prajakta Nimbhorkar

3 papers here

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

author position
  • middle author1
  • last author2

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

fields
  • cs.DS2
  • cs.MA1
ORCID 0000-0002-7601-9555
same name
  • Prajakta Nimbhorkar — 16 papers, h 13

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
20102023
most citedRank Maximal Matchings -- Structure and Algorithms

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

collaborators

3 papers

cs.MA2023

Fair Healthcare Rationing to Maximize Dynamic Utilities

Aadityan Ganesh, Prajakta Nimbhorkar, Pratik Ghosal +1

Allocation of scarce healthcare resources under limited logistic and infrastructural facilities is a major issue in the modern society. We consider the problem of allocation of hea…

cs.DS2014★ 2 cited

Rank Maximal Matchings -- Structure and Algorithms

Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar

Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M i…

cs.DS2010

Popularity at Minimum Cost

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of peop…

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