Nithin M. Varma

activity

20102026

most citedRainbow Connection Number and Connected Dominating Sets

112 citations · 116 across the 10 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.DS2025

Pseudodeterministic Algorithms for Minimum Cut Problems

Aryan Agarwala, Nithin Varma

In this paper, we present efficient pseudodeterministic algorithms for both the global minimum cut and minimum s-t cut problems. The running time of our algorithm for the global mi…

cs.DS2025

Testing forbidden order-pattern properties on hypergrids

Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg +1

We study testing $π$ -freeness of functions $f : [n]^{d} \to R$ , where $f$ is $π$ -free if there there are no $k$ indices $x_{1} ≺ \dots ≺ x_{k} \in [n]^{d}$ such that $f(x_i)<f(x_…