On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. - Vikraman Arvind; Somenath Biswas (FSTTCS, 1987)

Expressibility of First Order Logic with a Nondeterministic Inductive Operator. - Vikraman Arvind; Somenath Biswas (STACS, 1987)

An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. - Vikraman Arvind; Somenath Biswas (Inf. Process. Lett., 1987)

On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. - Vikraman Arvind; Somenath Biswas (Theor. Comput. Sci., 1989)

A heuristic search strategy for optimization of trade-off cost measures. - Rakesh Kumar Singh; Shashi Kumar; Vikraman Arvind (ICTAI, 1991)

Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. - Vikraman Arvind; Somenath Biswas (Int. J. Found. Comput. Sci., 1991)

On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk (FSTTCS, 1992)

Reductions to Sets of Low Information Content. - Vikraman Arvind; Yenjo Han; Lane A. Hemachandra; Johannes Köbler; Antoni Lozano; Martin Mundhenk; Mitsunori Ogiwara; Uwe Schöning; Riccardo Silvestri; Thomas Thierauf (ICALP, 1992)

Lowness and the Complexity of Sparse and Tally Descriptions. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk (ISAAC, 1992)

Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk (MFCS, 1993)

Polynomial Time Truth-Table Reductions to P-Selective Sets. - Manindra Agrawal; Vikraman Arvind (SCT, 1994)

Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. - Manindra Agrawal; Vikraman Arvind (SCT, 1995)

On Helping and Interactive Proof Systems. - Vikraman Arvind; Johannes Köbler; Rainer Schuler (Int. J. Found. Comput. Sci., 1995)

On Reductions to Sets that Avoid EXPSPACE. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk (Inf. Process. Lett., 1995)

If NP has Polynomial-Size Circuits, then MA=AM. - Vikraman Arvind; Johannes Köbler; Uwe Schöning; Rainer Schuler (Theor. Comput. Sci., 1995)

The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). - Vikraman Arvind; N. V. Vinodchandran (ALT, 1996)

A Note on the Self-Witnessing Property of Computational Problems. - Vikraman Arvind (COCOON, 1996)

A Note on Decision versus Search for Graph Automorphism. - Manindra Agrawal; Vikraman Arvind (Inf. Comput., 1996)

Monotonous and Randomized Reductions to Sparse Sets. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk (RAIRO Theor. Informatics Appl., 1996)

Upper Bounds for the Complexity of Sparse and Tally Descriptions. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk (Math. Syst. Theory, 1996)

Geometric Sets of Low Information Content. - Manindra Agrawal; Vikraman Arvind (Theor. Comput. Sci., 1996)

Quasi-Linear Truth-Table Reductions to p-Selective Sets. - Manindra Agrawal; Vikraman Arvind (Theor. Comput. Sci., 1996)

Exact Learning via Teaching Assistants (Extended Abstract). - Vikraman Arvind; N. V. Vinodchandran (ALT, 1997)

On Resource-Bounded Measure and Pseudorandomness. - Vikraman Arvind; Johannes Köbler (FSTTCS, 1997)

Constructivizing Membership Proofs in Complexity Classes. - Vikraman Arvind (Int. J. Found. Comput. Sci., 1997)

Solvable Black-Box Group Problems are Low for PP. - Vikraman Arvind; N. V. Vinodchandran (Theor. Comput. Sci., 1997)

Arithmetic Complexity, Kleene Closure, and Formal Power Series - Eric Allender; Vikraman Arvind; Meena Mahajan (Electron. Colloquium Comput. Complex., 1999)

Graph Isomorphism is Low for ZPPNP and other Lowness results. - Vikraman Arvind; Johannes Köbler (Electron. Colloquium Comput. Complex., 1999)

Sparse Sets, Approximable Sets, and Parallel Queries to NP. - Vikraman Arvind; Jacobo Torán (Inf. Process. Lett., 1999)

Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. - Vikraman Arvind; Johannes Köbler (STACS, 2000)

Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk; Jacobo Torán (STACS, 2000)

The Complexity of Modular Graph Automorphism. - Vikraman Arvind; Richard Beigel; Antoni Lozano (SIAM J. Comput., 2000)

Exact learning via teaching assistants. - Vikraman Arvind; N. V. Vinodchandran (Theor. Comput. Sci., 2000)

The counting complexity of group-definable languages. - Vikraman Arvind; N. V. Vinodchandran (Theor. Comput. Sci., 2000)

On pseudorandomness and resource-bounded measure. - Vikraman Arvind; Johannes Köbler (Theor. Comput. Sci., 2001)

A nonadaptive NC checker for permutation group intersection. - Vikraman Arvind; Jacobo Torán (Theor. Comput. Sci., 2001)

Approximation Algorithms for Some Parameterized Counting Problems. - Vikraman Arvind; Venkatesh Raman 001 (ISAAC, 2002)

The Query Complexity of Program Checking by Constant-Depth Circuits. - Vikraman Arvind; K. V. Subrahmanyam 001; N. V. Vinodchandran (Chic. J. Theor. Comput. Sci., 2002)

Approximate Counting small subgraphs of bounded treewidth and related problems - Vikraman Arvind; Venkatesh Raman 001 (Electron. Colloquium Comput. Complex., 2002)

Graph Isomorphism is in SPP - Vikraman Arvind; Piyush P. Kurur (Electron. Colloquium Comput. Complex., 2002)

New Lowness Results for ZPPNP and Other Complexity Classes. - Vikraman Arvind; Johannes Köbler (J. Comput. Syst. Sci., 2002)

The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. - Vikraman Arvind; Rainer Schuler (ISAAC, 2003)

Upper Bounds on the Complexity of some Galois Theory Problems - Vikraman Arvind; Piyush P. Kurur (Electron. Colloquium Comput. Complex., 2003)

On the Complexity of Computing Units in a Number Field. - Vikraman Arvind; Piyush P. Kurur (ANTS, 2004)

Solvable Group Isomorphism. - Vikraman Arvind; Jacobo Torán (CCC, 2004)

Abelian Permutation Group Problems and Logspace Counting Classes. - Vikraman Arvind; T. C. Vijayaraghavan (CCC, 2004)

Solvable Group Isomorphism is (almost) in NP cap coNP - Vikraman Arvind; Jacobo Torán (Electron. Colloquium Comput. Complex., 2004)

Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. - Vikraman Arvind; Piyush P. Kurur; T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2004)

Non-stabilizer quantum codes from Abelian subgroups of the error group. - Vikraman Arvind; Piyush P. Kurur; K. R. Parthasarathy (Quantum Inf. Comput., 2004)

The Complexity of Solving Linear Equations over a Finite Ring. - Vikraman Arvind; T. C. Vijayaraghavan (STACS, 2005)

Isomorphism Testing: Perspective and Open Problems. - Vikraman Arvind; Jacobo Torán (Bull. EATCS, 2005)

The Complexity of Black-Box Ring Problems. - Vikraman Arvind; Bireswar Das; Partha Mukhopadhyay (COCOON, 2006)

The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. - Vikraman Arvind; Jacobo Torán (ISAAC, 2006)

A Polynomial Time Nilpotence Test for Galois Groups and Related Results. - Vikraman Arvind; Piyush P. Kurur (MFCS, 2006)

On Hypergraph and Graph Isomorphism with Bounded Color Classes. - Vikraman Arvind; Johannes Köbler (STACS, 2006)

Parameterized Learnability of k -Juntas and Related Problems. - Vikraman Arvind; Johannes Köbler; Wolfgang Lindner 002 (ALT, 2007)

The Space Complexity of k -Tree Isomorphism. - Vikraman Arvind; Bireswar Das; Johannes Köbler (ISAAC, 2007)

The Monomial Ideal Membership Problem and Polynomial Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay (ISAAC, 2007)

The Ideal Membership Problem and Polynomial Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2007)

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. - Vikraman Arvind; Partha Mukhopadhyay (APPROX-RANDOM, 2008)

A Logspace Algorithm for Partial 2-Tree Canonization. - Vikraman Arvind; Bireswar Das; Johannes Köbler (CSR, 2008)

Some Sieving Algorithms for Lattice Problems. - Vikraman Arvind; Pushkar S. Joglekar (FSTTCS, 2008)

Algorithmic Problems for Metrics on Permutation Groups. - Vikraman Arvind; Pushkar S. Joglekar (SOFSEM, 2008)

Lattice Problems, Gauge Functions and Parameterized Algorithms - Vikraman Arvind; Pushkar S. Joglekar (CoRR, 2008)

Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. - Vikraman Arvind; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2008)

Quantum Query Complexity of Multilinear Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2008)

The Orbit problem is in the GapL Hierarchy. - Vikraman Arvind; T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2008)

SZK Proofs for Black-Box Group Problems. - Vikraman Arvind; Bireswar Das (Theory Comput. Syst., 2008)

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. - Vikraman Arvind; Christine T. Cheng; Nikhil R. Devanur (SIAM J. Discret. Math., 2008)

Arithmetic Circuits and the Hadamard Product of Polynomials. - Vikraman Arvind; Pushkar S. Joglekar; Srikanth Srinivasan 001 (FSTTCS, 2009)

Arithmetic Circuits, Monomial Algebras and Finite Automata. - Vikraman Arvind; Pushkar S. Joglekar (MFCS, 2009)

The Remote Point Problem, Small Bias Space, and Expanding Generator Sets - Vikraman Arvind; Srikanth Srinivasan 001 (CoRR, 2009)

Colored Hypergraph Isomorphism is Fixed Parameter Tractable. - Vikraman Arvind; Bireswar Das; Johannes Köbler; Seinosuke Toda (Electron. Colloquium Comput. Complex., 2009)

Arithmetic Circuit Size, Identity Testing, and Finite Automata. - Vikraman Arvind; Pushkar S. Joglekar (Electron. Colloquium Comput. Complex., 2009)

On Lower Bounds for Constant Width Arithmetic Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2009)

The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. - Vikraman Arvind; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2009)

Circuit Lower Bounds, Help Functions, and the Remote Point Problem. - Vikraman Arvind; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2009)

Parameterized learnability of juntas. - Vikraman Arvind; Johannes Köbler; Wolfgang Lindner 002 (Theor. Comput. Sci., 2009)

New Results on Noncommutative and Commutative Polynomial Identity Testing. - Vikraman Arvind; Partha Mukhopadhyay; Srikanth Srinivasan 001 (Comput. Complex., 2010)

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes. - Vikraman Arvind; T. C. Vijayaraghavan (Comput. Complex., 2010)

Uniform Derandomization from Pathetic Lower Bounds. - Eric Allender; Vikraman Arvind; Fengming Wang (Electron. Colloquium Comput. Complex., 2010)

Isomorphism and canonization of tournaments and hypertournaments. - Vikraman Arvind; Bireswar Das; Partha Mukhopadhyay (J. Comput. Syst. Sci., 2010)

Canonizing Hypergraphs under Abelian Group Action. - Vikraman Arvind; Johannes Köbler (COCOON, 2011)

Noncommutative Arithmetic Circuits meet Finite Automata. - Vikraman Arvind (Bull. EATCS, 2011)

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar (Electron. Colloquium Comput. Complex., 2011)

Expanding Generator Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (Electron. Colloquium Comput. Complex., 2011)

Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits. - Vikraman Arvind; Yadu Vasudev (Electron. Colloquium Comput. Complex., 2011)

Solvable Group Isomorphism Is (Almost) in NP ∩ coNP. - Vikraman Arvind; Jacobo Torán (ACM Trans. Comput. Theory, 2011)

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (MFCS, 2012)

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (CoRR, 2012)

Approximate Graph Isomorphism. - Vikraman Arvind; Sebastian Kuhnert; Johannes Köbler; Yadu Vasudev (Electron. Colloquium Comput. Complex., 2012)

The isomorphism problem for k-trees is complete for logspace. - Vikraman Arvind; Bireswar Das; Johannes Köbler; Sebastian Kuhnert (Inf. Comput., 2012)

Testing nilpotence of galois groups in polynomial time. - Vikraman Arvind; Piyush P. Kurur (ACM Trans. Algorithms, 2012)

The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. - Vikraman Arvind (IPEC, 2013)

The Parallel Complexity of Graph Canonization Under Abelian Group Action. - Vikraman Arvind; Johannes Köbler (Algorithmica, 2013)

The Parameterized Complexity of some Permutation Group Problems - Vikraman Arvind (CoRR, 2013)

The Alon-Roichman Theorem. - Vikraman Arvind (Bull. EATCS, 2013)

Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series. - Eric Allender; Vikraman Arvind; Meena Mahajan (Theory Comput. Syst., 2013)

The Complexity of Bounded Register and Skew Arithmetic Computation. - Vikraman Arvind; S. Raja 001 (COCOON, 2014)

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. - Vikraman Arvind; S. Raja 001; A. V. Sreejith (CSR, 2014)

Solving Linear Equations Parameterized by Hamming Weight. - Vikraman Arvind; Sebastian Kuhnert; Johannes Köbler; Jacobo Torán (Electron. Colloquium Comput. Complex., 2014)

The Complexity of Two Register and Skew Arithmetic Computation. - Vikraman Arvind; S. Raja 001 (Electron. Colloquium Comput. Complex., 2014)

The Complexity of Geometric Graph Isomorphism. - Vikraman Arvind; Gaurav Rattan (Electron. Colloquium Comput. Complex., 2014)

Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. - Vikraman Arvind; Gaurav Rattan (Electron. Colloquium Comput. Complex., 2014)

On the Power of Color Refinement. - Vikraman Arvind; Johannes Köbler; Gaurav Rattan; Oleg Verbitsky 001 (FCT, 2015)

On Tinhofer's Linear Programming Approach to Isomorphism Testing. - Vikraman Arvind; Johannes Köbler; Gaurav Rattan; Oleg Verbitsky 001 (MFCS (2), 2015)

Robust Oracle Machines revisited. - Vikraman Arvind (Bull. EATCS, 2015)

On the Complexity of Noncommutative Polynomial Factorization. - Vikraman Arvind; Pushkar S. Joglekar; Gaurav Rattan (Electron. Colloquium Comput. Complex., 2015)

Noncommutative Valiant's Classes: Structure and Complete Problems. - Vikraman Arvind; Pushkar S. Joglekar; Raja S 001 (Electron. Colloquium Comput. Complex., 2015)

On the isomorphism problem for decision trees and decision lists. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan; Yadu Vasudev (Theor. Comput. Sci., 2015)

The Parameterized Complexity of Geometric Graph Isomorphism. - Vikraman Arvind; Gaurav Rattan (Algorithmica, 2016)

Some Lower Bound Results for Set-Multilinear Arithmetic Computations. - Vikraman Arvind; S. Raja 001 (Chic. J. Theor. Comput. Sci., 2016)

The Weisfeiler-Lehman Procedure. - Vikraman Arvind (Bull. EATCS, 2016)

Identity Testing for +-Regular Noncommutative Arithmetic Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2016)

Parameterized Complexity of Small Weight Automorphisms. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (Electron. Colloquium Comput. Complex., 2016)

Randomized Polynomial Time Identity Testing for Noncommutative Circuits. - Vikraman Arvind; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2016)

Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (IPEC, 2017)

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; S. Raja 001 (MFCS, 2017)

Graph Isomorphism, Color Refinement, and Compactness. - Vikraman Arvind; Johannes Köbler; Gaurav Rattan; Oleg Verbitsky 001 (Comput. Complex., 2017)

A Quest for Structure in Complexity. - Vikraman Arvind; Meena Mahajan (Bull. EATCS, 2017)

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2017)

Finding fixed point free elements and small bases in permutation groups. - Vikraman Arvind (Theor. Comput. Sci., 2017)

On the hardness of the noncommutative determinant. - Vikraman Arvind; Srikanth Srinivasan 001 (Comput. Complex., 2018)

A Note on Polynomial Identity Testing for Depth-3 Circuits. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2018)

Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2018)

Expanding Generating Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (SIAM J. Discret. Math., 2018)

Efficient Black-Box Identity Testing for Free Group Algebras. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (APPROX-RANDOM, 2019)

Efficient Black-Box Identity Testing over Free Group Algebra. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2019)

Efficient Black-Box Identity Testing for Free Group Algebra. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2019)

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. - Vikraman Arvind; Pushkar S. Joglekar; Partha Mukhopadhyay; S. Raja 001 (Theory Comput., 2019)

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (MFCS, 2020)

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Chic. J. Theor. Comput. Sci., 2020)

Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2020)

On Weisfeiler-Leman invariance: Subgraph counts and related graph properties. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (J. Comput. Syst. Sci., 2020)

Equivalence Testing of Weighted Automata over Partially Commutative Monoids. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (MFCS, 2021)

Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (Algorithmica, 2021)

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. - Vikraman Arvind; Roman Nedela; Ilia Ponomarenko; Peter Zeman 001 (CoRR, 2021)

CNF Satisfiability in a Subspace and Related Problems. - Vikraman Arvind; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2021)

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). - Vikraman Arvind; Roman Nedela; Ilia Ponomarenko; Peter Zeman 001 (WG, 2022)

Fast Exact Algorithms Using Hadamard Product of Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Algorithmica, 2022)

Theory research in India: 2019-2022. - C. Aiswarya; Vikraman Arvind; Saket Saurabh 001 (Commun. ACM, 2022)

Recognizing the Commuting Graph of a Finite Group. - Vikraman Arvind; Peter J. Cameron (CoRR, 2022)

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2022)

On Efficient Noncommutative Polynomial Factorization via Higman Linearization. - Vikraman Arvind; Pushkar S. Joglekar (Electron. Colloquium Comput. Complex., 2022)

Matrix Polynomial Factorization via Higman Linearization. - Vikraman Arvind; Pushkar S. Joglekar (Electron. Colloquium Comput. Complex., 2022)

On the Weisfeiler-Leman dimension of fractional packing. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (Inf. Comput., 2022)

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Theory Comput. Syst., 2022)

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan (ACM Trans. Comput. Theory, 2022)

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. - Vikraman Arvind; Abhranil Chatterjee 001; Utsab Ghosal; Partha Mukhopadhyay; C. Ramya (ITCS, 2023)

On a Hierarchy of Spectral Isomorphism Invariants. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (CoRR, 2023)

On Lifting Lower Bounds for Noncommutative Circuits using Automata. - Vikraman Arvind; Abhranil Chatterjee 001 (Electron. Colloquium Comput. Complex., 2023)

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2023)

Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. - Vikraman Arvind; Pushkar S. Joglekar (Electron. Colloquium Comput. Complex., 2023)

The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. - Vikraman Arvind; Samir Datta; Asif Khan 009; Shivdutt Sharma; Yadu Vasudev; Shankar Ram Vasudevan (FSTTCS, 2024)

On a Hierarchy of Spectral Invariants for Graphs. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (STACS, 2024)

Trading Determinism for Noncommutativity in Edmonds' Problem. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2024)

A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. - Vikraman Arvind; Pushkar S. Joglekar (Electron. Colloquium Comput. Complex., 2024)

Revisiting Tree canonization using polynomials. - Vikraman Arvind; Samir Datta; Salman Faris; Asif Khan 009 (SOSA, 2025)

Isomorphism testing of k-spanning tournaments is fixed parameter tractable. - Vikraman Arvind; Ilia Ponomarenko; Grigory Ryabov (Art Discret. Appl. Math., 2025)

On the expressibility of the reconstructional color refinement. - Vikraman Arvind; Johannes Köbler; Oleg Verbitsky 001 (Theor. Comput. Sci., 2025)