|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 7 keywords
|
|
|
|
|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashkan Aazami |
Domination in graphs with bounded propagation: algorithms, formulations and hardness results. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer |
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ashkan Aazami, Kael Stilp |
Approximation Algorithms and Hardness for Domination with Propagation. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashkan Aazami |
Domination in graphs with bounded propagation: algorithms, formulations and hardness results |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ashkan Aazami, Michael D. Stilp |
Approximation algorithms and hardness for domination with propagation |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ashkan Aazami, Michael D. Stilp |
Approximation Algorithms and Hardness for Domination with Propagation. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS |
| 1 | Ashkan Aazami, Shahram Ghandeharizadeh, Tooraj Helmi |
Near Optimal Number of Replicas for Continuous Media in Ad-hoc Networks of Wireless Devices. |
Multimedia Information Systems |
2004 |
DBLP BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")