Siamak Tazari

Available identifiers

Publication	Date of Publication	Type
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS	2019-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q5743498	2019-05-10	Paper
Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs	2014-12-02	Paper
Directed Nowhere Dense Classes of Graphs	2014-05-22	Paper
Dealing with large hidden constants	2014-04-01	Paper
Computing hypergraph width measures exactly	2012-07-18	Paper
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs	2012-04-24	Paper
Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs	2012-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q5391139	2011-04-05	Paper
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs	2010-09-03	Paper
A near linear time approximation scheme for Steiner tree among obstacles in the plane	2010-03-16	Paper
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation	2009-06-30	Paper
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane	2009-02-17	Paper
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes	2009-01-20	Paper
Workload Balancing in Multi-stage Production Processes	2007-09-14	Paper

This page was built for person: Siamak Tazari