| 2024 | FOCS | Trading Determinism for Noncommutativity in Edmonds' Problem. | Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay |
| 2024 | ICALP | A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. | Vikraman Arvind, Pushkar S. Joglekar |
| 2024 | STOC | Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. | Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay |
| 2024 | STACS | On a Hierarchy of Spectral Invariants for Graphs. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2023 | MFCS | Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. | Vikraman Arvind, Pushkar S. Joglekar |
| 2022 | WG | Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). | Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman |
| 2021 | MFCS | Equivalence Testing of Weighted Automata over Partially Commutative Monoids. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2020 | LATA | On the Weisfeiler-Leman Dimension of Fractional Packing. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2020 | MFCS | A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2019 | FCT | On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2019 | ISAAC | On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2017 | MFCS | Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. | Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja |
| 2017 | STOC | Randomized polynomial time identity testing for noncommutative circuits. | Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja |
| 2017 | STACS | Parameterized Complexity of Small Weight Automorphisms. | Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Jacobo Torn |
| 2016 | MFCS | The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Sebastian Kuhnert, Gaurav Rattan |
| 2015 | FCT | On the Power of Color Refinement. | Vikraman Arvind, Johannes Kbler, Gaurav Rattan, Oleg Verbitsky |
| 2015 | MFCS | On Tinhofer's Linear Programming Approach to Isomorphism Testing. | Vikraman Arvind, Johannes Kbler, Gaurav Rattan, Oleg Verbitsky |
| 2015 | MFCS | On the Complexity of Noncommutative Polynomial Factorization. | Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar |
| 2014 | COCOON | The Complexity of Bounded Register and Skew Arithmetic Computation. | Vikraman Arvind, S. Raja |
| 2014 | CSR | On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. | Vikraman Arvind, S. Raja, A. V. Sreejith |
| 2013 | FCT | On the Isomorphism Problem for Decision Trees and Decision Lists. | Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev |
| 2012 | LATA | Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. | Vikraman Arvind, Yadu Vasudev |
| 2012 | LATIN | Erdős-Rnyi Sequences and Deterministic Construction of Expanding Cayley Graphs. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
| 2012 | MFCS | Approximate Graph Isomorphism. | Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Yadu Vasudev |
| 2012 | MFCS | Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
| 2011 | COCOON | Canonizing Hypergraphs under Abelian Group Action. | Vikraman Arvind, Johannes Kbler |
| 2010 | STOC | On the hardness of the noncommutative determinant. | Vikraman Arvind, Srikanth Srinivasan |
| 2010 | STACS | The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. | Vikraman Arvind, Srikanth Srinivasan |
| 2009 | ISAAC | On Lower Bounds for Constant Width Arithmetic Circuits. | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
| 2009 | MFCS | Arithmetic Circuits, Monomial Algebras and Finite Automata. | Vikraman Arvind, Pushkar S. Joglekar |
| 2009 | STACS | Quantum Query Complexity of Multilinear Identity Testing. | Vikraman Arvind, Partha Mukhopadhyay |
| 2008 | COCOON | The Orbit Problem Is in the GapL Hierarchy. | Vikraman Arvind, T. C. Vijayaraghavan |
| 2008 | CSR | A Logspace Algorithm for Partial 2-Tree Canonization. | Vikraman Arvind, Bireswar Das, Johannes Kbler |
| 2008 | SOFSEM | Algorithmic Problems for Metrics on Permutation Groups. | Vikraman Arvind, Pushkar S. Joglekar |
| 2007 | ALT | Parameterized Learnability of | Vikraman Arvind, Johannes Kbler, Wolfgang Lindner |
| 2007 | ISAAC | The Space Complexity of | Vikraman Arvind, Bireswar Das, Johannes Kbler |
| 2007 | ISAAC | The Monomial Ideal Membership Problem and Polynomial Identity Testing. | Vikraman Arvind, Partha Mukhopadhyay |
| 2006 | COCOON | The Complexity of Black-Box Ring Problems. | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
| 2006 | CSR | SZK Proofs for Black-Box Group Problems. | Vikraman Arvind, Bireswar Das |
| 2006 | ISAAC | On Isomorphism and Canonization of Tournaments and Hypertournaments. | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
| 2006 | ISAAC | The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. | Vikraman Arvind, Jacobo Torn |
| 2006 | MFCS | A Polynomial Time Nilpotence Test for Galois Groups and Related Results. | Vikraman Arvind, Piyush P. Kurur |
| 2006 | STACS | On Hypergraph and Graph Isomorphism with Bounded Color Classes. | Vikraman Arvind, Johannes Kbler |
| 2005 | STACS | The Complexity of Solving Linear Equations over a Finite Ring. | Vikraman Arvind, T. C. Vijayaraghavan |
| 2003 | ISAAC | Upper Bounds on the Complexity of Some Galois Theory Problems. | Vikraman Arvind, Piyush P. Kurur |
| 2003 | ISAAC | The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. | Vikraman Arvind, Rainer Schuler |
| 2002 | FOCS | Graph Isomorphism is in SPP. | Vikraman Arvind, Piyush P. Kurur |
| 2002 | ISAAC | Approximation Algorithms for Some Parameterized Counting Problems. | Vikraman Arvind, Venkatesh Raman |
| 2000 | STACS | Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. | Vikraman Arvind, Johannes Kbler |
| 2000 | STACS | Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. | Vikraman Arvind, Johannes Kbler, Martin Mundhenk, Jacobo Torn |
| 1999 | ISAAC | The Query Complexity of Program Checking by Constant-Depth Circuits. | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
| 1999 | STACS | Sparse Sets, Approximable Sets, and Parallel Queries to NP. | Vikraman Arvind, Jacobo Torn |
| 1998 | STACS | The Complexity of Modular Graph Automorphism. | Vikraman Arvind, Richard Beigel, Antoni Lozano |
| 1997 | ALT | Exact Learning via Teaching Assistants (Extended Abstract). | Vikraman Arvind, N. V. Vinodchandran |
| 1996 | ALT | The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). | Vikraman Arvind, N. V. Vinodchandran |
| 1996 | COCOON | A Note on the Self-Witnessing Property of Computational Problems. | Vikraman Arvind |
| 1996 | STACS | Solvable Black-Box Group Problems Are Low for PP. | Vikraman Arvind, N. V. Vinodchandran |
| 1994 | ISAAC | On Helping and Interactive Proof Systems. | Vikraman Arvind, Johannes Kbler, Rainer Schuler |
| 1993 | MFCS | Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. | Vikraman Arvind, Johannes Kbler, Martin Mundhenk |
| 1992 | ICALP | Reductions to Sets of Low Information Content. | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Kbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schning, Riccardo Silvestri, Thomas Thierauf |
| 1992 | ISAAC | Lowness and the Complexity of Sparse and Tally Descriptions. | Vikraman Arvind, Johannes Kbler, Martin Mundhenk |
| 1991 | ICTAI | A heuristic search strategy for optimization of trade-off cost measures. | Rakesh Kumar Singh, Shashi Kumar, Vikraman Arvind |
| 1987 | STACS | Expressibility of First Order Logic with a Nondeterministic Inductive Operator. | Vikraman Arvind, Somenath Biswas |