Vikraman Arvind

ScholarGPS® ID: 49122893894091

Field

Physical Sciences and Mathematics

Discipline

Mathematics

Top Specialties

Metrics Summary

Publication Count

126

Predicted Citations

1,227

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time (conference) Arvind, V. \| Chatterjee, Abhranil \| Mukhopadhyay, Partha STOC '24: 56th Annual ACM Symposium on Theory of Computing (2024) Vancouver BC Canada 10.1145/3618260.3649693 Cite \| Source
On the Weisfeiler-Leman dimension of fractional packing (journal article) Arvind, V. \| Fuhlbrück, Frank \| Köbler, Johannes \| Verbitsky, Oleg Information and Computation, volume 288 (2022). 10.1016/j.ic.2021.104803 Cited by (3) \| Cite \| Source
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs (journal article) Arvind, Vikraman \| Fuhlbrueck, Frank \| Koebler, Johannes \| Kuhnert, Sebastian \| Rattan, Gaurav ACM Transactions on Computation Theory, volume 14, issue 2, pages 1-26 (2022). 10.1145/3558077 Cite \| Source
Fast Exact Algorithms Using Hadamard Product of Polynomials (journal article) Arvind, V. \| Chatterjee, Abhranil \| Datta, Rajit \| Mukhopadhyay, Partha Algorithmica, volume 84, issue 2, pages 436-463 (2022). 10.1007/s00453-021-00900-0 Cited by (1) \| Cite \| Source
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators (journal article) Arvind, V. \| Chatterjee, Abhranil \| Datta, Rajit \| Mukhopadhyay, Partha Theory of Computing Systems, volume 66, issue 1, pages 56-88 (2022). 10.1007/s00224-021-10053-w Cite \| Source
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract) (book chapter) In Graph-Theoretic Concepts in Computer Science Arvind, Vikraman \| Nedela, Roman \| Ponomarenko, Ilia \| Zeman, Peter Springer International Publishing (2022) 10.1007/978-3-031-15914-5_3 Cited by (6) \| Cite \| Source
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms (journal article) Arvind, V. \| Köbler, Johannes \| Kuhnert, Sebastian \| Torán, Jacobo Algorithmica, volume 83, issue 12, pages 3567-3601 (2021). 10.1007/s00453-021-00867-y Cite \| Source
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties (journal article) Arvind, V. \| Fuhlbrück, Frank \| Köbler, Johannes \| Verbitsky, Oleg Journal of Computer and System Sciences, volume 113 (2020). 10.1016/j.jcss.2020.04.003 Cited by (15) \| Cite \| Source
On the Weisfeiler-Leman Dimension of Fractional Packing (book chapter) In Language and Automata Theory and Applications Arvind, Vikraman \| Fuhlbrück, Frank \| Köbler, Johannes \| Verbitsky, Oleg Springer International Publishing (2020) 10.1007/978-3-030-40608-0_25 Cited by (1) \| Cite \| Source
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties (book chapter) In Fundamentals of Computation Theory Arvind, Vikraman \| Fuhlbrück, Frank \| Köbler, Johannes \| Verbitsky, Oleg Springer International Publishing (2019) 10.1007/978-3-030-25027-0_8 Cited by (4) \| Cite \| Source
On the complexity of noncommutative polynomial factorization (journal article) Arvind, V. \| Joglekar, Pushkar \| Rattan, Gaurav Information and Computation, volume 262 (2018). 10.1016/j.ic.2018.05.009 Cite \| Source \| Open Access
On the hardness of the noncommutative determinant (journal article) Arvind, V. \| Srinivasan, Srikanth computational complexity, volume 27, issue 1, pages 1-29 (2018). 10.1007/s00037-016-0148-5 Cited by (1) \| Cite \| Source
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (conference) Arvind, Vikraman \| Köbler, Johannes \| Kuhnert, Sebastian \| Torán, Jacobo International Symposium on Parameterized and Exact Computation (2018) 10.4230/LIPIcs.IPEC.2017.2 Cite \| Source
Expanding Generating Sets for Solvable Permutation Groups (journal article) Arvind, V. \| Mukhopadhyay, Partha \| Nimbhorkar, Prajakta \| Vasudev, Yadu SIAM Journal on Discrete Mathematics, volume 32, issue 3, pages 1721-1740 (2018). 10.1137/17M1148979 Cite \| Source
Graph Isomorphism, Color Refinement, and Compactness (journal article) Arvind, V. \| Köbler, Johannes \| Rattan, Gaurav \| Verbitsky, Oleg computational complexity, volume 26, issue 3, pages 627-685 (2017). 10.1007/s00037-016-0147-6 Cited by (14) \| Cite \| Source \| Open Access
Finding fixed point free elements and small bases in permutation groups (journal article) Arvind, V. Theoretical Computer Science, volume 687 (2017). 10.1016/j.tcs.2017.05.007 Cite \| Source
Randomized polynomial time identity testing for noncommutative circuits (conference) Arvind, V. \| Joglekar, Pushkar S \| Mukhopadhyay, Partha \| Raja, S. STOC '17: Symposium on Theory of Computing (2017) Montreal Canada 10.1145/3055399.3055442 Cite \| Source \| Open Access
Noncommutative Valiant's Classes (journal article) Arvind, V. \| Joglekar, P. S. \| Raja, S. ACM Transactions on Computation Theory, volume 9, issue 1, pages 1-29 (2017). 10.1145/2956230 Cited by (1) \| Cite \| Source
Parameterized Complexity of Small Weight Automorphisms. (conference) Arvind, Vikraman \| Köbler, Johannes \| Kuhnert, Sebastian \| Torán, Jacobo Symposium on Theoretical Aspects of Computer Science (2017) Hannover, Germany 10.4230/LIPIcs.STACS.2017.7 Cited by (1) \| Cite \| Source
Solving Linear Equations Parameterized by Hamming Weight (journal article) Arvind, V. \| Köbler, Johannes \| Kuhnert, Sebastian \| Torán, Jacobo Algorithmica, volume 75, issue 2, pages 322-338 (2016). 10.1007/s00453-015-0098-3 Cited by (5) \| Cite \| Source