Sushmita Gupta

From MaRDI portal
Person:503459

Available identifiers

zbMath Open gupta.sushmitaMaRDI QIDQ503459

List of research outcomes

PublicationDate of PublicationType
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules2023-12-13Paper
More effort towards multiagent knapsack2023-08-14Paper
Gehrlein stable committee with multi-modal preferences2023-07-28Paper
Gerrymandering on graphs: computational complexity and parameterized algorithms2022-06-01Paper
Resolute control: forbidding candidates from winning an election is hard2022-05-31Paper
Parameterized complexity of \(d\)-hitting set with quotas2022-03-24Paper
Popular Matching in Roommates Setting Is NP-hard2022-03-22Paper
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)2022-03-15Paper
https://portal.mardi4nfdi.de/entity/Q50118762021-08-30Paper
Balanced stable marriage: how close is close enough?2021-08-27Paper
Quadratic vertex kernel for split vertex deletion2020-08-03Paper
https://portal.mardi4nfdi.de/entity/Q51112882020-05-26Paper
Quadratic vertex kernel for rainbow matching2020-02-28Paper
Quadratic vertex kernel for split vertex deletion2020-02-06Paper
Balanced stable marriage: how close is close enough?2020-01-16Paper
Popular Matching in Roommates Setting Is NP-hard2019-10-15Paper
Some hard stable marriage problems: a survey on multivariate analysis2019-05-28Paper
Parameterized algorithms and kernels for rainbow matching2019-04-25Paper
Stable matching games: manipulation via subgraph isomorphism2018-07-26Paper
https://portal.mardi4nfdi.de/entity/Q46365762018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46343852018-04-10Paper
Parameterized algorithms for stable matching with ties and incomplete lists2018-04-04Paper
Group activity selection on graphs: parameterized analysis2018-02-13Paper
https://portal.mardi4nfdi.de/entity/Q53695252017-10-17Paper
On the advice complexity of the \(k\)-server problem under sparse metrics2017-01-12Paper
Relative interval analysis of paging algorithms on access graphs2015-01-28Paper
On Advice Complexity of the k-server Problem under Sparse Metrics2013-12-17Paper
Relative Interval Analysis of Paging Algorithms on Access Graphs2013-08-12Paper
Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds2013-04-09Paper
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis2012-08-14Paper
Feedback arc set problem in bipartite tournaments2010-03-24Paper
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems2008-04-17Paper
Feedback Arc Set Problem in Bipartite Tournaments2007-11-13Paper

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: Sushmita Gupta