![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Shaily Verma
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Shaily Verma, Bhawani Sankar Panda
:
Adjacent vertex distinguishing total coloring of the corona product of graphs. Discuss. Math. Graph Theory 44(1): 317 (2024) - [j7]Satyabrata Jana, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. 983: 114288 (2024) - [c8]Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma:
Parameterized Complexity of Paired Domination. IWOCA 2024: 523-536 - 2023
- [j6]Subhabrata Paul, Dinabandhu Pradhan, Shaily Verma:
Vertex-edge domination in interval and bipartite permutation graphs. Discuss. Math. Graph Theory 43(4): 947-963 (2023) - [c7]Satyabrata Jana
, Souvik Saha
, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - [c6]Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma:
Burn and Win. IWOCA 2023: 36-48 - [c5]Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [i1]Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - 2022
- [j5]Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. Algorithmica 84(11): 3246-3275 (2022) - [j4]Shaily Verma, Hung-Lin Fu, B. S. Panda:
Adjacent vertex distinguishing total coloring in split graphs. Discret. Math. 345(11): 113061 (2022) - [c4]Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan
, Saket Saurabh, Shaily Verma:
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - [c3]M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma:
An Exact Algorithm for Knot-Free Vertex Deletion. MFCS 2022: 78:1-78:15 - 2021
- [c2]Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma:
A Polynomial Kernel for Bipartite Permutation Vertex Deletion. IPEC 2021: 23:1-23:18 - 2020
- [j3]B. S. Panda, Shaily Verma, Yash Keerti:
On the total and AVD-total coloring of graphs. AKCE Int. J. Graphs Comb. 17(3): 820-825 (2020) - [j2]Shaily Verma, B. S. Panda:
Grundy coloring in some subclasses of bipartite graphs and their complements. Inf. Process. Lett. 163: 105999 (2020)
2010 – 2019
- 2019
- [j1]B. S. Panda, Shaily Verma:
On partial Grundy coloring of bipartite graphs and chordal graphs. Discret. Appl. Math. 271: 171-183 (2019) - 2016
- [c1]B. S. Panda, Shaily Verma:
Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. ICTCSDM 2016: 228-237
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint