Siamak Tazari
According to our database1,
Siamak Tazari
authored at least 17 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Proceedings of the 24th Annual Conference of the International Speech Communication Association, 2023
2022
Proceedings of the IEEE International Conference on Acoustics, 2022
2016
Proceedings of the 17th Annual Conference of the International Speech Communication Association, 2016
2014
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
Algorithmica, 2014
2012
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs.
Theor. Comput. Sci., 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
ACM J. Exp. Algorithmics, 2011
2010
Algorithmic graph minor theory: approximation, parameterized complexity, and practical aspects.
PhD thesis, 2010
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs
CoRR, 2010
A near linear time approximation scheme for Steiner tree among obstacles in the plane.
Comput. Geom., 2010
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic.
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.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
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.
Discret. Appl. Math., 2009
2008
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
2006
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006