The following pages link to Prajakta Nimbhorkar (Q385513):
Displayed 25 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- The planar \(k\)-means problem is NP-hard (Q441888) (← links)
- Rank-maximal matchings -- structure and algorithms (Q1733053) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- Many-to-one popular matchings with two-sided preferences and one-sided ties (Q2300041) (← links)
- Classified rank-maximal matchings and popular matchings -- algorithms and hardness (Q2301548) (← links)
- Dynamic rank-maximal matchings (Q2412427) (← links)
- Dynamic rank-maximal and popular matchings (Q2420654) (← links)
- Disjoint stable matchings in linear time (Q2672428) (← links)
- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs (Q2894451) (← links)
- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups (Q2912713) (← links)
- Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. (Q2920122) (← links)
- (Q3113750) (← links)
- 3-connected Planar Graph Isomorphism is in Log-space (Q3165955) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- (Q5111291) (← links)
- Popular Matchings with Lower Quotas (Q5136336) (← links)
- How Good Are Popular Matchings (Q5140718) (← links)
- (Q5414582) (← links)
- Pseudorandom generators for group products (Q5419096) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5918585) (← links)
- Envy-freeness and relaxed stability: hardness and approximation algorithms (Q5925588) (← links)
- (Q6187043) (← links)
- Popular critical matchings in the many-to-many setting (Q6199405) (← links)