Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Vikash Tripathi
Observed name:
Tripathi, Vikash
Institution:
Indian Institute of Technology Mandi
Observed institutions:
Indian Institute of Technology Ropar,
Institute of Mathematical Sciences,
Indian Institute of Technology Mandi
ORCID:
0000-0002-5703-0417
Observed ORCID:
0000-0002-5703-0417
OpenAlex ID:
A5044880150
Complexity of paired domination in AT-free and planar graphs
2022
·
Vikash Tripathi
, Ton Kloks
, et al.
·
Theoretical Computer Science
·
11
Complexity and Algorithms for Semipaired Domination in Graphs
2019
·
Michael A. Henning
, Arti Pandey
, et al.
·
Lecture notes in computer science
·
5
PDF
A linear-time algorithm for semitotal domination in strongly chordal graphs
2023
·
Vikash Tripathi
, Arti Pandey
, et al.
·
Discrete Applied Mathematics
·
3
PDF
Algorithmic aspects of paired disjunctive domination in graphs
2023
·
Michael A. Henning
, Arti Pandey
, et al.
·
Theoretical Computer Science
·
3
Complexity of Paired Domination in AT-free and Planar Graphs
2022
·
Vikash Tripathi
, Ton Kloks
, et al.
·
Lecture notes in computer science
·
3
Budget-feasible egalitarian allocation of conflicting jobs
2025
·
Sushmita Gupta
, Pallavi Jain
, et al.
·
Autonomous Agents and Multi-Agent Systems
·
1
PDF
More on the complexity of defensive domination in graphs
2024
·
Michael A. Henning
, Arti Pandey
, et al.
·
Discrete Applied Mathematics
·
1
Budget-feasible Egalitarian Allocation of Conflicting Jobs
2024
·
Sushmita Gupta
, Pallavi Jain
, et al.
·
Adaptive Agents and Multi-Agents Systems
·
1
Algorithms and hardness results for edge total domination problem in graphs
2023
·
Michael A. Henning
, Arti Pandey
, et al.
·
Theoretical Computer Science
·
1
Complexity of Paired Domination in At-Free and Planar Graphs
2022
·
Arti Pandey
, Vikash Tripathi
, et al.
·
SSRN Electronic Journal
·
1
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs
2021
·
Michael A. Henning
, Arti Pandey
, et al.
·
Lecture notes in computer science
·
1
Revisiting Non-Adaptive Set Membership Schemes: Removing the Logarithmic Factor
2026
·
Baig, Mirza Galib Anwarul Husain
, Kumar, Aman
, et al.
·
arXiv (Cornell University)
PDF
Some complexity results on semipaired domination in graphs
2025
·
Vikash Tripathi
, Kusum
, et al.
·
AKCE International Journal of Graphs and Combinatorics
PDF
Budget-feasible Egalitarian Allocation of Conflicting Jobs
2024
·
Gupta, Sushmita
, Jain, Pallavi
, et al.
·
arXiv (Cornell University)
PDF
Parameterized Complexity of Paired Domination
2024
·
Nikita Andreev
, Ivan Bliznets
, et al.
·
Lecture notes in computer science
Algorithmic Aspects of Disjunctive Paired Domination in Graphs
2022
·
Arti Pandey
, Michael A. Henning
, et al.
·
SSRN Electronic Journal
Complexity of Paired Domination in AT-free and Planar Graphs
2021
·
Tripathi, Vikash
, Kloks, Ton
, et al.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
18
Citation count:
31
H-index:
3
I10-index:
1
Year
Topic
Type
