Verma, Shaily
42  Ergebnisse:
Personensuche X
?
1

Parameterized Complexity of Paired Domination:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Andreev, Nikita ; Bliznets, Ivan ; Kundu, Madhumita... - p. 523-536 , 2024
 
?
 
?
3

Partitioning Subclasses of Chordal Graphs with Few Deletion:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Jana, Satyabrata ; Saha, Souvik ; Sahu, Abhishek.. - p. 293-307 , 2023
 
?
4

Burn and Win:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Ashok, Pradeesha ; Das, Sayani ; Kanesh, Lawqueen... - p. 36-48 , 2023
 
?
5

Parameterized Algorithms for Eccentricity Shortest Path Pro..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
 
?
7

List Homomorphism: Beyond the Known Boundaries:

, In: LATIN 2022: Theoretical Informatics; Lecture Notes in Computer Science,
 
?
9

On the total and AVD-total coloring of graphs:

Panda, B. S. ; Verma, Shaily ; Keerti, Yash
AKCE International Journal of Graphs and Combinatorics.  17 (2020)  3 - p. 820-825 , 2020
 
?
10

Grundy coloring in some subclasses of bipartite graphs and ..:

Verma, Shaily ; Panda, B.S.
Information Processing Letters.  163 (2020)  - p. 105999 , 2020
 
?
11

On partial Grundy coloring of bipartite graphs and chordal ..:

Panda, B.S. ; Verma, Shaily
Discrete Applied Mathematics.  271 (2019)  - p. 171-183 , 2019
 
?
15

A comparative study of parasympathetic function tests durin..:

Verma, Shaily ; Khuraiya, Prashant ; Soni, Rajni
https://www.msjonline.org/index.php/ijrms/article/view/4716/3786.  , 2018
 
1-15