V. Arvind

activity

20022026

most citedDerandomizing the Isolation Lemma and Lower Bounds for Circuit Size

8 citations · 28 across the 39 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

Isomorphism testing of $k$ -spanning tournaments is Fixed Parameter Tractable

Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov

An arc-colored tournament is said to be $k$ -spanning for an integer $k \geq 1$ if the union of its arc-color classes of maximal valency at most $k$ is the arc set of a strongly conn…

math.CO2007

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach

V. Arvind, Christine T. Cheng, Nikhil R. Devanur

A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest…

Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach

Isomorphism testing of $k$ -spanning tournaments is Fixed Parameter Tractable