Komal Muluk
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Make a graph singly connected by edge orientations Lecture Notes in Computer Science | 2023-12-22 | Paper |
| A note on the complexity of the bilevel bottleneck assignment problem 4OR | 2022-11-17 | Paper |
| Parameterized Complexity of Fair Feedback Vertex Set Problem Computer Science – Theory and Applications | 2022-10-19 | Paper |
| On the Complexity of Singly Connected Vertex Deletion Lecture Notes in Computer Science | 2022-10-13 | Paper |
| On the complexity of singly connected vertex deletion Theoretical Computer Science | 2022-10-06 | Paper |
| Parameterized complexity of fair feedback vertex set problem Theoretical Computer Science | 2021-04-15 | Paper |
Research outcomes over time
This page was built for person: Komal Muluk
