Person:693759: Difference between revisions

From MaRDI portal
Person:693759
Created automatically from import230924090903
 
m AuthorDisambiguator moved page MohammadHossein Bateni to MohammadHossein Bateni: Duplicate
 
(No difference)

Latest revision as of 17:31, 12 December 2023

Available identifiers

zbMath Open bateni.mohammadhosseinMaRDI QIDQ693759

List of research outcomes

PublicationDate of PublicationType
Fair Resource Allocation in a Volatile Marketplace2022-02-18Paper
Brief Announcement: MapReduce Algorithms for Massive Trees2021-07-28Paper
Streaming Belief Propagation for Community Detection2021-06-09Paper
Distributed balanced partitioning via linear embedding2020-10-08Paper
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs2019-10-15Paper
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs2019-10-15Paper
Fast algorithms for knapsack via convolution and prediction2019-08-22Paper
https://portal.mardi4nfdi.de/entity/Q57434272019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338932019-05-06Paper
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems2018-07-06Paper
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650982017-09-29Paper
AN ANALYTICAL APPROACH FOR THERMAL STABILITY ANALYSIS OF TWO-LAYER TIMOSHENKO BEAMS2017-04-07Paper
Revenue Maximization for Selling Multiple Correlated Items2015-11-19Paper
MaxMin allocation via degree lower-bounded arborescences2015-02-04Paper
Revenue Maximization with Nonexcludable Goods2015-01-12Paper
Network Cournot Competition2015-01-07Paper
Concise Bid Optimization Strategies with Multiple Budget Constraints2015-01-07Paper
Submodular secretary problem and extensions2014-12-05Paper
Assignment problem in content distribution networks2014-09-09Paper
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth2014-08-13Paper
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP2014-07-25Paper
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth2014-02-17Paper
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems2013-08-06Paper
Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems2013-08-05Paper
Scheduling to minimize staleness and stretch in real-time data warehouses2012-12-10Paper
Euclidean prize-collecting Steiner forest2012-04-26Paper
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP2011-07-29Paper
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems2010-09-10Paper
Submodular Secretary Problem and Extensions2010-09-10Paper
The Cooperative Game Theory Foundations of Network Bargaining Games2010-09-07Paper
Euclidean Prize-Collecting Steiner Forest2010-04-27Paper
A note on the subadditive network design problem2009-11-17Paper
https://portal.mardi4nfdi.de/entity/Q36015402009-02-10Paper
Plane embeddings of planar graph metrics2008-01-04Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: MohammadHossein Bateni