Anjeneya Swami Kare
Anjeneya Swami Kare
Verified email at uohyd.ac.in
TitleCited byYear
Algorithms and hardness results for happy coloring problems
NR Aravind, S Kalyanasundaram, AS Kare, J Lauri
arXiv preprint arXiv:1705.08282, 2017
102017
Linear time algorithms for happy vertex coloring problems for trees
NR Aravind, S Kalyanasundaram, AS Kare
International Workshop on Combinatorial Algorithms, 281-292, 2016
102016
On structural parameterizations of the matching cut problem
NR Aravind, S Kalyanasundaram, AS Kare
International Conference on Combinatorial Optimization and Applications, 475-482, 2017
42017
On the Tractability of (ki)-Coloring
S Joshi, S Kalyanasundaram, AS Kare, S Bhyravarapu
Conference on Algorithms and Discrete Applied Mathematics, 188-198, 2018
22018
A simple algorithm for replacement paths problem
AS Kare
Electronic Notes in Discrete Mathematics 53, 307-318, 2016
22016
Efficient solutions for finding vitality with respect to shortest paths
AS Kare, S Saxena
2013 Sixth International Conference on Contemporary Computing (IC3), 70-75, 2013
22013
Bipartitioning problems on graphs with bounded tree-width
NR Aravind, S Kalyanasundaram, AS Kare
arXiv preprint arXiv:1804.04016, 2018
12018
Parameterized Algorithms for Graph Burning Problem
AS Kare, IV Reddy
International Workshop on Combinatorial Algorithms, 304-314, 2019
2019
H-Free Coloring on Graphs with Bounded Tree-Width
NR Aravind, S Kalyanasundaram, AS Kare
Conference on Algorithms and Discrete Applied Mathematics, 231-244, 2019
2019
Parameterized Algorithms for Graph Partitioning Problems
AS Kare, S Kalyanasundaram
Indian institute of technology Hyderabad, 2018
2018
On Structural Parameterizations of the Matching Cut Problem
A NR, S Kalyanasundaram, AS Kare
2017
Swap Edges of Shortest Path Tree in Parallel
AS Kare, S Saxena
Recent Advances in Information Technology, 77-85, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–12