S. M. Ferdous

Orcid: 0000-0001-5078-0031

According to our database1, S. M. Ferdous authored at least 25 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem.
CoRR, 2024

GreedyML: A Parallel Algorithm for Maximizing Submodular Functions.
CoRR, 2024

Approximate Bipartite b-Matching using Multiplicative Auction.
CoRR, 2024

\texttt{Picasso}: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing.
CoRR, 2024

2023
Streaming Algorithms for Weighted k-Disjoint Matchings.
CoRR, 2023

cuAlign: Scalable Network Alignment on GPU Accelerators.
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, 2023

AMG Preconditioners based on Parallel Hybrid Coarsening and Multi-objective Graph Matching.
Proceedings of the 31st Euromicro International Conference on Parallel, 2023

2021
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications.
Int. J. High Perform. Comput. Appl., 2021

A Parallel Approximation Algorithm for Maximizing Submodular b-Matching.
CoRR, 2021

Privacy-Preserving Decentralized Aggregation for Federated Learning.
Proceedings of the 2021 IEEE Conference on Computer Communications Workshops, 2021

A Parallel Approximation Algorithm for Maximizing Submodular <i>b</i>-Matching.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Dynamic Frequency and Overload Management in Autonomous Coupled Microgrids for Self-Healing and Resiliency Improvement.
IEEE Access, 2020

2019
Approximation algorithms in combinatorial scientific computing.
Acta Numer., 2019

2018
New Approximation Algorithms for Minimum Weighted Edge Cover.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

Adaptive anonymization of data using b-edge cover.
Proceedings of the International Conference for High Performance Computing, 2018

Parallel Algorithms Through Approximation: B-Edge Cover.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017
Solving the Minimum Common String Partition Problem with the Help of Ants.
Math. Comput. Sci., 2017

2016
Finding network connectivity failure in a Wireless Sensor Network.
Proceedings of the 2016 Wireless Days, 2016

2015
A metaheuristic approach for application partitioning in mobile system.
Proceedings of the International Conference on Networking Systems and Security, 2015

2014
An Integer Programming Formulation of the Minimum Common String Partition problem.
CoRR, 2014

A MAX-MIN Ant Colony System for Minimum Common String Partition Problem.
CoRR, 2014

2011
Speech development of autistic children by interactive computer games.
Interact. Technol. Smart Educ., 2011

Teaching intelligible speech to the autistic children by interactive computer games.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

A Computer Game Based Approach for Increasing Fluency in the Speech of the Autistic Children.
Proceedings of the ICALT 2011, 2011

2010
Increasing Intelligibility in the Speech of the Autistic Children by an Interactive Computer Game.
Proceedings of the 12th IEEE International Symposium on Multimedia, 2010


  Loading...