# Sanjukta Bhowmick

According to our database

Collaborative distances:

^{1}, Sanjukta Bhowmick authored at least 49 papers between 2002 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Using core-periphery structure to predict high centrality nodes in time-varying networks.

Data Min. Knowl. Discov., 2018

On Rich Clubs of Path-Based Centralities in Networks.

CoRR, 2018

Using Core-Periphery Structure to Predict High Centrality Nodes in Time-Varying Networks.

CoRR, 2018

2017

HUBify: Efficient Estimation of Central Entities Across Multiplex Layer Compositions.

Proceedings of the 2017 IEEE International Conference on Data Mining Workshops, 2017

Efficient Community Re-creation in Multilayer Networks Using Boolean Operations.

Proceedings of the International Conference on Computational Science, 2017

Holistic Analysis of Multi-source, Multi-feature Data: Modeling and Computation Challenges.

Proceedings of the Big Data Analytics - 5th International Conference, 2017

2016

GenPerm: A Unified Method for Detecting Non-Overlapping and Overlapping Communities.

IEEE Trans. Knowl. Data Eng., 2016

Permanence and Community Structure in Complex Networks.

TKDD, 2016

Understanding Stability of Noisy Networks through Centrality Measures and Local Connections.

CoRR, 2016

Sensitivity and Reliability in Incomplete Networks: Centrality Metrics to Community Scoring Functions.

CoRR, 2016

Scalable Holistic Analysis of Multi-Source, Data-Intensive Problems Using Multilayered Networks.

CoRR, 2016

GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities.

CoRR, 2016

Permanence and Community Structure in Complex Networks.

CoRR, 2016

Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components.

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

Understanding Stability of Noisy Networks through Centrality Measures and Local Connections.

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Sensitivity and reliability in incomplete networks: Centrality metrics to community scoring functions.

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

Gender Assignment for Directional Full-Duplex FDD Nodes in a Multihop Wireless Network.

Proceedings of the Ad Hoc Networks - 8th International Conference, 2016

2015

A new augmentation based algorithm for extracting maximal chordal subgraphs.

J. Parallel Distrib. Comput., 2015

2014

On the Permanence of Vertices in Network Communities.

CoRR, 2014

Identifying Important Classes of Large Software Systems through k-Core Decomposition.

Advances in Complex Systems, 2014

An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks.

Proceedings of the Fourth Workshop on Irregular Applications, 2014

On the permanence of vertices in network communities.

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Building blocks for graph based network analysis.

Proceedings of the IEEE High Performance Extreme Computing Conference, 2014

2013

Constant Communities in Complex Networks

CoRR, 2013

Towards Context-Aware, Real Time and Autonomous Decision Making Using Information Aggregation and Network Analytics.

Proceedings of the Eighth Conference on Semantic Technologies for Intelligence, 2013

Identifying High betweenness Centrality Vertices in Large Noisy Networks.

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

A structure-preserving hybrid-chordal filter for sampling in correlation networks.

Proceedings of the International Conference on High Performance Computing & Simulation, 2013

Analysis of Incrementally Generated Clusters in Biological Networks Using Graph-Theoretic Filters and Ontology Enrichment.

Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

2012

Function-preserving Filters for Sampling in Biological Networks.

Proceedings of the International Conference on Computational Science, 2012

The Development of Parallel Adaptive Sampling Algorithms for Analyzing Biological Networks.

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

A Novel Multithreaded Algorithm for Extracting Maximal Chordal Subgraphs.

Proceedings of the 41st International Conference on Parallel Processing, 2012

A Comparison of Computational Approaches in the Molecular Identification of Pathogenic Organisms.

Proceedings of the 2012 IEEE Second International Conference on Healthcare Informatics, 2012

Identifying base clusters and their application to maximizing modularity.

Proceedings of the Graph Partitioning and Graph Clustering, 2012

A comparison between hierarchical clustering and community detection method in the collection of gene targets for molecular identification of pathogenic fungi.

Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2012

On the design of advanced filters for biological networks using graph theoretic properties.

Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine, 2012

2011

A Parallel Graph Sampling Algorithm for Analyzing Gene Correlation Networks.

Proceedings of the International Conference on Computational Science, 2011

ACM SRC poster: a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks.

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, 2011

A noise reducing sampling approach for uncovering critical properties in large scale biological networks.

Proceedings of the 2011 International Conference on High Performance Computing & Simulation, 2011

Measuring disruption from software evolution activities using graph-based metrics.

Proceedings of the IEEE 27th International Conference on Software Maintenance, 2011

2010

Towards high-quality, untangled meshes via a force-directed graph embedding approach.

Proceedings of the International Conference on Computational Science, 2010

Fast Community Detection for Dynamic Complex Networks.

Proceedings of the Complex Networks - Second International Workshop, 2010

Feature subspace transformations for enhancing k-means clustering.

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

Application of Alternating Decision Trees in Selecting Sparse Linear Solvers.

Proceedings of the Software Automatic Tuning, From Concepts to State-of-the-Art Results, 2010

2009

Towards Low-Cost, High-Accuracy Classifiers for Linear Solver Selection.

Proceedings of the Computational Science, 2009

2008

Improving the Performance of Graph Coloring Algorithms through Backtracking.

Proceedings of the Computational Science, 2008

2006

Middleware for Dynamic Adaptation of Component Applications.

Proceedings of the Grid-Based Problem Solving Environments, 2006

2004

Faster PDE-based simulations using robust composite linear solvers.

Future Generation Comp. Syst., 2004

2003

The Role of Multi-method Linear Solvers in PDE-based Simulations.

Proceedings of the Computational Science and Its Applications, 2003

2002

A Combinatorial Scheme for Developing Efficient Composite Solvers.

Proceedings of the Computational Science - ICCS 2002, 2002