|
Search the dblp DataBase
MohammadHossein Bateni:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami
Plane embeddings of planar graph metrics. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:197-206 [Conf]
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. [Citation Graph (, )][DBLP]
Submodular Secretary Problem and Extensions. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. [Citation Graph (, )][DBLP]
The Cooperative Game Theory Foundations of Network Bargaining Games. [Citation Graph (, )][DBLP]
Multi-VPN Optimization for Scalable Routing via Relaying. [Citation Graph (, )][DBLP]
Euclidean Prize-Collecting Steiner Forest. [Citation Graph (, )][DBLP]
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. [Citation Graph (, )][DBLP]
Scheduling to minimize staleness and stretch in real-time data warehouses. [Citation Graph (, )][DBLP]
MaxMin allocation via degree lower-bounded arborescences. [Citation Graph (, )][DBLP]
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. [Citation Graph (, )][DBLP]
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth [Citation Graph (, )][DBLP]
Euclidean Prize-collecting Steiner Forest [Citation Graph (, )][DBLP]
The cooperative game theory foundations of network bargaining games [Citation Graph (, )][DBLP]
Prize-collecting Network Design on Planar Graphs [Citation Graph (, )][DBLP]
Plane Embeddings of Planar Graph Metrics. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
|