Anjeneya Swami Kare

Discret. Appl. Math., 2026

2025

Interest maximization in social networks.

[BibT_eX]

[DOI]

S. Durga Bhavani

J. Supercomput., January, 2025

Structural Parameterization of Minus Domination.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

Approximation algorithms for the graph burning on cactus and directed trees.

[BibT_eX]

[DOI]

S. Durga Bhavani

Discret. Math. Algorithms Appl., October, 2024

Algorithms for Minimum Membership Dominating Set Problem.

[BibT_eX]

[DOI]

CoRR, 2024

Heuristics for Influence Maximization with Tiered Influence and Activation thresholds.

[BibT_eX]

[DOI]

Durga Bhavani S.

CoRR, 2024

A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks.

[BibT_eX]

[DOI]

Vivek Kumar Rajak

Proceedings of the Distributed Computing and Intelligent Technology, 2024

2023

Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks.

[BibT_eX]

[DOI]

S. Durga Bhavani

Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2023

Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques.

[BibT_eX]

[DOI]

Leela Srija Alla

Proceedings of the Distributed Computing and Intelligent Technology, 2023

Structural Parameterization of Alliance Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Vertex partitioning problems on graphs with bounded tree width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Faster heuristics for graph burning.

[BibT_eX]

[DOI]

Durga Bhavani S.

Appl. Intell., 2022

2021

Heuristics for the Generalized Graph Coloring Problem.

[BibT_eX]

[DOI]

Varun Kumar

Proceedings of the 12th International Conference on Computing Communication and Networking Technologies, 2021

2020

Parameterized complexity of happy coloring problems.

[BibT_eX]

[DOI]

Akanksha Agrawal

Theor. Comput. Sci., 2020

Heuristics for the Power Edge Set Problem.

[BibT_eX]

[DOI]

Sreshta Valluru

Proceedings of the 11th International Conference on Computing, 2020

2019

Parameterized Algorithms for Graph Burning Problem.

[BibT_eX]

[DOI]

I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

H-Free Coloring on Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Bipartitioning Problems on Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

CoRR, 2018

On the Tractability of (k, i)-Coloring.

[BibT_eX]

[DOI]

Saurabh Joshi

Sriram Bhyravarapu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Algorithms and hardness results for happy coloring problems.

[BibT_eX]

[DOI]

Juho Lauri

CoRR, 2017

On Structural Parameterizations of the Matching Cut Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

A Simple Algorithm For Replacement Paths Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2014

Swap Edges of Shortest Path Tree in Parallel.

[BibT_eX]

[DOI]

Sanjeev Saxena

Proceedings of the Recent Advances in Information Technology, 2014

2013

Efficient solutions for finding vitality with respect to shortest paths.

[BibT_eX]

[DOI]