Prajakta Nimbhorkar

Available identifiers

zbMath Open nimbhorkar.prajaktaMaRDI QIDQ385513

List of research outcomes

Publication	Date of Publication	Type
Popular edges with critical nodes	2024-09-11	Paper
Critical Relaxed Stable Matchings with Two-Sided Ties	2024-05-03	Paper
Popular critical matchings in the many-to-many setting	2024-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q6187043	2024-02-05	Paper
Envy-freeness and relaxed stability: hardness and approximation algorithms	2023-01-04	Paper
Envy-freeness and relaxed stability: hardness and approximation algorithms	2022-12-21	Paper
Disjoint stable matchings in linear time	2022-06-08	Paper
How Good Are Popular Matchings	2020-12-16	Paper
Popular Matchings with Lower Quotas	2020-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q5111291	2020-05-26	Paper
Classified rank-maximal matchings and popular matchings -- algorithms and hardness	2020-02-24	Paper
Many-to-one popular matchings with two-sided preferences and one-sided ties	2020-02-24	Paper
Dynamic rank-maximal and popular matchings	2019-06-06	Paper
Rank-maximal matchings -- structure and algorithms	2019-03-26	Paper
Expanding Generating Sets for Solvable Permutation Groups	2018-07-20	Paper
Dynamic rank-maximal matchings	2017-10-23	Paper
Rank-maximal matchings -- structure and algorithms	2015-09-11	Paper
Popularity at minimum cost	2014-06-24	Paper
Pseudorandom generators for group products	2014-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q5414582	2014-05-06	Paper
Log-space algorithms for paths and matchings in \(k\)-trees	2013-12-02	Paper
Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space	2012-10-24	Paper
3-connected Planar Graph Isomorphism is in Log-space	2012-10-19	Paper
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups	2012-09-25	Paper
The planar \(k\)-means problem is NP-hard	2012-08-08	Paper
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs	2012-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q3113750	2012-01-23	Paper
Popularity at minimum cost	2010-12-09	Paper
The Planar k-Means Problem is NP-Hard	2009-02-24	Paper

Research outcomes over time

This page was built for person: Prajakta Nimbhorkar