Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Nitiksha Modi

dblp:265/5505 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › shortest path
all-pairs shortest paths		 0.412020
Multiple Source Replacement Path Problem · PODC 2020
Graph algorithms and graph theory › graph algorithms › fault-tolerant graph structures › fault-tolerant shortest paths
replacement paths		 0.412020
Multiple Source Replacement Path Problem · PODC 2020
Graph algorithms and graph theory
shortest path		 0.412020
Multiple Source Replacement Path Problem · PODC 2020
YearPublicationVenuePosition
2020 Multiple Source Replacement Path Problem
abstract
One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph G, s and t, find shortest paths from s to t avoiding each edge e on the shortest path from s to t. These paths are called replacement paths in literature. For an undirected and unweighted graph, (Malik, Mittal, and Gupta, Operation Research Letters, 1989) and (Hershberger and Suri, FOCS 2001) designed an algorithm that solves the replacement path problem in Õ (m + n) time1. It is natural to ask whether we can generalize the replacement path problem: can we find all replacement paths from a source s to all vertices in G? This problem is called the Single Source Replacement Path Problem.
Manoj Gupta 0002, Rahul Jain 0020, Nitiksha Modi
 PODC3