On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic (2009)
Kreutzer, Stephan, Tazari, Siamak
Brambles were introduced as the dual notion to treewidth, one of the most central concepts of the graph minor theory of Robertson and Seymour. Recently, Grohe and Marx showed that there are graphs G,...
Borradaile, Glencora, Demaine, Erik D., Tazari, Siamak
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity...
Borradaile, Glencora, Demaine, Erik D., Tazari, Siamak
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity...
Borradaile, Glencora, Demaine, Erik D., Tazari, Siamak
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity...
Borradaile, Glencora, Demaine, Erik D., Tazari, Siamak
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity...
Nationality: Iranian Marital status: Single Education (2008)
(A one-year-long college required from all international students in Germany) Overall average grade: very good (1.0)
A Near Linear Time Approximation Scheme for Steiner Tree among Obstacles (2007)
Siamak Tazari, Matthias Müller-hannemann
We present a polynomial time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log 2 n), where n denotes the number of terminals...
Combinatorial algorithms have long been used to design error correcting codes with various constraints such as Hamming distance or weight. Such algorithms have been used to design DNA codes, which...