default search action
Vikash Tripathi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Michael A. Henning, Arti Pandey
, Gopika Sharma, Vikash Tripathi:
Algorithms and hardness results for edge total domination problem in graphs. Theor. Comput. Sci. 982: 114270 (2024) - [c6]Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. AAMAS 2024: 2659-2667 - [c5]Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma:
Parameterized Complexity of Paired Domination. IWOCA 2024: 523-536 - [i5]Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. CoRR abs/2402.02719 (2024) - 2023
- [j5]Vikash Tripathi
A linear-time algorithm for semitotal domination in strongly chordal graphs. Discret. Appl. Math. 338: 77-88 (2023) - [j4]Michael A. Henning, Arti Pandey
Algorithmic aspects of paired disjunctive domination in graphs. Theor. Comput. Sci. 966-967: 113990 (2023) - 2022
- [j3]Vikash Tripathi
Complexity of paired domination in AT-free and planar graphs. Theor. Comput. Sci. 930: 53-62 (2022) - [c4]Vikash Tripathi
Complexity of Paired Domination in AT-free and Planar Graphs. CALDAM 2022: 65-77 - 2021
- [j2]Michael A. Henning, Arti Pandey, Vikash Tripathi
Semipaired Domination in Some Subclasses of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [c3]Michael A. Henning
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. COCOA 2021: 247-261 - [i4]Vikash Tripathi, Arti Pandey, Anil Maheshwari:
A linear-time algorithm for semitotal domination in strongly chordal graphs. CoRR abs/2109.02142 (2021) - [i3]Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of Paired Domination in AT-free and Planar Graphs. CoRR abs/2112.05486 (2021) - 2020
- [j1]Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. Theory Comput. Syst. 64(7): 1225-1241 (2020) - [c2]Charu Varshney, S. C. Jain, Vikash Tripathi:
An Overview of Rumour Detection based on Social Media. ICCCNT 2020: 1-6 - [i2]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Semipaired Domination in Some Subclasses of Chordal Graphs. CoRR abs/2008.13491 (2020)
2010 – 2019
- 2019
- [c1]Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. IWOCA 2019: 278-289 - [i1]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. CoRR abs/1904.00964 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-11 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: