Siamak Tazari

According to our database, Siamak Tazari authored at least 17 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

PronScribe: Highly Accurate Multimodal Phonemic Transcription From Speech and Text.

Yang Yu, Matthew Perez, Ankur Bapna, Fadi Haik, Siamak Tazari, Yu Zhang

Proceedings of the 24th Annual Conference of the International Speech Communication Association, 2023

2022

Improving Phonetic Realizations in its by Using Phoneme-Aligned Graphemes.

Manish Sharma, Yizhi Hong, Emily Kaplan, Siamak Tazari, Rob Clark

Proceedings of the IEEE International Conference on Acoustics, 2022

2016

Recent Advances in Google Real-Time HMM-Driven Unit Selection Synthesizer.

Xavi Gonzalvo, Siamak Tazari, Chun-an Chan, Markus Becker, Alexander Gutkin, Hanna Silén

Proceedings of the 17th Annual Conference of the International Speech Communication Association, 2016

2012

Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs.

Siamak Tazari

Theor. Comput. Sci., 2012

Computing hypergraph width measures exactly.

Lukas Moll, Siamak Tazari, Marc Thurley

Inf. Process. Lett., 2012

Directed nowhere dense classes of graphs.

Stephan Kreutzer, Siamak Tazari

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

Algorithmic graph minor theory: approximation, parameterized complexity, and practical aspects.

Siamak Tazari

PhD thesis, 2010

Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs

Siamak Tazari

CoRR, 2010

On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic.

Stephan Kreutzer, Siamak Tazari

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Faster Approximation Schemes and Parameterized Algorithms on <i>H</i>-Minor-Free and Odd-Minor-Free Graphs.

Siamak Tazari

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Lower Bounds for the Complexity of Monadic Second-Order Logic.

Stephan Kreutzer, Siamak Tazari

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.

Siamak Tazari, Matthias Müller-Hannemann

Discret. Appl. Math., 2009

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.

Glencora Borradaile, Erik D. Demaine, Siamak Tazari

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS.

Siamak Tazari, Matthias Müller-Hannemann

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.

Siamak Tazari, Matthias Müller-Hannemann

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.

Matthias Müller-Hannemann, Siamak Tazari

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2006

Workload Balancing in Multi-stage Production Processes.

Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006