Siamak Tazari

Publication Activity (10 Years)

Years Active: 2006-2022
Publications (10 Years): 2

Top Venues

ICASSP

INTERSPEECH

Algorithmica

Humboldt University of Berlin (PHD)

Education History

Humboldt University of Berlin

PHD

Publications

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

Siamak Tazari.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Siamak Tazari