| Recent advances in Google real-time HMM-driven unit selection synthesizer X Gonzalvo, S Tazari, C Chan, M Becker, A Gutkin, H Silen | 70 | 2016 |
| Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs G Borradaile, ED Demaine, S Tazari Algorithmica 68 (2), 287-311, 2014 | 67 | 2014 |
| Lower bounds for the complexity of monadic second-order logic S Kreutzer, S Tazari 2010 25th Annual IEEE Symposium on Logic in Computer Science, 189-198, 2010 | 62 | 2010 |
| On brambles, grid-like minors, and parameterized intractability of monadic second-order logic S Kreutzer, S Tazari Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 57 | 2010 |
| Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation S Tazari, M Müller-Hannemann Discrete Applied Mathematics 157 (4), 673-684, 2009 | 39 | 2009 |
| A near linear time approximation scheme for Steiner tree among obstacles in the plane M Müller-Hannemann, S Tazari Computational Geometry 43 (4), 395-409, 2010 | 27 | 2010 |
| Directed nowhere dense classes of graphs S Kreutzer, S Tazari Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 24 | 2012 |
| Dealing with large hidden constants: Engineering a planar Steiner tree PTAS S Tazari, M Müller-Hannemann Journal of Experimental Algorithmics (JEA) 16, 3.1-3.33, 2008 | 18 | 2008 |
| Faster approximation schemes and parameterized algorithms on (odd-) H-minor-free graphs S Tazari Theoretical Computer Science 417, 95-107, 2012 | 16 | 2012 |
| Computing hypergraph width measures exactly L Moll, S Tazari, M Thurley Information Processing Letters 112 (6), 238-242, 2012 | 12 | 2012 |
| Workload balancing in multi-stage production processes S Tazari, M Müller-Hannemann, K Weihe Experimental Algorithms: 5th International Workshop, WEA 2006, Cala Galdana …, 2006 | 12 | 2006 |
| Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs S Tazari International Symposium on Mathematical Foundations of Computer Science, 641-652, 2010 | 11 | 2010 |
| Cross-Monotonic Cost-Sharing Schemes for Combinatorial Optimization Games: A Survey S Tazari University of British Columbia, 2005 | 7 | 2005 |
| A near linear time approximation scheme for Steiner tree among obstacles in the plane M Müller-Hannemann, S Tazari Algorithms and Data Structures: 10th International Workshop, WADS 2007 …, 2007 | 6 | 2007 |
| Algorithmic approaches for two fundamental optimization problems: Workload-balancing and planar Steiner trees S Tazari Diploma thesis, Technische Universität Darmstadt, Germany, 2006 | 6 | 2006 |
| Speech generation using crosslingual phoneme mapping A Patel, S Tazari US Patent 11,430,425, 2022 | 5 | 2022 |
| Algorithms for planar graphs and beyond E Demaine, S Mozes, C Sommer, S Tazari MIT, 2015 | 3 | 2015 |
| Algorithmic graph minor theory: approximation, parameterized complexity, and practical aspects S Tazari na, 2010 | 3 | 2010 |
| A faster shortest-paths algorithm for minor-closed graph classes S Tazari, M Müller-Hannemann Graph-Theoretic Concepts in Computer Science: 34th International Workshop …, 2008 | 3 | 2008 |
| Speech generation using crosslingual phoneme mapping A Patel, S Tazari US Patent 12,080,271, 2024 | 1 | 2024 |
