| Publication | Date of Publication | Type |
|---|
Just-in-time scheduling in two-stage flexible flow shops
European Journal of Operational Research | 2026-06-04 | Paper |
| Minimizing the weighted number of tardy jobs is W[1]-hard | 2026-05-26 | Paper |
| No polynomial kernels for knapsack | 2026-01-14 | Paper |
| Single machine scheduling with few deadlines | 2025-09-24 | Paper |
Fair repetitive interval scheduling
Algorithmica | 2025-08-29 | Paper |
Effective data reduction for strongly stable matching in very sparse graphs
Information Processing Letters | 2025-01-14 | Paper |
| Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication | 2025-01-06 | Paper |
Adapting stable matchings to forced and forbidden pairs
Journal of Computer and System Sciences | 2024-10-29 | Paper |
| Parameterized lower bounds for problems in P via fine-grained cross-compositions | 2024-10-08 | Paper |
| Deepening the (parameterized) complexity analysis of incremental stable matching problems | 2024-08-06 | Paper |
Popular matchings with weighted voters
Games and Economic Behavior | 2024-04-30 | Paper |
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
Games and Economic Behavior | 2024-01-11 | Paper |
| scientific article; zbMATH DE number 7765394 (Why is no real title available?) | 2023-11-14 | Paper |
| No Polynomial Kernels for Knapsack | 2023-08-24 | Paper |
Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
Algorithmic Game Theory | 2023-07-28 | Paper |
Equitable scheduling on a single machine
Journal of Scheduling | 2023-06-27 | Paper |
Equitable scheduling on a single machine
Journal of Scheduling | 2023-06-27 | Paper |
Multidimensional stable roommates with master list
(available as arXiv preprint) | 2023-03-21 | Paper |
A fine-grained view on stable many-to-one matching problems with lower and upper quotas
(available as arXiv preprint) | 2023-03-21 | Paper |
| Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters | 2023-02-03 | Paper |
| Bribery and control in stable marriage | 2022-12-21 | Paper |
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Information and Computation | 2022-12-08 | Paper |
Length-bounded cuts: proper interval graphs and structural parameters
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Bribery and control in stable marriage
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Multistage graph problems on a global budget
Theoretical Computer Science | 2021-05-10 | Paper |
The stable marriage problem with ties and restricted edges
Discrete Optimization | 2020-07-30 | Paper |
Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
SIAM Journal on Discrete Mathematics | 2017-08-31 | Paper |
