• Ranveer
  • Publications
  • Talks
  • Math-pieces
  • Bio

    • Location
    • Email
    • Github
    • Mathoverflow
    • Instagram

    • 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)
    • 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)
    • 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.

    • 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.
    Sitemap
    • Follow:
    • GitHub
    • Feed
    © 2025 Ranveer. Powered by Jekyll & AcademicPages, a fork of Minimal Mistakes.