Mohammad Hossein BATENI

I am currently a Senior Research Scientist at Google Research, where I joined the Market Algorithms and Optimization team in October 2011. Before that, I obtained Master's and Ph.D. degrees in Computer Science from Princeton University, where I was delighted to have Professor Moses Charikar as my adviser. I received my B.Sc. from the Department of Computer Engineering of Sharif University of Technology, Tehran, Iran.
my picture

Contact information:
Google Inc.
76 Ninth Avenue
New York, NY 10011
E-mail:
<id> @ CS dot Princeton.EDU, where id is to be replaced by mbateni
Here, you can find my resume and Ph.D. dissertation.
My personal homepage is available here.

Research Interests

  • Algorithms, (Combinatorial) Optimization
  • Approximation Algorithms and Hardness of Approximation
  • Network Design, Mobile Computing, Network Management
  • Fair Allocation, Algorithmic Game Theory
  • Graph Theory, Combinatorics
  • Parallel and Distributed Computing, Job Scheduling
  • Computational Geometry

I have served as a referee for Discrete Mathematics Journal, Algorithmica, ACM Transactions on Algorithms, IEEE/ACM Transactions on Networking, SIAM Journal on Computing, SIAM Journal on Discrete Mathematics, Journal of Discrete Algorithms, and Journal of Parallel and Distributed Computing as well as for FOCS, SODA, SPAA, CSICC, IWPEC, SWAT, SAGT, APPROX, ICCCT, IPCO, ICALP, and COCOON.

Research Papers

A polynomial-time approximation scheme for planar multiway cut
with MohammadTaghi Hajiaghayi, Philip N. Klein and Claire Mathieu
—To appear in SODA 2012, 23rd Annual ACM-SIAM Symposium on Discrete Algorithms

Towards an efficient algorithmic framework for pricing cellular data service
with MohammadTaghi Hajiaghayi, Sina Jafarpour and Dan Pei
INFOCOM 2011, 30th Annual Conference of the IEEE Communications Society

Prize-collecting network design on planar graphs
with MohammadTaghi Hajiaghayi and Dániel Marx
and Chandra Chekuri, Alina Ene and Nitish Korula (merged)
SODA 2011, 22nd Annual ACM-SIAM Symposium on Discrete Algorithms

The submodular secretary problem and its extensions
with MohammadTaghi Hajiaghayi and Morteza Zadimoghaddam
APPROX 2010, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Approximation Algorithms for the Directed k-Stroll and k-Tour Problems
with Julia Chuzhoy
APPROX 2010, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
—To appear in Algorithmica

Cooperative game theory foundations of network bargaining games
with MohammadTaghi Hajiaghayi, Nicole Immorlica and Hamid Mahini
ICALP 2010, 37th International Colloquium on Automata, Languages and Programming

PTASes for Steiner forest on planar graphs and graphs of bounded treewidth
with MohammadTaghi Hajiaghayi and Dániel Marx
STOC 2010, 42nd ACM Symposium on Theory of Computing
—To appear in Journal of the ACM

Euclidean Prize-collecting Steiner Forest
with MohammadTaghi Hajiaghayi
LATIN 2010, 9th Latin American Theoretical Informatics Symposium
—To appear in Algorithmica

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
with Aaron Archer, MohammadTaghi Hajiaghayi and Howard Karloff
FOCS 2009, 50th Annual IEEE Symposium on Foundations of Computer Science
SIAM Journal on Computing, Volume 40, Issue 2, pp. 309-332

A note on the subadditive network design problem
with MohammadTaghi Hajiaghayi
Operations Research Letters, Volume 37, Issue 5, Sept. 2009, pp. 339-344

New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation
with Moses Charikar and Venkatesan Guruswami
Technical Report TR-848-09, March 2009, Department of Computer Science, Princeton University
to be submitted.

Minimizing Staleness and Stretch in Real-Time Data Ware-houses
with Lukasz Golab, MohammadTaghi Hajiaghayi and Howard Karloff
SPAA 2009, 21st ACM Symposium on Parallelism in Algorithms and Architectures
Theory of Computing Systems [Special Issue on SPAA 2009], Volume 49, Number 4, pp. 757-780 (2011).

MaxMin allocation via degree lower-bounded arborescences
with Moses Charikar and Venkatesan Guruswami
STOC 2009, 41st ACM Symposium on Theory of Computing

Multi-VPN Optimization for Scalable Routing via Relaying
with Alexandre Gerber, MohammadTaghi Hajiaghayi and Subhabrata Sen
INFOCOM 2009, 28th Annual Conference of the IEEE Communications Society
IEEE/ACM Transactions on Networking, Volume 18, Number 5, pp. 1544-1556

Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
with MohammadTaghi Hajiaghayi
SODA 2009, 20th Annual ACM-SIAM Symposium on Discrete Algorithms
—To appear in The ACM Transactions on Algorithms

Plane Embedding of Planar Graph Metrics
with MohammadTaghi Hajiaghayi, Erik Demaine and Mohammad Moharrami
SoCG 2006, 22nd Annual ACM Symposium on Computational Geometry
Journal of Discrete and Computational Geometry, Volume 38, Number 3, pp. 615-637


Last Updated: