Personal information

No personal information available

Activities

Works (5)

Make a Graph Singly Connected by Edge Orientations

Lecture Notes in Computer Science
2023 | Book chapter
Contributors: Tim Hartmann; Komal Muluk
Source: Self-asserted source
Komal Muluk

Recoverable Robust Optimization with Commitment

2023 | Preprint
Contributors: Felix Hommelsheim; Nicole Megow; Komal Muluk; Britta Peis
Source: Self-asserted source
Komal Muluk

A note on the complexity of the bilevel bottleneck assignment problem

4OR
2022-12 | Journal article
Contributors: Dennis Fischer; Komal Muluk; Gerhard J. Woeginger
Source: Self-asserted source
Komal Muluk

On the complexity of singly connected vertex deletion

Theoretical Computer Science
2022-10 | Journal article
Contributors: Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Komal Muluk; Nidhi Purohit; Saket Saurabh
Source: Self-asserted source
Komal Muluk

Parameterized complexity of fair feedback vertex set problem

Theoretical Computer Science
2021-05 | Journal article
Contributors: Lawqueen Kanesh; Soumen Maity; Komal Muluk; Saket Saurabh
Source: Self-asserted source
Komal Muluk