The following pages link to Siamak Tazari (Q437683):
Displayed 15 items.
- Computing hypergraph width measures exactly (Q437685) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs (Q3586119) (← links)
- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane (Q3603523) (← links)
- Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS (Q5233571) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- Workload Balancing in Multi-stage Production Processes (Q5307530) (← links)
- Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs (Q5389975) (← links)
- (Q5391139) (← links)
- Dealing with large hidden constants (Q5406254) (← links)
- Directed Nowhere Dense Classes of Graphs (Q5417630) (← links)
- (Q5743498) (← links)