No AI tool was used to prove any of the results in the following papers.
- Priyanshu Pant, Ranveer Singh “Pfaffian Recognition is in coRP” 2026
- Priyanshu Pant, Ranveer Singh “An Odd Pfaffian Number” 2026
- Priyanshu Pant, Ranveer Singh “Structural Classes for Chollet’s Permanent Conjecture” 2026
- Priyanshu Pant, Ranveer Singh “Exponential Lower Bounds for the Pfaffian Number of Graphs ” 2026
- Priyanshu Pant, Ranveer Singh “Permanental Energy of Graphs” COCOON, 2026
- Yiyang Lu, Hareshkumar Jadav, Mohammad Pedramfar, Ranveer Singh, Vaneet Aggarwal “Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets” ICML, 2026
- Haresh Kumar Jadav, Ranveer Singh, Vaneet Aggarwal “Stronger Approximation Guarantees for Non-Monotone 𝛾-Weakly DR-Submodular Maximization” AAMAS, 2026
- Priyanshu Pant, Surabhi Chakraborty, Ranveer Singh “A Permanental analog of Rank-Nullity Theorem for Symmetric Matrices” STACS, 2026
- Hareshkumar Jadav, Mihir Patel, Samip Shah, Ranveer Singh and Harsh Talati “Generating Constrained Lattice Paths in a Grid related to counting cycles” ICTCS, 2025
- Surabhi Chakrabartty and Ranveer Singh “Permanent as determinants for bipartite graphs” ISSAC, (Short Communication) 2025
- Abhinav Bitragunta, Hareshkumar Jadav, Ranveer Singh “Cartesian Prime Graphs and Cospectral Families” ISSAC, (Short Communication) 2025
- Hareshkumar Jadav, Sreekara Madyastha, Rahul Raut, Ranveer Singh “Strengthening Wilf’s lower bound on clique number )” ISSAC, (Short Communication) 2025
- Aman Singh, Shahid Shafi Dar, Ranveer Singh, Nagendra Kumar “A Hybrid Similarity-Aware Graph Neural Network with Transformer for Node Classification” Expert Systems with Applications (2025)
- Surabhi Chakrabartty and Ranveer Singh “Permanent of bipartite graphs in terms of determinants” IWOCA, 2025
- Hareshkumar, Sreekara Madyastha, Rahul Raut, Ranveer Singh. “Generalizing Wilf’s inequality for strongly regular graphs” MatTriad’25 (2025)
- Hareshkumar Jadav, Ashita Gupta and Ranveer Singh “A construction of random bigraphs and their application to error correction codes” J. Stat. Mech. 2025
- Ravindra B. Bapat, Ranveer Singh, and Hitesh Wankhede. “Computing the permanental polynomial of 4k-intercyclic bipartite graphs” American Journal of Combinatorics (2024)
Hitesh Wankhede, Ranveer Singh. “A note on graphs with purely imaginary per-spectrum” Applied Mathematics and Computation (2024)
Hitesh Wankhede, Ranveer Singh, RB Bapat. “Permanent of 4k-intercyclic graphs” EUROCOMB (2023)
Pradumn Kumar Pandey, Ranveer Singh, AK Lal. “SRF: Random Expanders for Designing Scalable Robust and Fast Communication Networks” IEEE Transactions on Circuits and Systems–II: Express Briefs (2022)
Ranveer Singh, Naomi Shaked-Monderer, and Avi Berman. “A linear time algorithm for the nullity of vertex-weighted block graphs.” Discrete Applied Mathematics 2022.
Ankit Mishra, Ranveer Singh and Sarika Jalan. “On the second largest eigenvalue of networks.” Applied Network Science 2022.
Pradumn Kumar Pandey, Ranveer Singh. “Fast Average-consensus on Networks using Heterogeneous Diffusion.” IEEE Transactions on Circuits and Systems–II: Express Briefs (2021)
Ranveer Singh. “Permanent, determinant, and rank of bi-block graphs.” Aequationes mathematicae 94, no. 1 (2020): 1-12.
Ranveer Singh. “Parameterized complexity of determinant and permanent.” Theoretical Computer Science 845 (2020) 50-58
- Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer, and Abraham Berman. “Nonsingular (vertex-weighted) block graphs.” Linear Algebra and its Applications 602 (2020): 138-156.
- Berman, Abraham, Naomi Shaked-Monderer, Ranveer Singh, and Xiao-Dong Zhang. “Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum.”. Linear Algebra and its Applications 564 (2019): 58-71.
Ranveer Singh. “On eigenvector structure of weakly balanced networks.” Physica A: Statistical Mechanics and its Applications 527 (2019): 121093.
Ranveer Singh, Naomi Shaked-Monderer, and Avi Berman. “Linear time algorithm to check the singularity of block graphs.” In Conference on Algorithms and Discrete Applied Mathematics, pp. 77-90. Springer, Cham, 2019.
Singh, Ranveer, and Ravindra B. Bapat. “B-Partitions, determinant and permanent of graphs.” Transactions on Combinatorics 7, no. 3 (2018): 37-54.
Joshi, Anoopa, Ranveer Singh, and Atul Kumar. “Concurrence and three-tangle of the graph.” Quantum Information Processing 17, no. 12 (2018): 327.
Ranveer Singh, and Ravindra B. Bapat. “On characteristic and permanent polynomials of a matrix.” Special Matrices 5, no. 1 (2017): 97-112.
- Ranveer Singh, and Bibhas Adhikari. “Measuring the balance of signed networks and its application to sign prediction.” Journal of Statistical Mechanics: Theory and Experiment 2017, no. 6 (2017): 063302.