Komal Muluk

Orcid: 0009-0002-3915-7198

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Recoverable Robust Optimization with Commitment.
CoRR, 2023

Make a Graph Singly Connected by Edge Orientations.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022
A note on the complexity of the bilevel bottleneck assignment problem.
4OR, 2022

2020
On the Complexity of Singly Connected Vertex Deletion.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Parameterized Complexity of Fair Feedback Vertex Set Problem.
Proceedings of the Computer Science - Theory and Applications, 2020


  Loading...