Parameterized complexity of fair feedback vertex set problem. - Lawqueen Kanesh; Soumen Maity; Komal Muluk; Saket Saurabh 001 (Theor. Comput. Sci., 2021)

A note on the complexity of the bilevel bottleneck assignment problem. - Dennis Fischer 001; Komal Muluk; Gerhard J. Woeginger (4OR, 2022)

On the complexity of singly connected vertex deletion. - Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Komal Muluk; Nidhi Purohit; Saket Saurabh 001 (Theor. Comput. Sci., 2022)

Make a Graph Singly Connected by Edge Orientations. - Tim A. Hartmann; Komal Muluk (IWOCA, 2023)

Recoverable Robust Optimization with Commitment. - Felix Hommelsheim; Nicole Megow; Komal Muluk; Britta Peis (CoRR, 2023)