EDBT 2026 Demo / reviewers in the wild / expert
Arti Pandey
dblp:139/8220
· DBLP profile ↗
20ranked-venue papers
1as first author
13since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 18 · 1 first-author · 11 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Improved Bounds on Proper Conflict-Free Coloring of Graphs
Kaustav Paul, Arti Pandey |
IWOCA | 3 |
| 2026 | Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
Florent Foucaud, Arti Pandey, Kaustav Paul |
Discret. Appl. Math. | 2 |
| 2025 | More on the complexity of defensive domination in graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi |
Discret. Appl. Math. | 2 |
| 2025 | Exploring algorithmic solutions for the Independent Roman Domination problem in graphs
Kaustav Paul, Arti Pandey |
Discret. Appl. Math. | 3 |
| 2024 | (Independent) Roman Domination Parameterized by Distance to Cluster
Pradeesha Ashok, Gautam K. Das, Arti Pandey, Kaustav Paul, Subhabrata Paul |
COCOA (2) | 3 |
| 2024 | Algorithmic results for weak Roman domination problem in graphs
Kaustav Paul, Arti Pandey |
Discret. Appl. Math. | 3 |
| 2024 | Algorithms and hardness results for edge total domination problem in graphs
Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi |
Theor. Comput. Sci. | 2 |
| 2024 | Some new algorithmic results on co-secure domination in graphs
Kusum, Arti Pandey |
Theor. Comput. Sci. | 2 |
| 2023 | Cosecure Domination: Hardness Results and Algorithms
Kusum, Arti Pandey |
IWOCA | 2 |
| 2023 | A linear-time algorithm for semitotal domination in strongly chordal graphs
Vikash Tripathi, Arti Pandey, Anil Maheshwari |
Discret. Appl. Math. | 2 |
| 2023 | Algorithmic aspects of paired disjunctive domination in graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi |
Theor. Comput. Sci. | 2 |
| 2022 | Complexity of paired domination in AT-free and planar graphs
Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang |
Theor. Comput. Sci. | 3 |
| 2021 | Approximation Algorithm and Hardness Results for Defensive Domination in Graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi |
COCOA | 2 |
| 2020 | Complexity and Algorithms for Semipaired Domination in Graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi |
Theory Comput. Syst. | 2 |
| 2019 | Complexity and Algorithms for Semipaired Domination in Graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi |
IWOCA | 2 |
| 2019 | Domination in some subclasses of bipartite graphs
Arti Pandey, Bhawani Sankar Panda |
Discret. Appl. Math. | 1 |
| 2019 | Algorithmic aspects of semitotal domination in graphs
Michael A. Henning, Arti Pandey |
Theor. Comput. Sci. | 2 |
| 2017 | Algorithmic aspects of open neighborhood location-domination in graphs
Bhawani Sankar Panda, Arti Pandey |
Discret. Appl. Math. | 2 |
| 2016 | Complexity of total outer-connected domination problem in graphs
Bhawani Sankar Panda, Arti Pandey |
Discret. Appl. Math. | 2 |
| 2015 | Algorithmic Aspects of Disjunctive Domination in Graphs
Bhawani Sankar Panda, Arti Pandey, Subhabrata Paul |
COCOON | 2 |