| A polynomial kernel for bipartite permutation vertex deletion L Kanesh, J Madathil, A Sahu, S Saurabh, S Verma 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 2021 | 3 | 2021 |
| Adjacent vertex distinguishing total coloring of the corona product of graphs S Verma, BS Panda Discussiones Mathematicae Graph Theory, 2022 | 2 | 2022 |
| Vertex-Edge Domination in Interval and Bipartite Permutation Graphs S Paul, D Pradhan, S Verma Discussiones Mathematicae Graph Theory 43 (4), 947-963, 2021 | 2 | 2021 |
| On the total and AVD-total coloring of graphs BS Panda, S Verma, Y Keerti AKCE International Journal of Graphs and Combinatorics 17 (3), 820-825, 2020 | 2 | 2020 |
| On partial Grundy coloring of bipartite graphs and chordal graphs BS Panda, S Verma Discrete Applied Mathematics 271, 171-183, 2019 | 2 | 2019 |
| Burn and win P Ashok, S Das, L Kanesh, S Saurabh, A Tomar, S Verma International Workshop on Combinatorial Algorithms, 36-48, 2023 | 1 | 2023 |
| Parameterized Algorithms for Eccentricity Shortest Path Problem S Bhyravarapu, S Jana, L Kanesh, S Saurabh, S Verma International Workshop on Combinatorial Algorithms, 74-86, 2023 | 1 | 2023 |
| Adjacent vertex distinguishing total coloring in split graphs S Verma, HL Fu, BS Panda Discrete Mathematics 345 (11), 113061, 2022 | 1 | 2022 |
| An exact algorithm for knot-free vertex deletion MS Ramanujan, A Sahu, S Saurabh, S Verma Schloss Dagstuhl—Leibniz-Zentrum für Informatik 241, 78, 2022 | 1 | 2022 |
| Grundy coloring in some subclasses of bipartite graphs and their complements S Verma, BS Panda Information Processing Letters 163, 105999, 2020 | 1 | 2020 |
| Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs BS Panda, S Verma Theoretical Computer Science and Discrete Mathematics: First International …, 2017 | 1 | 2017 |
| Parameterized Complexity of Paired Domination N Andreev, I Bliznets, M Kundu, S Saurabh, V Tripathi, S Verma International Workshop on Combinatorial Algorithms, 523-536, 2024 | | 2024 |
| Partitioning subclasses of chordal graphs with few deletions S Jana, S Saha, A Sahu, S Saurabh, S Verma Theoretical Computer Science 983, 114288, 2024 | | 2024 |
| Check for updates P Ashok¹, S Das, L Kanesh, S Saurabh, A Tomar¹, S Verma Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan …, 2023 | | 2023 |
| Parameterized Algorithms for Eccentricity Shortest Path Problem S Saurabh, S Verma Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan …, 2023 | | 2023 |
| A polynomial kernel for bipartite permutation vertex deletion J Derbisz, L Kanesh, J Madathil, A Sahu, S Saurabh, S Verma Algorithmica 84 (11), 3246-3275, 2022 | | 2022 |
| List Homomorphism: Beyond the Known Boundaries S Bhyravarapu, S Jana, F Panolan, S Saurabh, S Verma Latin American Symposium on Theoretical Informatics, 593-609, 2022 | | 2022 |
| 16th International Symposium on Parameterized and Exact Computation (IPEC 2021) A Agrawal, A Anand, S Saurabh, RK Allumalla, VT Dhanekula, H An, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021 | | 2021 |
| Edge Domination in subclasses of bipartite graphs BS Panda, S Verma 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 140, 2018 | | 2018 |
| Graph coloring and its variations structural and algorithmic study S Verma Delhi, 0 | | |
Saket SaurabhProfessor at Institute of Mathematical Sciences在 imsc.res.in 的电子邮件经过验证
