Prajakta Nimbhorkar

From MaRDI portal
Person:385513

Available identifiers

zbMath Open nimbhorkar.prajaktaMaRDI QIDQ385513

List of research outcomes

PublicationDate of PublicationType
Popular critical matchings in the many-to-many setting2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61870432024-02-05Paper
Envy-freeness and relaxed stability: hardness and approximation algorithms2023-01-04Paper
Envy-freeness and relaxed stability: hardness and approximation algorithms2022-12-21Paper
Disjoint stable matchings in linear time2022-06-08Paper
How Good Are Popular Matchings2020-12-16Paper
Popular Matchings with Lower Quotas2020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q51112912020-05-26Paper
Many-to-one popular matchings with two-sided preferences and one-sided ties2020-02-24Paper
Classified rank-maximal matchings and popular matchings -- algorithms and hardness2020-02-24Paper
Dynamic rank-maximal and popular matchings2019-06-06Paper
Rank-maximal matchings -- structure and algorithms2019-03-26Paper
Expanding Generating Sets for Solvable Permutation Groups2018-07-20Paper
Dynamic rank-maximal matchings2017-10-23Paper
Rank-maximal matchings -- structure and algorithms2015-09-11Paper
Popularity at minimum cost2014-06-24Paper
Pseudorandom generators for group products2014-06-05Paper
https://portal.mardi4nfdi.de/entity/Q54145822014-05-06Paper
Log-space algorithms for paths and matchings in \(k\)-trees2013-12-02Paper
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.2012-10-24Paper
3-connected Planar Graph Isomorphism is in Log-space2012-10-19Paper
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups2012-09-25Paper
The planar \(k\)-means problem is NP-hard2012-08-08Paper
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs2012-06-29Paper
https://portal.mardi4nfdi.de/entity/Q31137502012-01-23Paper
Popularity at minimum cost2010-12-09Paper
The Planar k-Means Problem is NP-Hard2009-02-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Prajakta Nimbhorkar