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 |
|---|---|---|
| Structural parameterization of alliance problems Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
| Vertex partitioning problems on graphs with bounded tree width Discrete Applied Mathematics | 2022-08-04 | Paper |
| On the tractability of \(( k , i )\)-coloring Discrete Applied Mathematics | 2021-10-21 | Paper |
| Parameterized complexity of happy coloring problems Theoretical Computer Science | 2020-08-17 | Paper |
| Parameterized algorithms for Graph Burning problem | 2020-02-25 | Paper |
| \(H\)-free coloring on graphs with bounded tree-width | 2019-10-10 | Paper |
| On the tractability of \((k,i)\)-coloring | 2018-06-05 | Paper |
| On the tractability of \((k,i)\)-coloring (available as arXiv preprint) | 2018-06-05 | Paper |
| On structural parameterizations of the matching cut problem | 2018-03-26 | Paper |
| A simple algorithm for replacement paths problem (available as arXiv preprint) | 2016-10-19 | Paper |
| Linear Time Algorithms for Happy Vertex Coloring Problems for Trees Lecture Notes in Computer Science | 2016-09-29 | Paper |
Research outcomes over time
This page was built for person: Anjeneya Swami Kare
