Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Siavash Vahdati Daneshmand" ( http://dblp.L3S.de/Authors/Siavash_Vahdati_Daneshmand )

  Author page on DBLP  Author page in RDF  Community of Siavash Vahdati Daneshmand in ASPL-2

Publication years (Num. hits)
2000-2009 (9)
Publication types (Num. hits)
article(4) inproceedings(5)
Venues (Conferences, Journals, ...)
Discrete Applied Mathematics(2) WEA(2) Algorithmics of Large and Comp...(1) APPROX(1) Electronic Colloquium on Compu...(1) ESA(1) Oper. Res. Lett.(1)
Authors
Siavash Vahdati Daneshmand(9) Tobias Polzin(9) Ernst Althaus(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 6 keywords
Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Tobias Polzin, Siavash Vahdati Daneshmand Approaches to the Steiner Problem in Networks. Search on Bibsonomy Algorithmics of Large and Complex Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tobias Polzin, Siavash Vahdati Daneshmand Practical Partitioning-Based Methods for the Steiner Problem. Search on Bibsonomy WEA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tobias Polzin, Siavash Vahdati Daneshmand On Steiner trees and minimum spanning trees in hypergraphs. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand Improving Linear Programming Approaches for the Steiner Tree Problem. Search on Bibsonomy WEA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Tobias Polzin, Siavash Vahdati Daneshmand Extending Reduction Techniques for the Steiner Tree Problem. Search on Bibsonomy ESA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Reductions, Steiner Problem
1Tobias Polzin, Siavash Vahdati Daneshmand Improved algorithms for the Steiner problem in networks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tobias Polzin, Siavash Vahdati Daneshmand A comparison of Steiner tree relaxations. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tobias Polzin, Siavash Vahdati Daneshmand Primal-Dual Approaches to the Steiner Problem Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1Tobias Polzin, Siavash Vahdati Daneshmand Primal-dual approaches to the Steiner problem. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF dual-ascent, approximation algorithms, lower bound, relaxation, primal-dual, Steiner problem
Displaying result #1 - #9 of 9 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.