Mohammad Hossein Bateni

According to our database1, Mohammad Hossein Bateni authored at least 42 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Introduction to the Special Issue for SPAA'17.
TOPC, 2019

Cache-aware load balancing of data center applications.
PVLDB, 2019

Concise Bid Optimization Strategies with Multiple Budget Constraints.
Management Science, 2019

Distributed Balanced Partitioning via Linear Embedding.
Algorithms, 2019

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Categorical Feature Compression via Submodular Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

Distributed Weighted Matching via Randomized Composable Coresets.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.
SIAM J. Comput., 2018

Massively Parallel Dynamic Programming on Trees.
CoRR, 2018

Fast algorithms for knapsack via convolution and prediction.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Optimal Distributed Submodular Optimization via Sketching.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Brief Announcement: MapReduce Algorithms for Massive Trees.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Almost Optimal Streaming Algorithms for Coverage Problems.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Affinity Clustering: Hierarchical Clustering at Scale.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

A Study of Compact Reserve Pricing Languages.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Secretary Problems and Online Auctions.
Encyclopedia of Algorithms, 2016

Distributed Coverage Maximization via Sketching.
CoRR, 2016

A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Fair Resource Allocation in A Volatile Marketplace.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Revenue Maximization with Nonexcludable Goods.
ACM Trans. Economics and Comput., 2015

Revenue Maximization for Selling Multiple Correlated Items.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Network Cournot Competition.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Multiplicative bidding in online advertising.
Proceedings of the ACM Conference on Economics and Computation, 2014

Distributed Balanced Clustering via Mapping Coresets.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Submodular secretary problem and extensions.
ACM Trans. Algorithms, 2013

Approximation Algorithms for the Directed k-Tour and k-Stroll Problems.
Algorithmica, 2013

2012
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location.
ACM Trans. Algorithms, 2012

Euclidean Prize-Collecting Steiner Forest.
Algorithmica, 2012

A polynomial-time approximation scheme for planar multiway cut.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
SIAM J. Comput., 2011

Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses.
Theory Comput. Syst., 2011

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth.
J. ACM, 2011

Prize-collecting Steiner Problems on Planar Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Towards an efficient algorithmic framework for pricing cellular data service.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Multi-VPN Optimization for Scalable Routing via Relaying.
IEEE/ACM Trans. Netw., 2010

Prize-collecting Network Design on Planar Graphs
CoRR, 2010

The Cooperative Game Theory Foundations of Network Bargaining Games.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Approximation Algorithms for the Directed k-Tour and k-Stroll Problems.
Proceedings of the Approximation, 2010

2009
A note on the subadditive network design problem.
Oper. Res. Lett., 2009

MaxMin allocation via degree lower-bounded arborescences.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2007
Plane Embeddings of Planar Graph Metrics.
Discrete & Computational Geometry, 2007


  Loading...