List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs Discrete Optimization | 2013-03-13 | Paper |
| Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs Algorithmica | 2012-04-26 | Paper |
| Approximation Algorithms and Hardness for Domination with Propagation SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
| Domination in graphs with bounded propagation: Algorithms, formulations and hardness results Journal of Combinatorial Optimization | 2010-08-13 | Paper |
| Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| Approximation Algorithms and Hardness for Domination with Propagation Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Research outcomes over time
This page was built for person: Ashkan Aazami
