 | 2009 |
|---|
| 8 |       | Siamak Tazari,
Matthias Müller-Hannemann:
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS.
ALENEX 2009: 120-131 |
| 7 | | Glencora Borradaile,
Erik D. Demaine,
Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.
STACS 2009: 171-182 |
| 6 | | Glencora Borradaile,
Erik D. Demaine,
Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
CoRR abs/0902.1043: (2009) |
| 5 | | Stephan Kreutzer,
Siamak Tazari:
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic
CoRR abs/0907.3076: (2009) |
| 4 | | Siamak Tazari,
Matthias Müller-Hannemann:
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation.
Discrete Applied Mathematics 157(4): 673-684 (2009) |
| 2008 |
|---|
| 3 | | Siamak Tazari,
Matthias Müller-Hannemann:
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.
WG 2008: 360-371 |
| 2007 |
|---|
| 2 | | Matthias Müller-Hannemann,
Siamak Tazari:
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.
WADS 2007: 151-162 |
| 2006 |
|---|
| 1 | | Siamak Tazari,
Matthias Müller-Hannemann,
Karsten Weihe:
Workload Balancing in Multi-stage Production Processes.
WEA 2006: 49-60 |
