Komal Muluk

According to our database, Komal Muluk authored at least 5 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Recoverable Robust Optimization with Commitment.

Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis

CoRR, 2023

Make a Graph Singly Connected by Edge Orientations.

Tim A. Hartmann, Komal Muluk

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

A note on the complexity of the bilevel bottleneck assignment problem.

Dennis Fischer, Komal Muluk, Gerhard J. Woeginger

4OR, 2022

2020

On the Complexity of Singly Connected Vertex Deletion.

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Parameterized Complexity of Fair Feedback Vertex Set Problem.

Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2020