
Search the dblp DataBase
Siamak Tazari:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Siamak Tazari, Matthias MüllerHannemann, Karsten Weihe
Workload Balancing in Multistage Production Processes. [Citation Graph (0, 0)][DBLP] WEA, 2006, pp:4960 [Conf]
 Matthias MüllerHannemann, Siamak Tazari
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP] WADS, 2007, pp:151162 [Conf]
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. [Citation Graph (, )][DBLP]
Lower Bounds for the Complexity of Monadic SecondOrder Logic. [Citation Graph (, )][DBLP]
Faster Approximation Schemes and Parameterized Algorithms on HMinorFree and OddMinorFree Graphs. [Citation Graph (, )][DBLP]
On Brambles, GridLike Minors, and Parameterized Intractability of Monadic SecondOrder Logic. [Citation Graph (, )][DBLP]
PolynomialTime Approximation Schemes for SubsetConnectivity Problems in BoundedGenus Graphs. [Citation Graph (, )][DBLP]
A Faster ShortestPaths Algorithm for MinorClosed Graph Classes. [Citation Graph (, )][DBLP]
A near linear time approximation scheme for Steiner tree among obstacles in the plane. [Citation Graph (, )][DBLP]
PolynomialTime Approximation Schemes for SubsetConnectivity Problems in BoundedGenus Graphs [Citation Graph (, )][DBLP]
On Brambles, GridLike Minors, and Parameterized Intractability of Monadic SecondOrder Logic [Citation Graph (, )][DBLP]
Lower Bounds for the Complexity of Monadic SecondOrder Logic [Citation Graph (, )][DBLP]
Faster Approximation Schemes and Parameterized Algorithms on HMinorFree and OddMinorFree Graphs [Citation Graph (, )][DBLP]
Shortest paths in linear time on minorclosed graph classes, with an application to Steiner tree approximation. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
