( en | de | ru )

 

Disambiguation of "Pandey, Arti"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.

, and . ICTCSDM, volume 10398 of Lecture Notes in Computer Science, page 218-227. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arti Dangwal

Shantanu Pandey

Arti Gaur

Arti Tibrewala

Dharmendra Pandey

 

Other publications of authors with the same name

Algorithms and hardness results for edge total domination problem in graphs., , , and . Theor. Comput. Sci., (January 2024)Cosecure Domination: Hardness Results and Algorithm., and . CoRR, (2023)Complexity and Algorithms for Semipaired Domination in Graphs., , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 278-289. Springer, (2019)Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs., and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 242-253. Springer, (2023)Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms., and . CALDAM, volume 14508 of Lecture Notes in Computer Science, page 179-193. Springer, (2024)On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs., and . ICTCSDM, volume 10398 of Lecture Notes in Computer Science, page 218-227. Springer, (2016)Detection of Compromised Accounts using Machine Learning Based Boosting Algorithms- AdaBoost, XGBoost, and CatBoost., and . ICCCNT, page 1-6. IEEE, (2023)Maximum Weighted Edge Biclique Problem on Bipartite Graphs., , and . CALDAM, volume 12016 of Lecture Notes in Computer Science, page 116-128. Springer, (2020)A linear-time algorithm for semitotal domination in strongly chordal graphs., , and . CoRR, (2021)Algorithms for maximum internal spanning tree problem for some graph classes., , and . J. Comb. Optim., 44 (5): 3419-3445 (2022)