Arti Pandey

From MaRDI portal
Person:344870

Available identifiers

zbMath Open pandey.artiMaRDI QIDQ344870

List of research outcomes





PublicationDate of PublicationType
More on the complexity of defensive domination in graphs2025-01-06Paper
Some algorithmic results for eternal vertex cover problem in graphs2024-11-12Paper
Algorithmic results for weak Roman domination problem in graphs2024-11-06Paper
Perfect Italian domination on some generalizations of cographs2024-10-08Paper
Eternal connected vertex cover problem in graphs: complexity and algorithms2024-05-31Paper
Some new algorithmic results on co-secure domination in graphs2024-03-05Paper
Algorithms and hardness results for edge total domination problem in graphs2024-02-23Paper
Complexity of total dominator coloring in graphs2024-01-05Paper
Computation of Grundy dominating sequences in (co-)bipartite graphs2024-01-05Paper
Cosecure domination: hardness results and algorithms2023-12-22Paper
Some algorithmic results for eternal vertex cover problem in graphs2023-11-24Paper
Computational aspects of double dominating sequences in graphs2023-08-17Paper
Complexity results on cosecure domination in graphs2023-08-17Paper
A linear-time algorithm for semitotal domination in strongly chordal graphs2023-08-02Paper
Algorithmic aspects of paired disjunctive domination in graphs2023-06-21Paper
Complexity of paired domination in at-free and planar graphs2023-05-08Paper
Algorithms for maximum internal spanning tree problem for some graph classes2022-10-31Paper
Semipaired Domination in Some Subclasses of Chordal Graphs2022-09-30Paper
https://portal.mardi4nfdi.de/entity/Q51042532022-09-09Paper
Complexity of paired domination in AT-free and planar graphs2022-08-25Paper
Approximation algorithm and hardness results for defensive domination in graphs2022-06-29Paper
Semitotal domination on AT-free graphs and circle graphs2022-03-24Paper
Complexity and algorithms for semipaired domination in graphs2021-06-11Paper
Maximum weight induced matching in some subclasses of bipartite graphs2021-05-03Paper
Maximum weighted edge biclique problem on bipartite graphs2020-07-21Paper
Complexity and algorithms for semipaired domination in graphs2020-02-25Paper
Algorithmic aspects of semitotal domination in graphs2019-03-14Paper
Domination in some subclasses of bipartite graphs2018-12-10Paper
Algorithmic aspects of \(b\)-disjunctive domination in graphs2018-07-20Paper
Restrained domination in some subclasses of chordal graphs2018-04-10Paper
On the complexity of minimum cardinality maximal uniquely restricted matching in graphs2017-12-01Paper
Induced Matching in Some Subclasses of Bipartite Graphs2017-04-07Paper
Algorithmic aspects of open neighborhood location-domination in graphs2016-11-24Paper
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results2016-03-23Paper
On the dominator coloring in proper interval graphs and block graphs2016-02-22Paper
Complexity of total outer-connected domination problem in graphs2015-12-10Paper
Algorithmic Aspects of Disjunctive Domination in Graphs2015-10-29Paper
Domination in Some Subclasses of Bipartite Graphs2015-02-19Paper
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs2015-01-15Paper
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs2014-02-18Paper

Research outcomes over time

This page was built for person: Arti Pandey