Ankit Abhinav
From MaRDI portal
Person:2097205
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 |
|---|---|---|
| Parameterized complexity of feedback vertex set with connectivity constraints Journal of Computer and System Sciences | 2026-08-03 | Paper |
| On the parameterized complexity of connected cluster vertex deletion | 2026-02-26 | Paper |
| Towards transitive-free digraphs Theoretical Computer Science | 2025-05-12 | Paper |
| Parameterized complexity of non-separating and non-disconnecting paths and sets | 2024-08-06 | Paper |
| Parameterized algorithms for finding highly connected solution Theoretical Computer Science | 2022-12-21 | Paper |
| Parameterized algorithms for finding highly connected solution Computer Science – Theory and Applications | 2022-11-11 | Paper |
Research outcomes over time
This page was built for person: Ankit Abhinav
