Balabhaskar Balasundaram
Computational Theory and Mathematics · 2011
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 6 citations into it; #9,731 of 12,182 by trust here, #10,901 by citations
- Computer Networks and Communications — 6 citations into it
Whom Balabhaskar Balasundaram trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- S. Seidman
- James Abello
- Ivan Stojmenovic
- Maurício Resende
- Vladimir Boginski
- Albert-László Barabási
- Fan Chung
- Takashi Washio
Who trusts Balabhaskar Balasundaram overall
Papers from Balabhaskar Balasundaram's perspective
Ordered by how strongly the researchers Balabhaskar Balasundaram trusts endorse each paper. Same corpus, a different order for every researcher.
- Network structure and minimum degree
- Scale-free characteristics of random networks: the topology of the world-wide web
- Statistical analysis of financial networks (Computational Statistics & Data Analysis)
- Massive Quasi-Clique Detection (Latin American Symposium on Theoretical Informatics)
- Protein complexes and functional modules in molecular networks (Proceedings of the National Academy of Sciences of the United States of America)
- Crime data mining: a general framework and some examples (Computer)
- Complex Graphs and Networks
- State of the art of graph-based data mining (SKDD)
- Gaining confidence in high-throughput protein interaction networks (Nature Biotechnology)
- Handbook of Wireless Networks and Mobile Computing
Their papers
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem (2011) — 369 citations