Search the dblp DataBase

Publications of Author

1. Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
   Workload Balancing in Multi-stage Production Processes. [Citation Graph (0, 0)][DBLP]
   WEA, 2006, pp:49-60 [Conf]
   
2. Matthias Müller-Hannemann, Siamak Tazari
   A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
   WADS, 2007, pp:151-162 [Conf]
   
3. 
   Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. [Citation Graph (, )][DBLP]
   
   
4. 
   Lower Bounds for the Complexity of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]
   
   
5. 
   Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]
   
   
7. 
   Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. [Citation Graph (, )][DBLP]
   
   
9. 
   A near linear time approximation scheme for Steiner tree among obstacles in the plane. [Citation Graph (, )][DBLP]
   
   
10. 
    Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs [Citation Graph (, )][DBLP]
    
    
11. 
    On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic [Citation Graph (, )][DBLP]
    
    
12. 
    Lower Bounds for the Complexity of Monadic Second-Order Logic [Citation Graph (, )][DBLP]
    
    
13. 
    Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs [Citation Graph (, )][DBLP]
    
    
14. 
    Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. [Citation Graph (, )][DBLP]