default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRanveer Singh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Ranveer Singh
, Hitesh Wankhede:
A note on graphs with purely imaginary per-spectrum. Appl. Math. Comput. 475: 128754 (2024)- 2022
- [j6]Ankit Mishra, Ranveer Singh, Sarika Jalan:
On the second largest eigenvalue of networks. Appl. Netw. Sci. 7(1): 47 (2022) - [j5]Ranveer Singh, Naomi Shaked-Monderer, Avi Berman:
A linear time algorithm for the nullity of vertex-weighted block graphs. Discret. Appl. Math. 319: 61-70 (2022) - [j4]Pradumn Kumar Pandey, Ranveer Singh, A. K. Lal:
SRF: Random Expanders for Designing Scalable Robust and Fast Communication Networks. IEEE Trans. Circuits Syst. II Express Briefs 69(12): 4819-4823 (2022) - 2021
- [j3]Pradumn Kumar Pandey, Ranveer Singh:
Fast Average-Consensus on Networks Using Heterogeneous Diffusion. IEEE Trans. Circuits Syst. II Express Briefs 68(11): 3421-3425 (2021) - 2020
- [j2]Ranveer Singh:
Parameterized complexity of determinant and permanent. Theor. Comput. Sci. 845: 50-58 (2020) - 2018
- [j1]Anoopa Joshi, Ranveer Singh, Atul Kumar:
Concurrence and three-tangle of the graph. Quantum Inf. Process. 17(12): 327 (2018)
Conference and Workshop Papers
- 2024
- [c2]Harshdeep Singh Pruthi, Ranveer Singh, Rahul Kala, Gora Chand Nandi:
Pedestrian Trajectory Prediction Focused on Socially Interactive Scenarios. SPCOM 2024: 1-5 - 2019
- [c1]Ranveer Singh, Naomi Shaked-Monderer, Avi Berman:
Linear Time Algorithm to Check the Singularity of Block Graphs. CALDAM 2019: 77-90
Informal and Other Publications
- 2022
- [i9]Hitesh Wankhede, Ranveer Singh:
A note on graphs with purely imaginary per-spectrum. CoRR abs/2211.13072 (2022) - 2019
- [i8]Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer, Abraham Berman:
Nonsingular (Vertex-Weighted) Block Graphs. CoRR abs/1905.01921 (2019) - 2018
- [i7]Ranveer Singh, Swarup Kumar Panda, Naomi Shaked-Monderer, Abraham Berman:
Rank of weighted digraphs with blocks. CoRR abs/1807.04208 (2018) - [i6]Ranveer Singh, Naomi Shaked-Monderer, Avi Berman:
Linear time algorithm to check the singularity of block graphs. CoRR abs/1808.03411 (2018) - [i5]Ranveer Singh, Vivek Vijay, Ravindra B. Bapat:
Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent. CoRR abs/1810.04670 (2018) - 2017
- [i4]Ranveer Singh, Ravindra B. Bapat:
On a Characteristic and Permanent Polynomials of Matrix. CoRR abs/1701.04420 (2017) - [i3]Ranveer Singh, Ravindra B. Bapat:
Eigenvalues of some signed graphs with negative cliques. CoRR abs/1702.06322 (2017) - [i2]Ranveer Singh, Ravindra B. Bapat:
$\mathcal{B}$-partitions, application to determinant and permanent of graphs. CoRR abs/1705.02517 (2017) - 2015
- [i1]Ranveer Singh, Bidyut Kr. Patra, Bibhas Adhikari:
A Complex Network Approach for Collaborative Recommendation. CoRR abs/1510.00585 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
