Paper 'Multidimensional Budget-Feasible Mechanism Design' (Preprint)
Paper 'An O(log log n)-approximate budget feasible mechanism for subadditive valuations' accepted to EC 2025
Paper 'Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints' published at ITCS 2024
Paper 'Recognizing k-Clique Extendible Orderings' published in Algorithmica 2021 (preliminary version in WG 2020)
Paper 'On the Parameterized Complexity of Deletion to H-free Strong Components' published in SIAM Journal on Discrete Mathematics 2024 (preliminary version in MFCS 2020)
Paper 'Tractability of König edge deletion problems' published in TCS 2019