| Publication | Date of Publication | Type |
|---|
| When far is better: the Chamberlin-Courant approach to obnoxious committee selection | 2026-06-12 | Paper |
| On the (parameterized) complexity of almost stable marriage | 2026-03-23 | Paper |
| Satisfiability to coverage in presence of fairness, matroid, and global constraints | 2026-01-14 | Paper |
Participatory budgeting with project groups
Journal of Computer and System Sciences | 2025-12-11 | Paper |
| Parameterized complexity of disconnected matchings | 2025-11-11 | Paper |
Max-SAT with cardinality constraint parameterized by the number of clauses
Theoretical Computer Science | 2025-11-10 | Paper |
| Manipulation with(out) money in matching market | 2025-03-25 | Paper |
Exact and approximate digraph bandwidth
Theory of Computing Systems | 2025-02-28 | Paper |
| Sparsity in covering solutions | 2024-05-31 | Paper |
| Max-SAT with cardinality constraint parameterized by the number of clauses | 2024-05-31 | Paper |
| Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage | 2024-05-14 | Paper |
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
Algorithmica | 2023-12-13 | Paper |
| On the Parameterized Approximability of Contraction to Classes of Chordal Graphs | 2023-10-31 | 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 |
| Circumventing connectivity for kernelization | 2023-03-22 | Paper |
| Exact and Approximate Digraph Bandwidth | 2023-02-03 | Paper |
| Parameterized complexity of conflict-free matchings and paths | 2022-07-21 | Paper |
Scatter search for the minimum leaf spanning tree problem
Computers & Operations Research | 2022-06-22 | Paper |
Gerrymandering on graphs: computational complexity and parameterized algorithms
(available as arXiv preprint) | 2022-06-01 | Paper |
On the parameterized approximability of contraction to classes of chordal graphs
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
| Parameterized complexity of d-hitting set with quotas | 2022-03-24 | Paper |
| Conflict free feedback vertex set: a parameterized dichotomy | 2021-08-04 | Paper |
| Exploring the kernelization borders for hitting cycles | 2021-08-04 | Paper |
| Committee selection with multimodal preferences | 2021-07-06 | Paper |
Vertex deletion on split graphs: beyond 4-hitting set
Theoretical Computer Science | 2020-10-22 | Paper |
Conflict free version of covering problems on graphs: classical and parameterized
Theory of Computing Systems | 2020-08-26 | Paper |
Quadratic vertex kernel for split vertex deletion
Theoretical Computer Science | 2020-08-03 | Paper |
Parameterized complexity of conflict-free matchings and paths
Algorithmica | 2020-05-21 | Paper |
Vertex deletion on split graphs: beyond 4-hitting set
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Quadratic vertex kernel for split vertex deletion
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Conflict free version of covering problems on graphs: classical and parameterized
Computer Science – Theory and Applications | 2018-11-28 | Paper |
| Hitting and covering partially | 2018-10-04 | Paper |
Polynomial time efficient construction heuristics for vertex separation minimization problem
(available as arXiv preprint) | 2018-04-10 | Paper |
| Mixed Dominating Set: a parameterized perspective | 2018-01-04 | Paper |
