Travelled to:1 × Canada
1 × Denmark
1 × France
1 × Greece
1 × Latvia
2 × USA
Collaborated with:E.D.Demaine M.Bateni V.Liaghat K.Kawarabayashi H.Mahini D.Panigrahi D.Marx P.N.Klein N.Immorlica A.Blum K.Ligett A.Roth H.Esfandiari M.R.Khani H.Räcke
Talks about:steiner (5) graph (5) algorithm (4) approxim (3) problem (2) weight (2) planar (2) onlin (2) minor (2) tree (2)
Person: MohammadTaghi Hajiaghayi
DBLP: Hajiaghayi:MohammadTaghi
Contributed to:
20142013
20112010201020092008Wrote 9 papers:
- ICALP-v1-2014-EsfandiariHKLMR #online #order #probability #scheduling
- Online Stochastic Reordering Buffer Scheduling (HE, MH, MRK, VL, HM, HR), pp. 465–476.
- ICALP-v1-2014-HajiaghayiLP #algorithm #online #problem
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.
- ICALP-v1-2013-BateniHL #algorithm #approximate #problem
- Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (MB, MH, VL), pp. 81–92.
- STOC-2011-DemaineHK #algorithm #composition #graph
- Contraction decomposition in h-minor-free graphs and algorithmic applications (EDD, MH, KiK), pp. 441–450.
- ICALP-v1-2010-BateniHIM #game studies #network
- The Cooperative Game Theory Foundations of Network Bargaining Games (MB, MH, NI, HM), pp. 67–78.
- STOC-2010-BateniHM #approximate #bound #graph
- Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
- ICALP-v1-2009-DemaineHK #algorithm #approximate #graph
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
- ICALP-v1-2009-DemaineHK09a #graph
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.
- STOC-2008-BlumHLR
- Regret minimization and the price of total anarchy (AB, MH, KL, AR), pp. 373–382.