| Publication | Date of Publication | Type |
|---|
Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments
| 2024-05-31 | Paper |
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
Algorithmica | 2023-12-13 | Paper |
More effort towards multiagent knapsack
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Gehrlein stable committee with multi-modal preferences
Algorithmic Game Theory | 2023-07-28 | Paper |
Gerrymandering on graphs: computational complexity and parameterized algorithms
| 2022-06-01 | Paper |
Resolute control: forbidding candidates from winning an election is hard
Theoretical Computer Science | 2022-05-31 | Paper |
Parameterized complexity of \(d\)-hitting set with quotas
| 2022-03-24 | Paper |
Popular matching in roommates setting is NP-hard
ACM Transactions on Computation Theory | 2022-03-22 | Paper |
On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Popular matching in roommates setting is \textsf{NP}-hard
| 2021-08-30 | Paper |
Balanced stable marriage: how close is close enough?
Theoretical Computer Science | 2021-08-27 | Paper |
Quadratic vertex kernel for split vertex deletion
Theoretical Computer Science | 2020-08-03 | Paper |
Parameterized Algorithms and Kernels for Rainbow Matching
| 2020-05-26 | Paper |
Quadratic vertex kernel for rainbow matching
Algorithmica | 2020-02-28 | Paper |
Quadratic vertex kernel for split vertex deletion
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Balanced stable marriage: how close is close enough?
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Popular matching in roommates setting is NP-hard
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Some hard stable marriage problems: a survey on multivariate analysis
| 2019-05-28 | Paper |
Parameterized algorithms and kernels for rainbow matching
Algorithmica | 2019-04-25 | Paper |
Stable matching games: manipulation via subgraph isomorphism
Algorithmica | 2018-07-26 | Paper |
Stable matching games: manipulation via subgraph isomorphism
| 2018-04-19 | Paper |
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
| 2018-04-10 | Paper |
Parameterized algorithms for stable matching with ties and incomplete lists
Theoretical Computer Science | 2018-04-04 | Paper |
Group activity selection on graphs: parameterized analysis
| 2018-02-13 | Paper |
Total stability in stable matching games
| 2017-10-17 | Paper |
On the advice complexity of the \(k\)-server problem under sparse metrics
Theory of Computing Systems | 2017-01-12 | Paper |
Relative interval analysis of paging algorithms on access graphs
Theoretical Computer Science | 2015-01-28 | Paper |
On advice complexity of the \(k\)-server problem under sparse metrics
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Relative interval analysis of paging algorithms on access graphs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Feedback arc set problem in bipartite tournaments
Information Processing Letters | 2010-03-24 | Paper |
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Feedback Arc Set Problem in Bipartite Tournaments
Lecture Notes in Computer Science | 2007-11-13 | Paper |
