Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 74 matches
- 2018
- Mahadevan Vasudevan, Narsingh Deo:
Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - 2017
- Sunny Raj, Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Damla Turgut, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Jeff Chang, Sumit Kumar Jha:
A theorem proving approach for automatically synthesizing visualizations of flow cytometry data. BMC Bioinform. 18(8): 245:1-245:11 (2017) - 2016
- Antoniya Petkova, Charles E. Hughes, Narsingh Deo, Martin Dimitrov:
Accelerating the distributed simulations of agent-based models using community detection. RIVF 2016: 25-30 - 2015
- Faraz Hussain, Zubir Husein, Neslisah Torosdagli, Narsingh Deo, Sumanta N. Pattanaik, Chung-Che Chang, Sumit Kumar Jha:
SANJAY: Automatically synthesizing visualizations of flow cytometry data using decision procedures. ICCABS 2015: 1 - 2014
- Mahadevan Vasudevan, Narsingh Deo:
Community Identification in Dynamic and Complex Networks. Encyclopedia of Social Network Analysis and Mining 2014: 232-238 - 2012
- Mahadevan Vasudevan, Narsingh Deo:
Efficient community identification in complex networks. Soc. Netw. Anal. Min. 2(4): 345-359 (2012) - 2008
- Sanjeeb Nanda, Narsingh Deo:
The Derivation and Use of a Scalable Model for Network Attack Identification and Path Prediction. J. Networks 3(4): 64-71 (2008) - Aurel Cami, Narsingh Deo:
Techniques for analyzing dynamic random graph models of web-like networks: An overview. Networks 51(4): 211-255 (2008) - 2007
- Narsingh Deo, Aurel Cami:
Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102(4): 156-162 (2007) - Paulius Micikevicius, Narsingh Deo:
Exploring Topological Properties of NMR Graphs. BIBE 2007: 1304-1307 - 2006
- Hemant Balakrishnan, Narsingh Deo:
Discovering communities in complex networks. ACM Southeast Regional Conference 2006: 280-285 - Hemant Balakrishnan, Narsingh Deo:
Detecting communities using bibliographic metrics. GrC 2006: 293-298 - Narsingh Deo, Aurel Cami:
Mining parameters that characterize the communities in web-like networks. GrC 2006: 188-193 - Aurel Cami, Narsingh Deo:
Evaluation of a Graph-based Topical Crawler. International Conference on Internet Computing 2006: 393-399 - 2005
- Paulius Micikevicius, Narsingh Deo:
Cluster Computing for Determining Three-Dimensional Protein Structure. J. Supercomput. 34(3): 243-271 (2005) - Narsingh Deo, Hemant Balakrishnan:
Bibliometric approach to community discovery. ACM Southeast Regional Conference (2) 2005: 41-42 - Narsingh Deo, Aurel Cami:
A birth-death dynamic model of scale-free networks. ACM Southeast Regional Conference (2) 2005: 26-27 - Narsingh Deo, Sanjeeb Nanda:
A Graph Theoretic Algorithm for Placing Data and Parity to Tolerate Two Disk Failures in Disk Array Systems. IV 2005: 542-549 - 2004
- Bruce E. Litow, Narsingh Deo:
Graph compression and the zeros of polynomials. Inf. Process. Lett. 92(1): 39-44 (2004) - Narsingh Deo:
Graphs. Handbook of Data Structures and Applications 2004 - 2002
- Ayman M. Abdalla, Narsingh Deo:
Random-tree Diameter and the Diameter-constrained MST. Int. J. Comput. Math. 79(6): 651-663 (2002) - Narsingh Deo, Paulius Micikevicius:
Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem. IWDC 2002: 55-66 - 2001
- Narsingh Deo, Pankaj Gupta:
Graph-Theoretic Web Algorithms: An Overview. IICS 2001: 91-102 - 2000
- Bruce E. Litow, Narsingh Deo:
Forbidden pairs combinatorics. Australas. J Comb. 22: 91-100 (2000) - Narsingh Deo, Ayman M. Abdalla:
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. CIAC 2000: 17-31 - 1999
- Jürg Nievergelt, Narsingh Deo, Ambros Marzetta:
Memory-Efficient Enumeration of Constrained Spanning Trees. Inf. Process. Lett. 72(1-2): 47-53 (1999) - Kumar Rajan, Narsingh Deo:
A Parallel Algorithm for Bound-Smoothing. IPPS/SPDP 1999: 645-652 - Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang:
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. ISPAN 1999: 184-189 - 1998
- Muralidhar Medidi, Narsingh Deo:
Parallel Dictionaries Using AVL Trees. J. Parallel Distributed Comput. 49(1): 146-155 (1998) - 1997
- Narsingh Deo, Nishit Kumar:
Constrained spanning tree problems: Approximate methods and parallel computation. Network Design: Connectivity and Facilities Location 1997: 191-217
skipping 44 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-04-25 13:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint