The following pages link to Anjeneya Swami Kare (Q327667):
Displaying 9 items.
- A simple algorithm for replacement paths problem (Q327668) (← links)
- On structural parameterizations of the matching cut problem (Q1708644) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Parameterized algorithms for Graph Burning problem (Q2301751) (← links)
- \(H\)-free coloring on graphs with bounded tree-width (Q2326574) (← links)
- On the tractability of \((k,i)\)-coloring (Q2636563) (← links)
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511) (← links)
