The following pages link to Meghana Nasre (Q510958):
Displaying 26 items.
- List coloring of planar graphs with forbidden cycles (Q510959) (← links)
- Popular mixed matchings (Q541674) (← links)
- Popular matchings with variable item copies (Q631788) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- Optimal popular matchings (Q967372) (← links)
- Facility location on planar graphs with unreliable links (Q1625178) (← 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)
- Popularity in the generalized hospital residents setting (Q2399378) (← links)
- Trade-offs in dynamic coloring for bipartite and general graphs (Q2696273) (← links)
- New Hardness Results in Rainbow Connectivity (Q2911628) (← links)
- Betweenness Centrality – Incremental and Faster (Q2922644) (← links)
- Popular Matchings: Structure and Strategic Issues (Q2935279) (← links)
- Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality (Q2942677) (← links)
- Popular Matchings -- structure and cheating strategies (Q2957902) (← links)
- Bounded Unpopularity Matchings (Q3512453) (← links)
- Popular Mixed Matchings (Q3638064) (← links)
- Popular Matchings with Variable Job Capacities (Q3652230) (← links)
- Popular Matchings with Lower Quotas (Q5136336) (← links)
- How Good Are Popular Matchings (Q5140718) (← 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)
