Siamak Tazari

25 papers A* 3A 4B 3Misc 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2023 A conf
PronScribe: Highly Accurate Multimodal Phonemic Transcription From Speech and Text.
INTERSPEECH
Yang Yu, Matthew Perez, Ankur Bapna, Fadi Haik, Siamak Tazari, Yu Zhang
2022 Misc conf
Improving Phonetic Realizations in its by Using Phoneme-Aligned Graphemes.
ICASSP
Manish Sharma, Yizhi Hong, Emily Kaplan, Siamak Tazari, Rob Clark
2016 A conf
Recent Advances in Google Real-Time HMM-Driven Unit Selection Synthesizer.
INTERSPEECH
Xavi Gonzalvo, Siamak Tazari, Chun-an Chan, Markus Becker, Alexander Gutkin, Hanna Silén
2014 J jnl
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
Algorithmica
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2012 J jnl
Computing hypergraph width measures exactly.
Inf. Process. Lett.
Lukas Moll, Siamak Tazari, Marc Thurley
2012 A* conf
Directed nowhere dense classes of graphs.
SODA
Stephan Kreutzer, Siamak Tazari
2012 J jnl
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs.
Theor. Comput. Sci.
Siamak Tazari
2011 J jnl
Computing hypergraph width measures exactly
CoRR
Lukas Moll, Siamak Tazari, Marc Thurley
2011 J jnl
Dealing with large hidden constants: engineering a planar steiner tree PTAS.
ACM J. Exp. Algorithmics
Siamak Tazari, Matthias Müller-Hannemann
2011 J jnl
Directed Nowhere Dense Classes of Graphs
CoRR
Stephan Kreutzer, Siamak Tazari
2010 J jnl
A near linear time approximation scheme for Steiner tree among obstacles in the plane.
Comput. Geom.
Matthias Müller-Hannemann, Siamak Tazari
2010 — —
Algorithmic graph minor theory: approximation, parameterized complexity, and practical aspects.
Siamak Tazari
2010 B conf
Faster Approximation Schemes and Parameterized Algorithms on
MFCS
Siamak Tazari
2010 J jnl
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs
CoRR
Siamak Tazari
2010 J jnl
Lower Bounds for the Complexity of Monadic Second-Order Logic
CoRR
Stephan Kreutzer, Siamak Tazari
2010 A* conf
Lower Bounds for the Complexity of Monadic Second-Order Logic.
LICS
Stephan Kreutzer, Siamak Tazari
2010 A* conf
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic.
SODA
Stephan Kreutzer, Siamak Tazari
2009 A conf
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS.
ALENEX
Siamak Tazari, Matthias Müller-Hannemann
2009 J jnl
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic
CoRR
Stephan Kreutzer, Siamak Tazari
2009 J jnl
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
CoRR
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2009 A conf
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
STACS
Glencora Borradaile, Erik D. Demaine, Siamak Tazari
2009 J jnl
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.
Discret. Appl. Math.
Siamak Tazari, Matthias Müller-Hannemann
2008 B conf
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.
WG
Siamak Tazari, Matthias Müller-Hannemann
2007 B conf
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.
WADS
Matthias Müller-Hannemann, Siamak Tazari
2006 — conf
Workload Balancing in Multi-stage Production Processes.
WEA
Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe