Prajakta Nimbhorkar

Prajakta Nimbhorkar

Chennai Mathematical Institute

H-index: 13

Asia-India

About Prajakta Nimbhorkar

Prajakta Nimbhorkar, With an exceptional h-index of 13 and a recent h-index of 8 (since 2020), a distinguished researcher at Chennai Mathematical Institute, specializes in the field of Algorithms, complexity theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings

Fair Healthcare Rationing to Maximize Dynamic Utilities

EFX Exists for Four Agents with Three Types of Valuations

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints

Envy-freeness and relaxed stability: Hardness and approximation algorithms

Critical relaxed stable matchings with two-sided ties

Individual fairness under Varied Notions of Group Fairness in Bipartite Matching--One Framework to Approximate Them Al

Popular edges with critical nodes

Prajakta Nimbhorkar Information

University

Position

___

Citations(all)

1276

Citations(since 2020)

617

Cited By

907

hIndex(all)

13

hIndex(since 2020)

8

i10Index(all)

13

i10Index(since 2020)

8

Email

University Profile Page

Chennai Mathematical Institute

Google Scholar

View Google Scholar Profile

Prajakta Nimbhorkar Skills & Research Interests

Algorithms

complexity theory

Top articles of Prajakta Nimbhorkar

Title

Journal

Author(s)

Publication Date

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings

arXiv preprint arXiv:2312.15479

Prajakta Nimbhorkar

2023/12/24

Fair Healthcare Rationing to Maximize Dynamic Utilities

Aadityan Ganesh

Pratik Ghosal

Vishwa Prakash HV

Prajakta Nimbhorkar

2023/5/25

EFX Exists for Four Agents with Three Types of Valuations

arXiv preprint arXiv:2301.10632

Pratik Ghosal

Prajakta Nimbhorkar

Nithin Varma

2023/1/25

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints

Frontiers in Artificial Intelligence and Applications

A Louis

M Nasre

P Nimbhorkar

GS Sankar

2023

Envy-freeness and relaxed stability: Hardness and approximation algorithms

Journal of Combinatorial Optimization

Prem Krishnaa

Girija Limaye

Meghana Nasre

Prajakta Nimbhorkar

2023/1

Critical relaxed stable matchings with two-sided ties

Meghana Nasre

Prajakta Nimbhorkar

Keshav Ranjan

2023/6/28

Individual fairness under Varied Notions of Group Fairness in Bipartite Matching--One Framework to Approximate Them Al

arXiv preprint arXiv:2208.09951

Atasi Panda

Anand Louis

Prajakta Nimbhorkar

2022/8/21

Popular edges with critical nodes

arXiv preprint arXiv:2209.10805

Kushagra Chatterjee

Prajakta Nimbhorkar

2022/9/22

Matchings with group fairness constraints: Online and offline algorithms

arXiv preprint arXiv:2105.09522

Govind S Sankar

Anand Louis

Meghana Nasre

Prajakta Nimbhorkar

2021/5/20

Popular matchings in the hospital-residents problem with two-sided lower quotas

Meghana Nasre

Prajakta Nimbhorkar

Keshav Ranjan

Ankita Sarkar

2021

Disjoint stable matchings in linear time

Aadityan Ganesh

HV Vishwa Prakash

Prajakta Nimbhorkar

Geevarghese Philip

2021

See List of Professors in Prajakta Nimbhorkar University(Chennai Mathematical Institute)

Co-Authors

H-index: 39
Kasturi Varadarajan

Kasturi Varadarajan

University of Iowa

H-index: 22
Michal Koucky

Michal Koucky

Univerzita Karlova

H-index: 19
Samir Datta

Samir Datta

Chennai Mathematical Institute

H-index: 16
Nutan Limaye

Nutan Limaye

Indian Institute of Technology Bombay

H-index: 10
Bireswar Das

Bireswar Das

Indian Institute of Technology Gandhinagar

H-index: 6
Yadu Vasudev

Yadu Vasudev

Indian Institute of Technology Madras

academic-engine