Arti Pandey

Comput. Appl. Math., September, 2024

Algorithms and hardness results for edge total domination problem in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., January, 2024

Some new algorithmic results on co-secure domination in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

Algorithmic results for weak Roman domination problem in graphs.

[BibT_eX]

[DOI]

Ankit Sharma

Discret. Appl. Math., 2024

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs.

[BibT_eX]

[DOI]

Ankit Sharma

CoRR, 2024

Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Complexity of Total Dominator Coloring in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., December, 2023

Computation of Grundy dominating sequences in (co-)bipartite graphs.

[BibT_eX]

[DOI]

Bostjan Bresar

Comput. Appl. Math., December, 2023

A linear-time algorithm for semitotal domination in strongly chordal graphs.

[BibT_eX]

[DOI]

Anil Maheshwari

Discret. Appl. Math., October, 2023

Algorithmic aspects of paired disjunctive domination in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Cosecure Domination: Hardness Results and Algorithm.

[BibT_eX]

[DOI]

CoRR, 2023

Cosecure Domination: Hardness Results and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Detection of Compromised Accounts using Machine Learning Based Boosting Algorithms- AdaBoost, XGBoost, and CatBoost.

[BibT_eX]

[DOI]

Arti Jain

Proceedings of the 14th International Conference on Computing Communication and Networking Technologies, 2023

Computational Aspects of Double Dominating Sequences in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Complexity Results on Cosecure Domination in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Complexity of paired domination in AT-free and planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Algorithms for maximum internal spanning tree problem for some graph classes.

[BibT_eX]

[DOI]

Michael C. Wigal

J. Comb. Optim., 2022

2021

Semipaired Domination in Some Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

Approximation Algorithm and Hardness Results for Defensive Domination in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

Semitotal Domination on AT-Free Graphs and Circle Graphs.

[BibT_eX]

[DOI]

Ton Kloks

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Complexity and Algorithms for Semipaired Domination in Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Maximum weight induced matching in some subclasses of bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Maximum Weighted Edge Biclique Problem on Bipartite Graphs.

[BibT_eX]

[DOI]

Nivedit Jain

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Algorithmic aspects of semitotal domination in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Domination in some subclasses of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Algorithmic aspects of b-disjunctive domination in graphs.

[BibT_eX]

[DOI]

Subhabrata Paul

J. Comb. Optim., 2018

2017

Restrained Domination in Some Subclasses of Chordal Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Algorithmic aspects of open neighborhood location-domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Induced Matching in Some Subclasses of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Complexity of total outer-connected domination problem in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Some Algorithmic Results on Restrained Domination in Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

On the dominator coloring in proper interval graphs and block graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2015

Algorithmic aspects of disjunctive domination in graphs.

[BibT_eX]

[DOI]

CoRR, 2015

k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks.

[BibT_eX]

[DOI]

D. Pushparaj Shetty

Proceedings of the Distributed Computing and Internet Technology, 2015

Algorithmic Aspects of Disjunctive Domination in Graphs.

[BibT_eX]

[DOI]

Subhabrata Paul

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Information Technology, 2015

2014

Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.

[BibT_eX]

[DOI]