| 2023 | Interspeech | PronScribe: Highly Accurate Multimodal Phonemic Transcription From Speech and Text. | Yang Yu, Matthew Perez, Ankur Bapna, Fadi Haik, Siamak Tazari, Yu Zhang |
| 2022 | ICASSP | Improving Phonetic Realizations in its by Using Phoneme-Aligned Graphemes. | Manish Sharma, Yizhi Hong, Emily Kaplan, Siamak Tazari, Rob Clark |
| 2016 | Interspeech | Recent Advances in Google Real-Time HMM-Driven Unit Selection Synthesizer. | Xavi Gonzalvo, Siamak Tazari, Chun-an Chan, Markus Becker, Alexander Gutkin, Hanna Siln |
| 2012 | SODA | Directed nowhere dense classes of graphs. | Stephan Kreutzer, Siamak Tazari |
| 2010 | LICS | Lower Bounds for the Complexity of Monadic Second-Order Logic. | Stephan Kreutzer, Siamak Tazari |
| 2010 | MFCS | Faster Approximation Schemes and Parameterized Algorithms on | Siamak Tazari |
| 2010 | SODA | On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. | Stephan Kreutzer, Siamak Tazari |
| 2009 | ALENEX | Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. | Siamak Tazari, Matthias Mller-Hannemann |
| 2009 | STACS | Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. | Glencora Borradaile, Erik D. Demaine, Siamak Tazari |
| 2008 | WG | A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. | Siamak Tazari, Matthias Mller-Hannemann |
| 2007 | WADS | A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. | Matthias Mller-Hannemann, Siamak Tazari |