Ashkan Aazami

Iran University of Science and Technology — IR

Computer Science · Physical Sciences

11h-index600citations25works28.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(10), Advanced Graph Theory Research(9), Speech and Audio Processing(6), Machine Learning and Data Classification(4), Speech Recognition and Synthesis(3)

Publications25 total

Drilling-induced delamination effect on the bending and out-of-plane shear characteristics of the woven carbon/epoxy composites
Journal of Composite Materials·2025
ICASSP 2023 Deep Noise Suppression Challenge
IEEE Open Journal of Signal Processing·2024· 56 citedOpen Access
ICASSP 2023 Deep Noise Suppression Challenge
arXiv (Cornell University)·2023Open Access
Icassp 2022 Deep Noise Suppression Challenge
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)·2022· 147 cited
ICASSP 2022 Deep Noise Suppression Challenge
arXiv (Cornell University)·2022· 3 citedOpen Access
A Bi-objective Robust Optimization Model for an Integrated Production-distribution Problem of Perishable Goods with Demand Improvement Strategies: A Case Study
International Journal of Engineering·2021· 7 citedOpen Access
Resonance: Replacing Software Constants with Context-Aware Models in Real-time Communication
arXiv (Cornell University)·2020Open Access
Resonance: Replacing Software Constants with Context-Aware Models in\n Real-time Communication
arXiv (Cornell University)·2020· 1 citedOpen Access
The INTERSPEECH 2020 Deep Noise Suppression Challenge: Datasets, Subjective Testing Framework, and Challenge Results
2020· 31 citedOpen Access
Lumos
2020· 11 cited
Lumos: A Library for Diagnosing Metric Regressions in Web-Scale Applications
arXiv (Cornell University)·2020· 3 citedOpen Access
The INTERSPEECH 2020 Deep Noise Suppression Challenge: Datasets,\n Subjective Testing Framework, and Challenge Results
arXiv (Cornell University)·2020· 2 citedOpen Access
The INTERSPEECH 2020 Deep Noise Suppression Challenge: Datasets, Subjective Speech Quality and Testing Framework
arXiv (Cornell University)·2020· 67 citedOpen Access
A bad example for the iterative rounding method for mincost <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si52.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected spanning subgraphs
Discrete Optimization·2012· 14 cited
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Algorithmica·2011· 19 cited
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS\n Tutorial Lecture Notes)
arXiv (Cornell University)·2010Open Access
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
arXiv (Cornell University)·2010· 4 citedOpen Access
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Lecture notes in computer science·2009· 2 cited
Approximation Algorithms and Hardness for Domination with Propagation
SIAM Journal on Discrete Mathematics·2009· 62 cited
Hardness results and approximation algorithms for some problems on graphs
UWSpace (University of Waterloo)·2008· 67 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Vishak Gopal(11), Ross Cutler(11), Harishchandra Dubey(7), Sebastian Braun(7), Robert Aichner(7), Johannes Gehrke(7), Sergiy Matusevych(5), Ebrahim Beyrami(5), Jayant Gupchup(4), Hannes Gamper(3), Chandan K. Reddy(3), Sriram Srinivasan(3), Joseph Cheriyan(3), Şefik Emre Eskimez(2), Manthan Thakker(2), Takuya Yoshioka(2), Roger Cheng(2), Puneet Rana(2), Babak Naderi(2), Alex Ju(2)