Vikash Tripathi

21 papers A 1B 1C 3Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Budget-feasible egalitarian allocation of conflicting jobs.
Auton. Agents Multi Agent Syst.
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2025 J jnl
More on the complexity of defensive domination in graphs.
Discret. Appl. Math.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2025 B conf
On the Parameterized Complexity of Cosecure Domination.
FCT
D. Karthika, R. Muthucumaraswamy, V. P. Abidha, Pradeesha Ashok, Sriram Bhyravarapu, Sayani Das, Saket Saurabh, Ayush Sawlani, Vikash Tripathi
2025 J jnl
Some complexity results on semipaired domination in graphs.
AKCE Int. J. Graphs Comb.
Vikash Tripathi, Kusum, Arti Pandey
2024 J jnl
Algorithms and hardness results for edge total domination problem in graphs.
Theor. Comput. Sci.
Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi
2024 A conf
Budget-feasible Egalitarian Allocation of Conflicting Jobs.
AAMAS
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2024 J jnl
Budget-feasible Egalitarian Allocation of Conflicting Jobs.
CoRR
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2024 C conf
Parameterized Complexity of Paired Domination.
IWOCA
Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma
2023 J jnl
A linear-time algorithm for semitotal domination in strongly chordal graphs.
Discret. Appl. Math.
Vikash Tripathi, Arti Pandey, Anil Maheshwari
2023 J jnl
Algorithmic aspects of paired disjunctive domination in graphs.
Theor. Comput. Sci.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2022 — conf
Complexity of Paired Domination in AT-free and Planar Graphs.
CALDAM
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2022 J jnl
Complexity of paired domination in AT-free and planar graphs.
Theor. Comput. Sci.
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 J jnl
A linear-time algorithm for semitotal domination in strongly chordal graphs.
CoRR
Vikash Tripathi, Arti Pandey, Anil Maheshwari
2021 C conf
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs.
COCOA
Michael A. Henning, Arti Pandey, Vikash Tripathi
2021 J jnl
Complexity of Paired Domination in AT-free and Planar Graphs.
CoRR
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang
2021 J jnl
Semipaired Domination in Some Subclasses of Chordal Graphs.
Discret. Math. Theor. Comput. Sci.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2020 — conf
An Overview of Rumour Detection based on Social Media.
ICCCNT
Charu Varshney, S. C. Jain, Vikash Tripathi
2020 J jnl
Complexity and Algorithms for Semipaired Domination in Graphs.
Theory Comput. Syst.
Michael A. Henning, Arti Pandey, Vikash Tripathi
2020 J jnl
Semipaired Domination in Some Subclasses of Chordal Graphs.
CoRR
Michael A. Henning, Arti Pandey, Vikash Tripathi
2019 C conf
Complexity and Algorithms for Semipaired Domination in Graphs.
IWOCA
Michael A. Henning, Arti Pandey, Vikash Tripathi
2019 J jnl
Complexity and Algorithms for Semipaired Domination in Graphs.
CoRR
Michael A. Henning, Arti Pandey, Vikash Tripathi