@ARTICLE{BHM10,
AUTHOR = {Bateni, MohammadHossein and Hajiaghayi, MohammadTaghi and Marx, D\'{a}niel},
TITLE = {Approximation schemes for {S}teiner forest on planar graphs and graphs of bounded treewidth},
JOURNAL = {Journal of the ACM},
URL = {http://www-math.mit.edu/~hajiagha/planarforest.pdf},
NOTE = {To appear. A preliminary version appeared in {\em Proceedings of the 42nd ACM Symposium on Theory of computing} ({\bf STOC}),
2010, pages 211--220}
}
@ARTICLE{HKKN10,
AUTHOR = {Hajiagahyi, Mohammad Taghi and
Khandekar, Rohit and
Kortsarz, Guy and
Nutov, Zeev},
TITLE = {Prize-collecting Steiner network problems},
JOURNAL = {ACM Trans. on Algorithms},
NOTE = {To appear. A preliminary version appeared in {\em Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization} ({\bf IPCO}),
2010, pages 71--84},
URL = {http://www-math.mit.edu/~hajiagha/pcsnp.pdf}
}
@ARTICLE{HKK10,
AUTHOR = {Hajiaghayi, Mohammad Taghi and
Rohit Khandekar and Guy Kortsarz},
TITLE = {Budgeted red-blue median and its generalizations},
JOURNAL = {{\em A special issue of} \ Algorithmica \ {\em for selected papers from ESA 2010}},
BOOKTITLE = {Proceedings of the 18th Annual European Symposium on Algorithms (ESA)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2010},
URL = {http://www-math.mit.edu/~hajiagha/redblue.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 18th Annual European Symposium on Algorithms} ({\bf ESA}),
2010, pages 314--325}
}
@ARTICLE{CHK09,
AUTHOR = {Moses Charikar and Hajiaghayi, Mohammad Taghi and Howard Karloff},
TITLE = {Improved approximation algorithms for label cover problems},
JOURNAL = {{\em A special issue of} \ Algorithmica \ {\em for selected papers from ESA 2009}},
URL = {http://www-math.mit.edu/~hajiagha/LabelCover.pdf},
NOTE = {To appear, A preliminary version appeared in
{\em Proceedings of the 17th Annual European Symposium on Algorithms} ({\bf ESA}), 2009,
pages 23--34}
}
@ARTICLE{EAH+11,
AUTHOR = {Jeffrey Erman and Alexandre Gerber and Hajiaghayi, Mohammad Taghi and Dan Pei and Subhabrata Sen and Oliver Spatscheck},
TITLE = {To cache or not to cache: the {3G} case},
JOURNAL = {IEEE Internet Computing},
URL = {http://www-math.mit.edu/~hajiagha/InternetComputing.pdf},
NOTE = {To appear}
}
@ARTICLE{BGHK09,
AUTHOR = {Mohammad Hossein Bateni and Lukasz Golab and Hajiaghayi, Mohammad Taghi and Howard Karloff},
TITLE = {Scheduling to minimize Staleness and stretch in real-time data warehouses},
JOURNAL = {{\em A special issue of} \ Theory of Computing Systems \ {\em for selected papers from SPAA 2009}},
URL = {http://www-math.mit.edu/~hajiagha/Staleness.pdf},
NOTE = {To appear, {\em Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures} ({\bf SPAA}),
2009, pages 29--38}
}
@ARTICLE{BH09,
AUTHOR = {Bateni, Mohammad Hossein and Hajiaghayi, Mohammad Taghi},
TITLE = {Assignment problem in content distribution networks: unsplittable hard-capacitated facility location},
JOURNAL = {ACM Trans. Algorithms},
URL = {http://www-math.mit.edu/~hajiagha/anycast.pdf},
NOTE = {To appear. A preliminary version appeared in {\em Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms} ({\bf SODA}),
2009, pages 805--814}
}
@ARTICLE{DHMZ10,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Mahini, Hamid and Zadimoghaddam, Morteza},
TITLE = {The price of anarchy in network creation games},
JOURNAL = {ACM Trans. Algorithms},
FJOURNAL = {ACM Transactions on Algorithms},
ISBN = {978-1-59593-616-5},
URL = {http://www-math.mit.edu/~hajiagha/networkcreation.pdf},
NOTE = {To appear. A preliminary version appeared in
{\em Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing} ({\bf PODC}), 2007,
pages 292--298.
}
}
@ARTICLE{BH10,
AUTHOR = {Bateni, Mohammad Hossein and
Hajiaghayi, Mohammad Taghi},
TITLE = {Euclidean prize-collecting Steiner forest},
JOURNAL = {Algorithmica},
NOTE = {To appear. A preliminary version appeared in
{\em Proceedings of the 9th Latin American Theoretical Informatics Symposium} ({\bf LATIN}), 2010,
pages 503--514},
URL = {http://www-math.mit.edu/~hajiagha/epcsf.pdf}
}
@ARTICLE{BHGS09,
AUTHOR = {Mohammad Hossein Bateni and Mohammad Taghi Hajiaghayi and
and Alexandre Gerber and Subhabrata Sen
},
TITLE = {Multi-VPN Optimization for scalable routing via relaying},
JOURNAL = {IEEE/ACM Trans. Netw.},
YEAR = {2010},
VOLUME = {18},
YEAR = {2010},
NUMBER = {5},
PAGES = {1544--1556},
URL = {http://www-math.mit.edu/~hajiagha/MultiVPN.pdf},
NOTE = {A preliminary version appeared in {\em the 28th IEEE International Conference on Computer
Communications} ({\bf INFOCOM}), 2009}
}
@ARTICLE{DHM10,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Mohar,
Bojan},
TITLE = {Approximation algorithms via contraction decomposition},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica},
VOLUME = {30},
YEAR = {2010},
NUMBER = {5},
PAGES = {533--552},
URL = {http://www-math.mit.edu/~hajiagha/contractiondecomp.pdf},
NOTE = {A preliminary version appeared
in {\em Proceedings of the 18th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms} ({\bf SODA}), 2007, pages 278--287}
}
@ARTICLE{ABHK09,
AUTHOR = {A. Archer and M.H. Bateni and M.T. Hajiaghayi and H. Karloff},
TITLE = {Improved approximation algorithms for prize-collecting {S}teiner tree and {TSP}},
JOURNAL = {SIAM J. Comput.},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {40},
YEAR = {2011},
NUMBER = {2},
PAGES = {309--332},
NOTE = {A preliminary version appeared in
{\em Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science}
({\bf FOCS}), 2009, pages 427--436},
URL = {http://www-math.mit.edu/~hajiagha/pcst_FOCSproc.pdf}
}
@ARTICLE{CHKS10,
AUTHOR = {Chekuri, C. and Hajiaghayi, M. T. and Kortsarz, G. and Salavatipour, M. R.},
TITLE = {Approximation algorithms for non-uniform buy-at-bulk network design},
JOURNAL = {SIAM J. Comput.},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {39},
YEAR = {2010},
NUMBER = {5},
PAGES = {1772--1798},
URL = {http://www-math.mit.edu/~hajiagha/rentorbuy.pdf},
NOTE = {A preliminary version appeared
in {\em Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science} ({\bf FOCS}), 2006,
pages 677--686}
}
@ARTICLE{BDHR05,
AUTHOR = {Jonathan Bredin and
Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Daniela Rus},
TITLE = {Deploying sensor networks with guaranteed fault tolerance},
JOURNAL = {IEEE/ACM Trans. Netw.},
VOLUME = {18},
YEAR = {2010},
NUMBER = {1},
PAGES = {216--228},
URL = {http://www-math.mit.edu/~hajiagha/mobihoc.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and
Computing} ({\bf MOBIHOC}), May 2005, pages 309--319}
}
@ARTICLE{DHM+09,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Mahini,
Hamid and Sayedi-Roshkhar, Amin S. and Oveisgharan, Shayan and
Zadimoghaddam, Morteza},
TITLE = {Minimizing movement},
JOURNAL = {{\em A special issue of} \ ACM Trans. Algorithms \ {\em for selected papers from SODA 2007}},
FJOURNAL = {ACM Transactions on Algorithms},
VOLUME = {5},
NUMBER = {3},
YEAR = {2009},
ISSN = {1549-6325},
URL = {http://www-math.mit.edu/~hajiagha/movement.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 18th Annual ACM-SIAM Symposium on
Discrete Algorithms} ({\bf SODA}), January 2007, pages 258--267}
}
@ARTICLE{GHNR07,
AUTHOR = {Anupam Gupta and
Mohammad Taghi Hajiaghayi and
Viswanath Nagarajan and
R. Ravi},
TITLE = {Dial-a-ride from $k$-forest},
JOURNAL = {ACM Trans. Algorithms},
FJOURNAL = {ACM Transactions on Algorithms},
VOLUME = {6},
YEAR = {2010},
NUMBER = {2},
ISSN = {1549-6325},
URL = {http://www-math.mit.edu/~hajiagha/dialaride.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 15th Annual European
Symposium on Algorithms} ({\bf ESA}), October 2007, pages 241--252}
}
@ARTICLE{CHKR06,
AUTHOR = {Charikar, Moses and Hajiaghayi, Mohammad Taghi and Karloff,
Howard and Rao, Satish},
TITLE = {${l_2}^2$ spreading metrics for vertex ordering problems},
JOURNAL = {Algorithmica},
FJOURNAL = {Algorithmica. An International Journal in Computer Science},
VOLUME = {56},
YEAR = {2010},
NUMBER = {4},
PAGES = {577--604},
ISSN = {0178-4617},
CODEN = {ALGOEJ},
URL = {http://www-math.mit.edu/~hajiagha/procversion3.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 17th Annual ACM-SIAM Symposium
on Discrete Algorithms} ({\bf SODA}), January 2006, pages 1018--1027}
}
@ARTICLE{DHMZ09,
TITLE = {{T}he Price of Anarchy in Cooperative Network Creation Games},
AUTHOR = {{D}emaine, {E}rik {D}. and {H}ajiaghayi, {M}ohammadtaghi and {M}ahini, {H}amid and {Z}adimoghaddam, {M}orteza},
JOURNAL = {ACM SIGecom Exchanges},
VOLUME = {8},
YEAR = {2009},
NUMBER = {2},
URL = {http://www-math.mit.edu/~hajiagha/CooperativeNetworkCreation.pdf},
NOTE = {A preliminary version appeared
in {\em Proceedings of the 26th {I}nternational {S}ymposium on {T}heoretical {A}spects of {C}omputer {S}cience}
({\bf STACS}), 2009,
pages 301--312}
}
@ARTICLE{BHa09,
AUTHOR = {Mohammad Hossein Bateni and Mohammad Taghi Hajiaghayi},
TITLE = {A note on subadditive network design},
JOURNAL = {Oper. Res. Lett.},
VOLUME = {37},
YEAR = {2009},
NUMBER = {5},
PAGES = {339--344},
URL = {http://www-math.mit.edu/~hajiagha/subadditive.pdf}
}
@ARTICLE{DHK09,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and
Kawarabayashi, Kenichi},
TITLE = {Algorithmic graph minor theory: improved grid minor bounds and
{W}agner's contraction},
JOURNAL = {{\em Special issue of} \ Algorithmica \ {\em for selected papers from ISAAC 2006}},
FJOURNAL = {Algorithmica. An International Journal in Computer Science},
VOLUME = {54},
YEAR = {2009},
NUMBER = {2},
PAGES = {142--180},
ISSN = {0178-4617},
CODEN = {ALGOEJ},
MRCLASS = {68R10 (05C83 05C85 68Q25)},
MRNUMBER = {MR2500976},
URL = {http://www-math.mit.edu/~hajiagha/wagnercontraction.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 17th Annual International Symposium
on Algorithms and Computation} ({\bf ISAAC 2006}), December 2006, pages 3--15},
ABSTRACT = {\textcolor{red}{Winner of the best paper award in ISAAC 2006.}}
}
@ARTICLE{HKS09,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kortsarz, Guy and Salavatipour,
Mohammad R.},
TITLE = {Approximating buy-at-bulk and shallow-light {$k$}-{S}teiner
trees},
JOURNAL = {\bf Algorithmica},
FJOURNAL = {Algorithmica. An International Journal in Computer Science},
VOLUME = {53},
YEAR = {2009},
NUMBER = {1},
PAGES = {89--103},
ISSN = {0178-4617},
CODEN = {ALGOEJ},
MRCLASS = {68W25 (05C05 90B10)},
MRNUMBER = {MR2470599},
URL = {http://www-math.mit.edu/~hajiagha/kmst.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 9th International Workshop on
Approximation Algorithms for Combinatorial Optimization} ({\bf APPROX}), August 2006, pages 153--163}
}
@ARTICLE{FHL08,
AUTHOR = {Feige, Uriel and Hajiaghayi, Mohammad Taghi and Lee, James R.},
TITLE = {Improved approximation algorithms for minimum weight vertex
separators},
JOURNAL = {{\em Special issue of} \ SIAM J. Comput. \ {\em for selected papers from STOC 2005}},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {38},
YEAR = {2008},
NUMBER = {2},
PAGES = {629--657},
ISSN = {0097-5397},
MRCLASS = {68W25 (05C10 05C85 68Q25 68R10)},
MRNUMBER = {MR2411037 (2009g:68267)},
URL = {http://www-math.mit.edu/~hajiagha/fhl-stoc-camera.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 37th ACM Symposium on Theory of Computing} ({\bf STOC}), May 2005, pages 563--572}
}
@ARTICLE{DFHS08,
AUTHOR = {Demaine, Erik D. and Feige, Uriel and Hajiaghayi,
Mohammad Taghi and Salavatipour, Mohammad R.},
TITLE = {Combination can be hard: approximability of the unique
coverage problem},
JOURNAL = {SIAM J. Comput.},
FJOURNAL = {SIAM Journal on Computing},
VOLUME = {38},
YEAR = {2008},
NUMBER = {4},
PAGES = {1464--1483},
ISSN = {0097-5397},
MRCLASS = {68Q25 (68W25)},
MRNUMBER = {MR2448457},
MRREVIEWER = {Till Tantau},
URL = {http://www-math.mit.edu/~hajiagha/ucoverage.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 17th Annual ACM-SIAM Symposium on
Discrete Algorithms} ({\bf SODA}), January 2006, pages 162--171}
}
@ARTICLE{DH08a,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Linearity of grid minors in treewidth with applications
through bidimensionality},
JOURNAL = {Combinatorica},
FJOURNAL = {Combinatorica. An International Journal on Combinatorics and
the Theory of Computing},
VOLUME = {28},
YEAR = {2008},
NUMBER = {1},
PAGES = {19--36},
ISSN = {0209-9683},
MRCLASS = {05C83 (05C85 68R10)},
MRNUMBER = {MR2399006 (2009g:05159)},
MRREVIEWER = {Steven D. Noble},
URL = {http://www-math.mit.edu/~hajiagha/gridJ.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete
Algorithms} ({\bf SODA}), January 2005, pages 682--689}
}
@ARTICLE{BHKL08,
AUTHOR = {Butler, Steve and Hajiaghayi, Mohammad T. and Kleinberg,
Robert D. and Leighton, Tom},
TITLE = {Hat guessing games},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {22},
YEAR = {2008},
NUMBER = {2},
PAGES = {592--605},
ISSN = {0895-4801},
MRCLASS = {91A43 (05C20)},
MRNUMBER = {MR2399367 (2009f:91016)},
MRREVIEWER = {Paul Dorbec},
URL = {http://www-math.mit.edu/~hajiagha/hats.pdf},
ABSTRACT = {\textcolor{red}{The paper has been {\bf {\em selected as an exceptional paper}} {\em published in SIAM's specialized journals for the SIGEST section of SIAM Review}.
Revised version appeared in {\bf SIAM Rev. 51(2):397-397, 2009}}}
}
@ARTICLE{ABD+08,
AUTHOR = {Alon, Noga and B{\u{a}}doiu, Mihai and Demaine, Erik D. and
Farach-Colton, Martin and Hajiaghayi, Mohammad Taghi and
Sidiropoulos, Anastasios},
TITLE = {Ordinal embeddings of minimum relaxation: general properties,
trees, and ultrametrics},
JOURNAL = {ACM Trans. Algorithms},
FJOURNAL = {ACM Transactions on Algorithms},
VOLUME = {4},
YEAR = {2008},
NUMBER = {4},
PAGES = {Art. 46, 21},
ISSN = {1549-6325},
MRCLASS = {68Q25 (46B20 54E40 68W25)},
MRNUMBER = {MR2446965 (2009h:68052)},
URL = {http://www-math.mit.edu/~hajiagha/ordinal.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 16th Annual ACM-SIAM Symposium on
Discrete Algorithms} ({\bf SODA}), January 2005, pages 650--659}
}
@ARTICLE{DH08,
AUTHOR = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi},
TITLE = {The Bidimensionality theory and its algorithmic applications},
JOURNAL = {{\em Special issue of} \ Comput. J. \ {\em for selected survey-papers in Fixed-Parameter Tractability}},
VOLUME = {51},
NUMBER = {3},
YEAR = {2008},
PAGES = {292-302},
URL = {http://www-math.mit.edu/~hajiagha/CJ08.pdf},
ABSTRACT = {\textcolor{red}{This paper surveys {\em our} theory of bidimensionality and its known combinatorial and algorithmic results of this theory.}}
}
@ARTICLE{AHKL07,
AUTHOR = {Baruch Awerbuch and
Mohammad Taghi Hajiaghayi and
Robert Kleinberg and
Tom Leighton},
TITLE = {Localized Client-Server Load Balancing without Global Information},
JOURNAL = {SIAM J. Comput.},
VOLUME = {37},
NUMBER = {4},
YEAR = {2007},
PAGES = {1259-1279},
EE = {http://dx.doi.org/10.1137/S009753970444661X},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
URL = {http://www-math.mit.edu/~hajiagha/busmodel8.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms} ({\bf SODA}),January 2005, pages 197--206.
Invitation to {\bf {\em Journal of Scheduling}} {\em special issue for selected papers from SODA 2005} regretfully declined
}
}
@ARTICLE{HIM07,
AUTHOR = {Mohammad Taghi Hajiaghayi and
Nicole Immorlica and
Vahab S. Mirrokni},
TITLE = {Power optimization in fault-tolerant topology control algorithms
for wireless multi-hop networks},
JOURNAL = {IEEE/ACM Trans. Netw.},
VOLUME = {15},
NUMBER = {6},
YEAR = {2007},
PAGES = {1345-1358},
URL = {http://www-math.mit.edu/~hajiagha/kConnJV3.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 9th Annual International Conference on
Mobile Computing and Networking} ({\bf MOBICOM}), September 2003, pages 300--312}
}
@ARTICLE{HKLR07,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kleinberg, Robert D. and
Leighton, Tom and R{\"a}cke, Harald },
TITLE = {Oblivious routing on node-capacitated and directed graphs},
JOURNAL = {ACM Trans. Algorithms},
FJOURNAL = {ACM Transactions on Algorithms},
VOLUME = {3},
YEAR = {2007},
NUMBER = {4},
PAGES = {Art. 51, 13},
ISSN = {1549-6325},
MRCLASS = {68R10 (05C38 05C85 68M10)},
MRNUMBER = {MR2364975 (2009b:68151)},
MRREVIEWER = {Daniela Ferrero},
URL = {http://www-math.mit.edu/~hajiagha/TALG4.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms} ({\bf SODA}), January 2005, pages 782--790.
Invitation to {\bf {\em Journal of Scheduling}} {\em special issue for selected papers from SODA 2005} regretfully declined
}
}
@ARTICLE{MR2306136,
AUTHOR = {Hajiaghayi, Mohammad T. and Kortsarz, Guy and Mirrokni, Vahab
S. and Nutov, Zeev},
TITLE = {Power optimization for connectivity problems},
JOURNAL = {{\em Special issue of} \ Math. Program. \ {\em for selected papers from IPCO 2005}},
FJOURNAL = {Mathematical Programming. A Publication of the Mathematical
Programming Society},
VOLUME = {110},
YEAR = {2007},
NUMBER = {1, Ser. B},
PAGES = {195--208},
ISSN = {0025-5610},
MRCLASS = {90C27 (05C85 68R10 68W25 90C59)},
MRNUMBER = {MR2306136 (2008b:90093)},
MRREVIEWER = {Victor Blanco},
URL = {http://www-math.mit.edu/~hajiagha/ipcofinal.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings the 11th Conference on Integer Programming and Combinatorial Optimization} ({\bf IPCO}), June 2005, pages 349--361}
}
@ARTICLE{BDHM07,
AUTHOR = {Bateni, Mohammad Hossein and Demaine, Erik D. and Hajiaghayi,
Mohammad Taghi and Moharrami, Mohammad},
TITLE = {Plane embeddings of planar graph metrics},
JOURNAL = {Discrete Comput. Geom.},
FJOURNAL = {Discrete \& Computational Geometry. An International Journal
of Mathematics and Computer Science},
VOLUME = {38},
YEAR = {2007},
NUMBER = {3},
PAGES = {615--637},
ISSN = {0179-5376},
CODEN = {DCGEER},
MRCLASS = {05C10 (05C62 51M16 52B55 54E35)},
MRNUMBER = {MR2352711 (2008m:05071)},
MRREVIEWER = {P. A. Biryukov},
URL = {http://www-math.mit.edu/~hajiagha/planarembedding.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 22nd Annual
ACM Symposium on Computational Geometry} ({\bf SOCG}), June 2006, pages 197--206}
}
@ARTICLE{BHJMQS07,
AUTHOR = {Paramvir Bahl and
Mohammad Taghi Hajiaghayi and
Kamal Jain and
Vahab S. Mirrokni and
Lili Qiu and
Amin Saberi},
TITLE = {Cell Breathing in Wireless LANs: Algorithms and Evaluation},
JOURNAL = {IEEE Trans. Mob. Comput.},
VOLUME = {6},
NUMBER = {2},
YEAR = {2007},
PAGES = {164-178},
URL = {http://www-math.mit.edu/~hajiagha/cellbreath.pdf}
}
@ARTICLE{HN07,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Nishimura, Naomi},
TITLE = {Subgraph isomorphism, log-bounded fragmentation, and graphs of
(locally) bounded treewidth},
JOURNAL = {J. Comput. System Sci.},
FJOURNAL = {Journal of Computer and System Sciences},
VOLUME = {73},
YEAR = {2007},
NUMBER = {5},
PAGES = {755--768},
ISSN = {0022-0000},
CODEN = {JCSSBM},
MRCLASS = {68R10 (05C60)},
MRNUMBER = {MR2320379 (2009b:68152)},
URL = {http://www-math.mit.edu/~hajiagha/isomorphj.ps},
NOTE = {A preliminary version appeared in {\em Proceedings of the 27th International Symposium on
Mathematical Foundations of Computer Science} ({\em MFCS}), August 2002, pages 305-318}
}
@ARTICLE{MR2261820,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Quickly deciding minor-closed parameters in general graphs},
JOURNAL = {European J. Combin.},
FJOURNAL = {European Journal of Combinatorics},
VOLUME = {28},
YEAR = {2007},
NUMBER = {1},
PAGES = {311--314},
ISSN = {0195-6698},
MRCLASS = {05C83 (05C85 68Q25 68R10)},
MRNUMBER = {MR2261820 (2007j:05200)},
MRREVIEWER = {Steven D. Noble},
URL = {http://www-math.mit.edu/~hajiagha/general.pdf}
}
@ARTICLE{BDHI06,
AUTHOR = {B{\u{a}}doiu, Mihai and Demaine, Erik D. and Hajiaghayi,
Mohammad Taghi and Indyk, Piotr},
TITLE = {Low-dimensional embedding with extra information},
JOURNAL = {{\em Special issue of} \ Discrete Comput. Geom. \ {\em for selected papers from SOCG 2004}},
FJOURNAL = {Discrete \& Computational Geometry. An International Journal
of Mathematics and Computer Science},
VOLUME = {36},
YEAR = {2006},
NUMBER = {4},
PAGES = {609--632},
ISSN = {0179-5376},
CODEN = {DCGEER},
MRCLASS = {68U05},
MRNUMBER = {MR2267549 (2007h:68191)},
MRREVIEWER = {Reneta P. Barneva},
URL = {http://www-math.mit.edu/~hajiagha/DCG.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 20th ACM Symposium on Computational Geometry} ({\bf SOCG}), June 2004, pages 320--329}
}
@ARTICLE{DHT06,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Thilikos,
Dimitrios M.},
TITLE = {The bidimensional theory of bounded-genus graphs},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {20},
YEAR = {2006},
NUMBER = {2},
PAGES = {357--371},
ISSN = {0895-4801},
MRCLASS = {05C83},
MRNUMBER = {MR2257267 (2007i:05167)},
MRREVIEWER = {Guantao Chen},
URL = {http://www-math.mit.edu/~hajiagha/handle.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 29th International Symposium on Math. Foundations of Computer Science} ({\em MFCS}), 2004, pages 191--203}
}
@ARTICLE{BHM06,
AUTHOR = {Mohsen Bahramgiri and
Mohammad Taghi Hajiaghayi and
Vahab S. Mirrokni},
TITLE = {Fault-Tolerant and 3-Dimensional Distributed Topology Control
Algorithms in Wireless Multi-hop Networks},
JOURNAL = {ACM/Kluwer Wireless Networks},
VOLUME = {12},
NUMBER = {2},
YEAR = {2006},
PAGES = {179-188},
URL = {http://www-math.mit.edu/~hajiagha/mobileJ.ps},
NOTE = {A preliminary version appeared in {\em Proceedings of the 11th IEEE International Conference on Computer Communications and Networks} ({\em ICCCN}), October 2002, pages 392--398}
}
@ARTICLE{MR2207528,
AUTHOR = {Hajiaghayi, M. T. and Leighton, Tom},
TITLE = {On the max-flow min-cut ratio for directed multicommodity
flows},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {352},
YEAR = {2006},
NUMBER = {1-3},
PAGES = {318--321},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {05C85 (05C20 68W25 90C35)},
MRNUMBER = {MR2207528 (2006k:05198)},
MRREVIEWER = {Tam{\'a}s Kis},
URL = {http://www-math.mit.edu/~hajiagha/disjoint8.pdf}
}
@ARTICLE{MR2197694,
AUTHOR = {Hajiaghayi, Mohammad Taghi and R{\"a}cke, Harald},
TITLE = {An {$O(\sqrt{n})$}-approximation algorithm for directed
sparsest cut},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {97},
YEAR = {2006},
NUMBER = {4},
PAGES = {156--160},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {05C85 (68W25 90B10)},
MRNUMBER = {MR2197694 (2006h:05217)},
URL = {http://www-math.mit.edu/~hajiagha/directed4.pdf}
}
@ARTICLE{DFHT05,
AUTHOR = {Demaine, Erik D. and Fomin, Fedor V. and Hajiaghayi,
Mohammad Taghi and Thilikos, Dimitrios M.},
TITLE = {Subexponential parameterized algorithms on bounded-genus
graphs and {$H$}-minor-free graphs},
JOURNAL = {J. ACM},
FJOURNAL = {Journal of the ACM},
VOLUME = {52},
YEAR = {2005},
NUMBER = {6},
PAGES = {866--893},
ISSN = {0004-5411},
MRCLASS = {68R10 (05C10 05C85 68Q25)},
MRNUMBER = {MR2179550 (2006g:68210)},
MRREVIEWER = {Nicholas Paul Sheppard},
URL = {http://www-math.mit.edu/~hajiagha/hminorfreeJ15.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms} ({\bf SODA}), January 2004, pages 830--839}
}
@ARTICLE{DFHT05a,
AUTHOR = {Demaine, Erik D. and Fomin, Fedor V. and Hajiaghayi,
Mohammad Taghi and Thilikos, Dimitrios M.},
TITLE = {Fixed-parameter algorithms for {$(k,r)$}-center in planar
graphs and map graphs},
JOURNAL = {ACM Trans. Algorithms},
FJOURNAL = {ACM Transactions on Algorithms},
VOLUME = {1},
YEAR = {2005},
NUMBER = {1},
PAGES = {33--47},
ISSN = {1549-6325},
MRCLASS = {68Q25 (05C10 05C85)},
MRNUMBER = {MR2163129 (2006f:68038)},
MRREVIEWER = {Stefan Porschen},
NOTE = {A preliminary version appeared in {\em Proceedings of the 30th International Colloquium on Automata, Languages and Programming} ({\bf ICALP}), July 2003, pages 829--844},
URL = {http://www-math.mit.edu/~hajiagha/mapgraphsTALG.pdf}
}
@ARTICLE{MR2122527,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Thilikos,
Dimitrios M.},
TITLE = {Exponential speedup of fixed-parameter algorithms for classes
of graphs excluding single-crossing graphs as minors},
JOURNAL = {Algorithmica},
FJOURNAL = {Algorithmica. An International Journal in Computer Science},
VOLUME = {41},
YEAR = {2005},
NUMBER = {4},
PAGES = {245--267},
ISSN = {0178-4617},
CODEN = {ALGOEJ},
MRCLASS = {68Q25 (05C69 05C85 68R10)},
MRNUMBER = {MR2122527 (2005i:68031)},
MRREVIEWER = {Pinar Heggernes},
URL = {http://www-math.mit.edu/~hajiagha/domsetj.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of the 13th Annual International Symposium on Algorithms and Computation} ({\em ISAAC}), November 2002}
}
@ARTICLE{MR2132060,
AUTHOR = {Biedl, Therese and Chan, Timothy and Ganjali, Yashar and
Hajiaghayi, Mohammad Taghi and Wood, David R.},
TITLE = {Balanced vertex-orderings of graphs},
JOURNAL = {Discrete Appl. Math.},
FJOURNAL = {Discrete Applied Mathematics. The Journal of Combinatorial
Algorithms, Informatics and Computational Sciences},
VOLUME = {148},
YEAR = {2005},
NUMBER = {1},
PAGES = {27--48},
ISSN = {0166-218X},
CODEN = {DAMADU},
MRCLASS = {05C62 (05C85 68Q17 68Q25 68R10)},
MRNUMBER = {MR2132060 (2006g:05134)},
MRREVIEWER = {Hans L. Bodlaender},
URL = {http://www-math.mit.edu/~hajiagha/balanced.pdf}
}
@ARTICLE{DFHT04,
AUTHOR = {Demaine, Erik D. and Fomin, Fedor V. and Hajiaghayi,
Mohammad Taghi and Thilikos, Dimitrios M.},
TITLE = {Bidimensional parameters and local treewidth},
JOURNAL = {SIAM J. Discrete Math.},
FJOURNAL = {SIAM Journal on Discrete Mathematics},
VOLUME = {18},
YEAR = {2004/05},
NUMBER = {3},
PAGES = {501--511},
ISSN = {0895-4801},
MRCLASS = {05C85 (68Q25 68R10)},
MRNUMBER = {MR2134412 (2006c:05128)},
MRREVIEWER = {Hans L. Bodlaender},
URL = {http://www-math.mit.edu/~hajiagha/sidma.pdf},
NOTE = {Preliminary versions appeared in {\em Proceedings of the 6th Latin American Theoretical Informatics} ({\em LATIN}), April 2004, and {\em Proceeding of the 11th Annual European Symposium on Algorithms} ({\em ESA}), September 2003}
}
@ARTICLE{CGHS04,
AUTHOR = {Coppersmith, Don and Gamarnik, David and Hajiaghayi, Mohammad
Taghi and Sorkin, Gregory B.},
TITLE = {Random {MAX} {SAT}, random {MAX} {CUT}, and their phase
transitions},
JOURNAL = {Random Structures Algorithms},
FJOURNAL = {Random Structures \& Algorithms},
VOLUME = {24},
YEAR = {2004},
NUMBER = {4},
PAGES = {502--545},
ISSN = {1042-9832},
MRCLASS = {68Q25 (60C05 68T20 68W40 82B26 82B44)},
MRNUMBER = {MR2060633 (2005c:68088)},
MRREVIEWER = {Brigitte Chauvin},
NOTE = {A preliminary version appeared in {\em Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms} ({\bf SODA}), January 2003, pages 364--373},
URL = {http://www-math.mit.edu/~hajiagha/max.pdf}
}
@ARTICLE{DH04,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Diameter and treewidth in minor-closed graph families,
revisited},
JOURNAL = {Algorithmica},
FJOURNAL = {Algorithmica. An International Journal in Computer Science},
VOLUME = {40},
YEAR = {2004},
NUMBER = {3},
PAGES = {211--215},
ISSN = {0178-4617},
CODEN = {ALGOEJ},
MRCLASS = {05C85 (05C12 68R10)},
MRNUMBER = {MR2080518 (2005b:05205)},
URL = {http://www-math.mit.edu/~hajiagha/diam.pdf}
}
@ARTICLE{DHN+04,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Nishimura,
Naomi and Ragde, Prabhakar and Thilikos, Dimitrios M.},
TITLE = {Approximation algorithms for classes of graphs excluding
single-crossing graphs as minors},
JOURNAL = {J. Comput. System Sci.},
FJOURNAL = {Journal of Computer and System Sciences},
VOLUME = {69},
YEAR = {2004},
NUMBER = {2},
PAGES = {166--195},
ISSN = {0022-0000},
CODEN = {JCSSBM},
MRCLASS = {05C85 (05C69 05C83 68R10 68W25)},
MRNUMBER = {MR2077379 (2005e:05131)},
MRREVIEWER = {Hans L. Bodlaender},
URL = {http://www-math.mit.edu/~hajiagha/minor.ps}
}
@ARTICLE{MR2094244,
AUTHOR = {Ganjali, Yashar and Hajiaghayi, Mohammad Taghi},
TITLE = {Characterization of networks supporting multi-dimensional
linear interval routing schemes},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {326},
YEAR = {2004},
NUMBER = {1-3},
PAGES = {103--116},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68M10 (05C85)},
MRNUMBER = {MR2094244 (2005e:68008)},
URL = {http://www-math.mit.edu/~hajiagha/Multi-dimensional-IRS.pdf}
}
@ARTICLE{MR1981962,
AUTHOR = {Biedl, Therese and Buss, Jonathan F. and Demaine, Erik D. and
Demaine, Martin L. and Hajiaghayi, Mohammad Taghi and
Vina{\v{r}}, Tom{\'a}{\v{s}}},
TITLE = {Palindrome recognition using a multidimensional tape},
JOURNAL = {Theoret. Comput. Sci.},
FJOURNAL = {Theoretical Computer Science},
VOLUME = {302},
YEAR = {2003},
NUMBER = {1-3},
PAGES = {475--480},
ISSN = {0304-3975},
CODEN = {TCSDI},
MRCLASS = {68Q05 (68Q25)},
MRNUMBER = {MR1981962 (2004d:68036)},
URL = {http://www-math.mit.edu/~hajiagha/palindromes.ps}
}
@ARTICLE{MR1991628,
AUTHOR = {Hajiaghayi, M. T. and Mahdian, M. and Mirrokni, V. S.},
TITLE = {The facility location problem with general cost functions},
JOURNAL = {Networks},
FJOURNAL = {Networks. An International Journal},
VOLUME = {42},
YEAR = {2003},
NUMBER = {1},
PAGES = {42--47},
ISSN = {0028-3045},
CODEN = {NTWKAA},
MRCLASS = {90B80 (90C90)},
MRNUMBER = {MR1991628 (2004d:90039)},
URL = {http://www-math.mit.edu/~hajiagha/facility.ps}
}
@ARTICLE{HH03,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Hajiaghayi, Mahdi},
TITLE = {A note on the bounded fragmentation property and its
applications in network reliability},
JOURNAL = {European J. Combin.},
FJOURNAL = {European Journal of Combinatorics},
VOLUME = {24},
YEAR = {2003},
NUMBER = {7},
PAGES = {891--896},
ISSN = {0195-6698},
MRCLASS = {05C40},
MRNUMBER = {MR2009401 (2004g:05087)},
URL = {http://www-math.mit.edu/~hajiagha/bndfrag.pdf},
NOTE = {A preliminary version appeared in {\em Proceedings of Euroconference on Combinatorics, Graph Theory and Applications} ({\em EuroCOMB}), September 2003}
}
@ARTICLE{VBSKYEAJSMKCHHC02,
AUTHOR = {Manuela M. Veloso and
Tucker R. Balch and
Peter Stone and
Hiroaki Kitano and
Fuminori Yamasaki and
Ken Endo and
Minoru Asada and
Mansour Jamzad and
Sayyed Bashir Sadjad and
Vahab S. Mirrokni and
Moslem Kazemi and
Hamid Reza Chitsaz and
Abbas Heydarnoori and
Mohammad Taghi Hajiaghayi and
Ehsan Chiniforooshan},
TITLE = {RoboCup-2001: The Fifth Robotic Soccer World Championships},
JOURNAL = {AI Magazine},
VOLUME = {23},
NUMBER = {1},
YEAR = {2002},
PAGES = {55-68},
URL = {http://www-math.mit.edu/~hajiagha/AIMagazine.pdf}
}
@ARTICLE{GHMM02,
AUTHOR = {Ghodsi, M. and Hajiaghayi, M. T. and Mahdian, M. and Mirrokni,
V. S.},
TITLE = {Length-constrained path-matchings in graphs},
JOURNAL = {Networks},
FJOURNAL = {Networks. An International Journal},
VOLUME = {39},
YEAR = {2002},
NUMBER = {4},
PAGES = {210--215},
ISSN = {0028-3045},
CODEN = {NTWKAA},
MRCLASS = {05C70 (05C85 68R10)},
MRNUMBER = {MR1909800 (2003c:05179)},
URL = {http://www-math.mit.edu/~hajiagha/pmatching.ps}
}
@ARTICLE{MR1904223,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Ganjali, Yashar},
TITLE = {A note on the consecutive ones submatrix problem},
JOURNAL = {Inform. Process. Lett.},
FJOURNAL = {Information Processing Letters},
VOLUME = {83},
YEAR = {2002},
NUMBER = {3},
PAGES = {163--166},
ISSN = {0020-0190},
CODEN = {IFPLAT},
MRCLASS = {15A36 (68R05)},
MRNUMBER = {MR1904223 (2003b:15026)},
URL = {http://www-math.mit.edu/~hajiagha/consec3.ps}
}
@ARTICLE{MR2154495,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Nishimura, Naomi and Ragde,
Prabhakar and Thilikos, Dimitrios M.},
TITLE = {Fast approximation schemes for {$K_{3,3}$}-minor-free or
{$K_5$}-minor-free graphs},
JOURNAL = {Electron. Notes Discrete Math.},
VOLUME = {10},
PAGES = {6 pp.},
PUBLISHER = {Elsevier},
ADDRESS = {Amsterdam},
YEAR = {2001},
MRCLASS = {05C83 (05C85 68W25)},
MRNUMBER = {MR2154495},
NOTE = {A preliminary version appeared in {\em Proceedings of Euroconference on Combinatorics, Graph Theory and Applications} ({\em EuroCOMB}), September 2001, pages 158--163},
URL = {http://www-math.mit.edu/~hajiagha/endm10038.ps}
}
@ARTICLE{MR1750867,
AUTHOR = {Hajiaghaee, M. T. and Mahmoodian, E. S. and Mirrokni, V. S.
and Saberi, A. and Tusserkani, R.},
TITLE = {On the simultaneous edge-coloring conjecture},
JOURNAL = {Discrete Math.},
FJOURNAL = {Discrete Mathematics},
VOLUME = {216},
YEAR = {2000},
NUMBER = {1-3},
PAGES = {267--272},
ISSN = {0012-365X},
CODEN = {DSMHA4},
MRCLASS = {05C15},
MRNUMBER = {MR1750867 (2001a:05059)},
URL = {http://www-math.mit.edu/~hajiagha/simcolor.pdf}
}
@INPROCEEDINGS{CHV11,
AUTHOR = {Rajesh Chitnis and Hajiaghayi, Mohammad Taghi and Vahid Liaghat},
TITLE = {Parameterized complexity of problems in coalitional resource
games},
BOOKTITLE = {Proceedings of the 25nd Association for the Advancement of Artificial Intelligence Conference on Artificial
Intelligence (AAAI)},
YEAR = {2011},
PUBLISHER = {AAAI Press},
LOCATION = {Menlo Park, CA},
URL = {http://www-math.mit.edu/~hajiagha/aaai11.pdf},
NOTE = {To appear}
}
@INPROCEEDINGS{DHK11,
AUTHOR = {Erik Demaine and Hajiaghayi, Mohammad Taghi and Kenichi Kawarabayashi},
TITLE = {Contraction decomposition in $H$-minor-free graphs and its
algorithmic applications},
BOOKTITLE = {Proceedings of the 43rd {A}nnual {ACM} {S}ymposium on {T}heory of {C}omputing (STOC)},
YEAR = {2011},
PUBLISHER = {ACM},
LOCATION = {New York},
PAGES = {441--450},
URL = {http://www-math.mit.edu/~hajiagha/HMinorContraction.pdf}
}
@INPROCEEDINGS{HKKL10,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Rohit Khandekar and Guy Kortsarz and Vahid Liaghat},
TITLE = {On a local protocol for concurrent file transfers},
BOOKTITLE = {Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
YEAR = {2011},
PAGES = {269--278},
PUBLISHER = {ACM},
LOCATION = {New York, NY, USA},
URL = {http://www-math.mit.edu/~hajiagha/filetransfer.pdf}
}
@INCOLLECTION{adcell,
AUTHOR = {Saeed Alaei and Hajiaghayi, Mohammad Taghi and Vahid Liaghat and Dan Pei and Barna Saha},
TITLE = {AdCell: ad allocation in cellular networks},
BOOKTITLE = {Proceedings of the 19th Annual European Symposium on Algorithms (ESA)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2011},
NOTE = {To appear}
}
@INCOLLECTION{sigmetrics,
AUTHOR = {Suk-Bok Lee and Dan Pei and Hajiaghayi, Mohammad Taghi and Ioannis Pefkianakis and Songwu Lu and He Yan and Zihui Ge and Jennifer
Yates and Mario Kosseifi},
TITLE = {Scalable monitoring via threshold compression in a large
operational {3G} network},
BOOKTITLE = {Proceedings of International Conference on Measurement and Modeling of
Computer Systems (SIGMETRICS)},
PAGES = {135--136},
PUBLISHER = {ACM},
LOCATION = {New York, NY, USA},
YEAR = {2011},
URL = {http://www-math.mit.edu/~hajiagha/sigmetrics.pdf}
}
@INCOLLECTION{BHJ11,
AUTHOR = {Bateni, Mohammad Hossein and Hajiaghayi, Mohammad Taghi and Jafarpour, Sina and Dan Pei},
TITLE = {Towards an efficient algorithmic framework for pricing cellular
data service},
BOOKTITLE = {Proceedings of the 30th IEEE International Conference on Computer
Communications (INFOCOM)},
PUBLISHER = {IEEE Computer Society},
LOCATION = {Washington, DC},
YEAR = {2011},
URL = {http://www-math.mit.edu/~hajiagha/pricing.pdf},
PAGES = {581--585}
}
@INCOLLECTION{BDD+10,
AUTHOR = {L. Breslau and I. Diakonikolas and Nick Duffield and Y. Gu and Mohammad Taghi Hajiagahyi and David S. Johnson and Howard Karloff and M.G. C. Resende and Subhabrata Sen},
TITLE = {Disjoint-path facility location: theory and practice},
BOOKTITLE = {Proceedings of the 13th Workshop on Algorithm Engineering and Experiments (ALENEX)},
PUBLISHER = {SIAM},
YEAR = {2011},
URL = {http://www-math.mit.edu/~hajiagha/alenex.pdf},
PAGES = {60--74}
}
@INPROCEEDINGS{AHKM11,
AUTHOR = {Andrews, Matthew and Hajiaghayi, Mohammad Taghi and Karloff, Howard and Moitra, Ankur},
TITLE = {Capacitated metric labeling},
BOOKTITLE = {Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
YEAR = {2011},
LOCATION = {New York},
PUBLISHER = {Society for Industrial and Applied Mathematics},
LOCATION = {Philadelphia, PA},
PAGES = {976--995}
}
@INPROCEEDINGS{BHM11,
AUTHOR = {Bateni, Mohammad Hossein and Chandra Chekuri and Alina Ene and Hajiaghayi, Mohammad Taghi and Nitish Korula and Marx, D\'{a}niel},
TITLE = {Prize-collecting network design on planar graphs},
BOOKTITLE = {Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
YEAR = {2011},
LOCATION = {New York},
PUBLISHER = {Society for Industrial and Applied Mathematics},
LOCATION = {Philadelphia, PA},
URL = {http://www-math.mit.edu/~hajiagha/pcndplanar.pdf},
PAGES = {1028--1049}
}
@INPROCEEDINGS{ADHL10,
AUTHOR = {Alon, Noga and Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Leighton, Tom},
TITLE = {Basic network creation games},
BOOKTITLE = {Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
YEAR = {2010},
PAGES = {106--113},
PUBLISHER = {ACM},
LOCATION = {New York, NY, USA},
URL = {http://www-math.mit.edu/~hajiagha/spaa10.pdf},
NOTE = {Journal version submitted to {\bf SIAM J. Discrete Math}},
ABSTRACT = {\textcolor{red}{Winner of the best paper award in SPAA 2010.}}
}
@INPROCEEDINGS{DHK10,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and
Kawarabayashi, Kenichi},
TITLE = {Decomposition, approximation, and coloring of odd-minor-free graphs},
BOOKTITLE = {Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
YEAR = {2010},
LOCATION = {New York},
PUBLISHER = {Society for Industrial and Applied Mathematics},
LOCATION = {Philadelphia, PA},
URL = {http://www-math.mit.edu/~hajiagha/oddminor.pdf},
PAGES = {329--344}
}
@INCOLLECTION{BHIM10,
AUTHOR = {Mohammad Hossein Bateni and Hajiaghayi, Mohammad Taghi and
Nicole Immorlica and Hamid Mahini},
TITLE = {The cooperative game theory foundations of network bargaining games},
BOOKTITLE = {Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2010},
URL = {http://www-math.mit.edu/~hajiagha/bargain.pdf},
PAGES = {67--78}
}
@INPROCEEDINGS{BHZ10,
AUTHOR = {Bateni, Mohammad Hossein and Hajiaghayi, Mohammad Taghi and
Zadimoghaddam, Morteza},
TITLE = {Submodular secretary problem and extensions},
BOOKTITLE = {Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX)},
YEAR = {2010},
LOCATION = {Berlin},
PUBLISHER = {Springer},
URL = {http://www-math.mit.edu/~hajiagha/submodularsecretary.pdf},
PAGES = {39--52},
NOTE = {Journal version submitted to {\bf ACM Transactions on Algorithms.}}
}
@INPROCEEDINGS{HKKM10,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Khandekar, Rohit and Kortsarz, Guy and Mestre, Julian},
TITLE = {The Checkpoint Problem},
BOOKTITLE = {Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX)},
YEAR = {2010},
LOCATION = {Berlin},
PUBLISHER = {Springer},
URL = {http://www-math.mit.edu/~hajiagha/checkpoint.pdf},
PAGES = {219--231}
}
@INPROCEEDINGS{HN10,
AUTHOR = { Hajiaghayi, Mohammad Taghi and
Nasri, Arefeh A.},
TITLE = {Prize-collecting Steiner networks via iterative rounding},
BOOKTITLE = {Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN)},
YEAR = {2010},
PAGES = {515-526},
PUBLISHER = {Springer},
LOCATION = {Berlin},
URL = {http://www-math.mit.edu/~hajiagha/pcsn.pdf}
}
@INPROCEEDINGS{wine09,
AUTHOR = {Mangesh Gupte and M.T. Hajiaghayi and Lu Han and Liviu Iftode and Pravin Shankar and
Raluca Ursu },
TITLE = {News posting by stragetic users in a social network},
BOOKTITLE = {Proceedings of the 5th International Workshop on Internet and Network Economics (WINE)},
YEAR = {2009},
PAGES = {632--639},
LOCATION = {Berlin},
PUBLISHER = {Springer},
URL = {http://www-math.mit.edu/~hajiagha/wine09.pdf}
}
@INPROCEEDINGS{1496896,
AUTHOR = {Kawarabayashi, Kenichi and Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Additive approximation algorithms for list-coloring minor-closed class of graphs},
BOOKTITLE = {Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
YEAR = {2009},
PAGES = {1166--1175},
LOCATION = {New York},
PUBLISHER = {Society for Industrial and Applied Mathematics},
LOCATION = {Philadelphia, PA},
URL = {http://www-math.mit.edu/~hajiagha/listcoloring.pdf}
}
@INPROCEEDINGS{EGH+09,
AUTHOR = {Jeffrey Erman and Alexandre Gerber and Mohammad Taghi Hajiaghayi and Dan Pei and Oliver Spatscheck},
BOOKTITLE = {Proceedings of the 18th International Conference on World Wide Web (WWW)},
PAGES = {291-300},
PUBLISHER = {ACM},
TITLE = {Network-aware forward caching},
YEAR = {2009},
LOCATION = {New York},
ISBN = {978-1-60558-487-4},
URL = {http://www-math.mit.edu/~hajiagha/NetworkAware.pdf}
}
@INCOLLECTION{DHK09a,
AUTHOR = {Erik D. Demaine and Hajiaghayi, Mohammad Taghi and Philip Klein},
TITLE = {Node-weighted {S}teiner tree and group {S}teiner tree in planar graphs},
BOOKTITLE = {Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2009},
URL = {http://www-math.mit.edu/~hajiagha/NodePlanarSteiner.pdf},
PAGES = {328-340}
}
@INCOLLECTION{DHK09b,
AUTHOR = {Erik D. Demaine and Hajiaghayi, Mohammad Taghi and Kenichi Kawarabayashi},
TITLE = {Node-weighted Steiner tree and group Steiner tree in planar graphs},
BOOKTITLE = {Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2009},
URL = {http://www-math.mit.edu/~hajiagha/ApexFreeKen.pdf},
PAGES = {316-327}
}
@INCOLLECTION{DHM09,
AUTHOR = {Erik D. Demaine and Hajiaghayi, Mohammad Taghi and Daniel Marx},
TITLE = {Minimizing movement: fixed-parameter tractability},
BOOKTITLE = {Proceedings of the 17th Annual European Symposium on Algorithms (ESA)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2009},
URL = {http://www-math.mit.edu/~hajiagha/FPTMovement.pdf},
PAGES = {718-729},
NOTE = {Journal version submitted to {\bf ACM Tranactions on Algortithms}. Invitation to {\bf {\em Algorithmica}} {\em special issue for selected papers from ESA 2009} regretfully declined
}
}
@INPROCEEDINGS{BHLR08,
AUTHOR = {Blum, Avrim and Hajiaghayi, Mohammad Taghi and Ligett, Katrina and Roth, Aaron},
TITLE = {Regret minimization and the price of total anarchy},
BOOKTITLE = {Proceedings of the 40th {A}nnual {ACM} {S}ymposium on {T}heory of {C}omputing (STOC)},
YEAR = {2008},
ISBN = {978-1-60558-047-0},
PAGES = {373--382},
PUBLISHER = {ACM},
LOCATION = {New York},
URL = {http://www-math.mit.edu/~hajiagha/regretprice.pdf}
}
@INPROCEEDINGS{BDH+08,
AUTHOR = {Mihai Badoiu and
Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Anastasios Sidiropoulos and
Morteza Zadimoghaddam},
TITLE = {Ordinal embedding: approximation algorithms and dimensionality
reduction},
YEAR = {2008},
PAGES = {21-34},
BOOKTITLE = {Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX)},
LOCATION = {Berlin},
PUBLISHER = {Springer},
URL = {http://www-math.mit.edu/~hajiagha/OrdinalApprox.pdf}
}
@INPROCEEDINGS{HKS07,
AUTHOR = {Mohammad Taghi Hajiaghayi and
Robert D. Kleinberg and
Tuomas Sandholm},
TITLE = {Automated online mechanism design and prophet inequalities},
BOOKTITLE = {Proceedings of the 22nd Association for the Advancement of Artificial Intelligence Conference on Artificial
Intelligence (AAAI)},
YEAR = {2007},
PAGES = {58-65},
PUBLISHER = {AAAI Press},
LOCATION = {Menlo Park, CA},
ISBN = {978-1-57735-323-2},
URL = {http://www-math.mit.edu/~hajiagha/aaai07.pdf}
}
@INPROCEEDINGS{1248385,
AUTHOR = {Demaine, Erik D. and Ghodsi, Mohammad and Hajiaghayi, Mohammad Taghi and Sayedi-Roshkhar, Amin S. and Zadimoghaddam, Morteza},
TITLE = {Scheduling to minimize gaps and power consumption},
BOOKTITLE = {Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
YEAR = {2007},
ISBN = {978-1-59593-667-7},
PAGES = {46--54},
PUBLISHER = {ACM},
LOCATION = {New York},
URL = {http://www-math.mit.edu/~hajiagha/scheduling.pdf},
NOTE = {Journal version submitted to {\bf Journal of Scheduling}}
}
@INPROCEEDINGS{CHKS07,
AUTHOR = {Chekuri, C. and Hajiaghayi, M. T. and Kortsarz, G. and
Salavatipour, M. R.},
TITLE = {Approximation algorithms for node-weighted buy-at-bulk network
design},
BOOKTITLE = {Proceedings of the 18th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms ({SODA})},
PAGES = {1265--1274},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2007},
MRCLASS = {90B10 (05C85 68W25)},
MRNUMBER = {MR2485279},
URL = {http://www-math.mit.edu/~hajiagha/rentorbuyvertex.pdf}
}
@INPROCEEDINGS{MR2482923,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kleinberg, Robert and Leighton,
Tom},
TITLE = {Semi-oblivious routing: lower bounds},
BOOKTITLE = {Proceedings of the 18th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms ({SODA})},
PAGES = {929--938},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2007},
MRCLASS = {68W05 (68R10 90B18 90B20 90C35)},
MRNUMBER = {MR2482923},
URL = {http://www-math.mit.edu/~hajiagha/semi-oblivious.pdf},
NOTE = {A brief announcement of this paper appeared in {\bf Proceedings of
18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, pages 234-235}
}
@INPROCEEDINGS{GHK07,
AUTHOR = {Anupam Gupta and
Mohammad Taghi Hajiaghayi and
Amit Kumar},
TITLE = {Stochastic Steiner tree with non-uniform inflation},
BOOKTITLE = {Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX)},
YEAR = {2007},
PAGES = {134-148},
LOCATION = {Berlin},
PUBLISHER = {Springer},
URL = {http://www-math.mit.edu/~hajiagha/approx-submit.pdf}
}
@INPROCEEDINGS{BBCH07,
AUTHOR = {Maria-Florina Balcan and
Avrim Blum and
Hubert Chan and
Mohammad Taghi Hajiaghayi},
TITLE = {A theory of loss-seaders: making money by pricing below
cost},
BOOKTITLE = {Proceedings of the 3rd International Workshop on Internet and Network Economics (WINE)},
YEAR = {2007},
PAGES = {293-299},
LOCATION = {Berlin},
PUBLISHER = {Springer},
ISBN = {978-3-540-77104-3},
URL = {http://www.cs.cmu.edu/~ninamf/papers/below-cost-tr.pdf}
}
@INPROCEEDINGS{HJ06,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Jain, Kamal},
TITLE = {The prize-collecting generalized {S}teiner tree problem via a
new approach of primal-dual schema},
BOOKTITLE = {Proceedings of the 17th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms (SODA)},
PAGES = {631--640},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2006},
MRCLASS = {90C35 (05C05)},
MRNUMBER = {MR2373853},
URL = {http://www-math.mit.edu/~hajiagha/SODAforest1.pdf}
}
@INPROCEEDINGS{MR2373824,
AUTHOR = {Gupta, Anupam and Hajiaghayi, Mohammad T. and R{\"a}cke,
Harald},
TITLE = {Oblivious network design},
BOOKTITLE = {Proceedings of the 17th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms (SODA)},
PAGES = {970--979},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2006},
MRCLASS = {68M10 (68R10)},
MRNUMBER = {MR2373824},
URL = {http://www-math.mit.edu/~hajiagha/oblivious_network_design.pdf}
}
@INPROCEEDINGS{MR2373818,
AUTHOR = {Hajiaghayi, Mohammad T. and Kleinberg, Robert D. and Leighton,
Tom and R{\"a}cke, Harald},
TITLE = {New lower bounds for oblivious routing in undirected graphs},
BOOKTITLE = {Proceedings of the 17th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms (SODA)},
PAGES = {918--927},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2006},
MRCLASS = {68R10 (05C85 68M10)},
MRNUMBER = {MR2373818},
URL = {http://www-math.mit.edu/~hajiagha/oblivious_lowerbound1.pdf}
}
@INPROCEEDINGS{MR2368861,
AUTHOR = {Hajiaghayi, Mohammad T. and Kleinberg, Robert and Leighton,
Tom},
TITLE = {Improved lower and upper bounds for universal {TSP} in planar
metrics},
BOOKTITLE = {Proceedings of the 17th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms (SODA)},
PAGES = {649--658},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2006},
MRCLASS = {68Q25 (05C85 54E35)},
MRNUMBER = {MR2368861},
URL = {http://www-math.mit.edu/~hajiagha/UTSP.pdf}
}
@INPROCEEDINGS{HLMT06,
AUTHOR = {Mohammad Taghi Hajiaghayi and
Li Li and
Vahab S. Mirrokni and
Marina Thottan},
TITLE = {Bandwidth sharing network design for multi-class traffic},
BOOKTITLE = {Proceedings of the 25th IEEE International Conference on Computer
Communications (INFOCOM)},
PUBLISHER = {IEEE Computer Society},
LOCATION = {Washington, DC},
YEAR = {2006},
URL = {http://www-math.mit.edu/~hajiagha/flowQ.pdf}
}
@INPROCEEDINGS{HJLMRV06,
AUTHOR = {Mohammad Taghi Hajiaghayi and
Kamal Jain and
Lap Chi Lau and
Ion I. Mandoiu and
Alexander Russell and
Vijay V. Vazirani},
TITLE = {Minimum multicolored subgraph problem in multiplex PCR primer
set selection and population haplotyping},
BOOKTITLE = {Proceedings of International Workshop on Bioinformatics Research and Applications (IWBRA)},
YEAR = {2006},
PAGES = {758-766},
LOCATION = {Berlin},
PUBLISHER = {Springer},
ISBN = {3-540-34381-4},
URL = {http://www-math.mit.edu/~hajiagha/draft03.pdf}
}
@INPROCEEDINGS{DHK05,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Kawarabayashi, Kenichi},
TITLE = {Algorithmic graph minor theory: decomposition, approximation, and coloring},
BOOKTITLE = {Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
YEAR = {2005},
ISBN = {0-7695-2468-0},
PAGES = {637--646},
PUBLISHER = {IEEE Computer Society},
LOCATION = {Washington, DC},
URL = {http://www-math.mit.edu/~hajiagha/graphminoralgorithm.pdf}
}
@INCOLLECTION{HKLR05,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kim, Jeong Han and Leighton,
Tom and R{\"a}cke, Harald},
TITLE = {Oblivious routing in directed graphs with random demands},
BOOKTITLE = {{P}roceedings of the 37th {A}nnual {ACM}
{S}ymposium on {T}heory of {C}omputing (STOC)},
PAGES = {193--201},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2005},
MRCLASS = {68R10 (05C20 68M12)},
MRNUMBER = {MR2181617 (2006g:68214)},
URL = {http://www-math.mit.edu/~hajiagha/probobl_final.pdf}
}
@INPROCEEDINGS{DH05,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Bidimensionality: new connections between {FPT} algorithms and
{PTAS}s},
BOOKTITLE = {Proceedings of the 16th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms (SODA)},
PAGES = {590--601},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2005},
MRCLASS = {68Q25 (05C85 68W25)},
MRNUMBER = {MR2298309},
URL = {http://www-math.mit.edu/~hajiagha/approx4.pdf}
}
@INPROCEEDINGS{HKMP05,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kleinberg, Robert and Mahdian, Mohammad and Parkes, David C.},
TITLE = {Online auctions with re-usable goods},
BOOKTITLE = {Proceedings of the 6th ACM Conference on Electronic Commerce (EC)},
YEAR = {2005},
ISBN = {1-59593-049-3},
PAGES = {165--174},
PUBLISHER = {ACM},
LOCATION = {New York},
URL = {http://www-math.mit.edu/~hajiagha/f188-hajiaghayi.pdf}
}
@INCOLLECTION{MR2184684,
AUTHOR = {Jain, Kamal and Hajiaghayi, Mohammad Taghi and Talwar, Kunal},
TITLE = {The generalized deadlock resolution problem},
BOOKTITLE = {Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)},
PAGES = {853--865},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2005},
MRCLASS = {68Q17 (68P15 68W25 90C35)},
MRNUMBER = {MR2184684 (2006g:68093)},
URL = {http://www-math.mit.edu/~hajiagha/deadlock8.pdf},
NOTE = {Journal version invited to {\bf Theoretical Computer Science} {\em special issue} for selected papers from ICALP 2005 though regretfully declined}
}
@INPROCEEDINGS{DH04a,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi},
TITLE = {Equivalence of local treewidth and linear local treewidth and
its algorithmic applications},
BOOKTITLE = {Proceedings of the 15th {A}nnual {ACM}-{SIAM}
{S}ymposium on {D}iscrete {A}lgorithms (SODA)},
PAGES = {840--849},
PUBLISHER = {ACM},
LOCATION = {New York},
YEAR = {2004},
MRCLASS = {68R10 (05C85 68Q25)},
MRNUMBER = {MR2290974},
URL = {http://www-math.mit.edu/~hajiagha/apexfree-soda2.ps},
NOTE = {See Tech. Report MIT-LCS-TR-903 \textcolor{blue}{\url{http://www.lcs.mit.edu/publications/specpub.php?id=1686}} for a more complete version}
}
@INPROCEEDINGS{HKP04,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Kleinberg, Robert and Parkes, David C.},
TITLE = {Adaptive limited-supply online auctions},
BOOKTITLE = {Proceedings of the 5th ACM Conference on Electronic Commerce (EC)},
YEAR = {2004},
ISBN = {1-58113-711-0},
PAGES = {71--80},
PUBLISHER = {ACM},
LOCATION = {New York},
URL = {http://www-math.mit.edu/~hajiagha/online26.ps}
}
@INPROCEEDINGS{DH04,
AUTHOR = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi},
TITLE = {The Bidimensionality theory and its algorithmic applications},
BOOKTITLE = {Proceedings of the 12th International Symposium on Graph Drawing (GD)},
YEAR = {2004},
PAGES = {517--533},
PUBLISHER = {Springer},
LOCATION = {Berlin},
URL = {http://www-math.mit.edu/~hajiagha/GD04.pdf},
ABSTRACT = { \textcolor{red}{This was an {\em invited talk} at {\bf GD'04}. See the slides at} \textcolor{blue}
{\url{http://www-math.mit.edu/~hajiagha/bidimensionality4.pdf}} \textcolor{red}{or} \textcolor{blue}
{\url{http://www-math.mit.edu/~hajiagha/bidimensionality4.ppt}}}
}
@INPROCEEDINGS{HS01,
AUTHOR = {Mohammad Taghi Hajiaghayi and
Gregory B. Sorkin},
TITLE = {The Satisfiability Threshold of Random 3-SAT Is at Least 3.52},
BOOKTITLE = {arXiv:math.CO/0310193 v2 22 Oct 2003},
YEAR = {2003},
NOTE = {See also IBM Research Report RC22942\textcolor{blue}{\url{http://arxiv.org/pdf/math.CO/0310193, 2003}}},
URL = {http://www-math.mit.edu/~hajiagha/3satRC1.ps}
}
@INCOLLECTION{MR2091577,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, Mohammad Taghi and Thilikos,
Dimitrios M.},
TITLE = {1.5-approximation for treewidth of graphs excluding a graph
with one crossing as a minor},
BOOKTITLE = {Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX)},
PAGES = {67--80},
LOCATION = {Berlin},
PUBLISHER = {Springer},
YEAR = {2002},
MRCLASS = {68R10 (05C85 68W25)},
MRNUMBER = {MR2091577},
URL = {http://www-math.mit.edu/~hajiagha/single.ps}
}
@INPROCEEDINGS{HJ01,
AUTHOR = {Mohammad Taghi Hajiaghayi and
Mansour Jamzad},
TITLE = {Simple, fast, and robust self-localization in environments similar to the robocup environment},
BOOKTITLE = {Proceedings of the 18th International Conference on CAD/CAM, Robotics and Factories of the Future (CARS&FOF)},
YEAR = {2002},
PAGES = {513-522},
LOCATION = {Porto,Portugal},
URL = {http://www-math.mit.edu/~hajiagha/cars-fof.pdf}
}
@INPROCEEDINGS{JSMKCHHC01,
AUTHOR = {Mansour Jamzad and
Sayyed Bashir Sadjad and
Vahab S. Mirrokni and
Moslem Kazemi and
Hamid Reza Chitsaz and
Abbas Heydarnoori and
Mohammad Taghi Hajiaghayi and
Ehsan Chiniforooshan},
TITLE = {A fast vision system for middle size robots in RoboCup},
BOOKTITLE = {RoboCup 2001 International Symposium},
YEAR = {2001},
PAGES = {71-80},
LOCATION = {Berlin},
PUBLISHER = {Springer},
ISBN = {3-540-43912-9},
URL = {http://www-math.mit.edu/~hajiagha/vision9.ps},
ABSTRACT = {\textcolor{red}{Winner of the Best Engineering Challenge Paper Award in RoboCup 2001.}}
}
@INPROCEEDINGS{JFAMGNKCMMGG00,
AUTHOR = {Mansour Jamzad and
Amirali Foroughnassiraei and
Mohammad Taghi Hajiaghayi and
Vahab S. Mirrokni and
Reza Ghorbani and
Abbas Heydarnoori and
Moslem Kazemi and
Hamid Reza Chitsaz and
Farid Mobasser and
Mohsen Ebrahimi Moghaddam and
M. Gudarzi and
N. Ghaffarzadegan},
TITLE = {A goal keeper for middle size RoboCup},
BOOKTITLE = {RoboCup 2000: Robot Soccer World Cup IV},
YEAR = {2000},
PAGES = {583-586},
LOCATION = {Berlin},
PUBLISHER = {Springer},
ISBN = {3-540-42185-8},
URL = {http://www-math.mit.edu/~hajiagha/goalkeeper.pdf}
}
@UNPUBLISHED{BHKM10,
AUTHOR = {Bateni, Mohammad Hossein and Hajiaghayi, Mohammad Taghi and Klein, Philip N. and Mathieu, Claire},
TITLE = {A Polynomial-time approximation scheme for planar multiway cut},
YEAR = {2011},
NOTE = {Submitted}
}
@UNPUBLISHED{cloud,
AUTHOR = {Chuanxiong Guo and Hajiaghayi, Mohammad Taghi and Dan Li and Li Li and Vahid Liaghat and Hongze Srzhz and Haiwei
Xue and Y.R. Yang and Jiangwei Yu},
TITLE = {Rapid network application deployment satisfying application-wide,
in-network policies},
YEAR = {2011},
NOTE = {Submitted}
}
@UNPUBLISHED{AHL11,
AUTHOR = {Saeed Alaei and Hajiaghayi, Mohammad Taghi and Vahid Liaghat},
TITLE = {Generalized online matching in Prophet-inequality setting with applications to ad allocation},
YEAR = {2011},
NOTE = {Submitted}
}
@UNPUBLISHED{CHM11,
AUTHOR = {Rajesh Chitnis and Hajiaghayi, Mohammad Taghi and Daniel Marx},
TITLE = {Fixed-parameter tractability of directed multiway cut
parameterized by the size of the cutset},
YEAR = {2011},
NOTE = {Submitted}
}
@UNPUBLISHED{HKKN11,
AUTHOR = {Hajiaghayi, Mohammad Taghi and Rohit Khandekar and Guy Kortsarz and and Zeev Nutov},
TITLE = {Combinatorial algorithms for capacitated network design
problems},
YEAR = {2011},
NOTE = {Submitted}
}
@UNPUBLISHED{CHKM11,
AUTHOR = {Rajesh Chitnis and Hajiaghayi, Mohammad Taghi and Jonathan Katz and Koyel Mukherjee},
TITLE = {Game-theoretic model for the {DARPA} network challenge},
YEAR = {2011},
NOTE = {Submitted}
}
@PHDTHESIS{Hajiaghayi05,
AUTHOR = {Hajiaghayi, Mohammad Taghi},
TITLE = {The bidimensionality theory and its algorithmic applications},
SCHOOL = {Department of Mathematics, Massachusetts Institute of Technology},
ADDRESS = {Cambridge, MA, U.S.A},
YEAR = {2005},
MONTH = {May},
URL = {http://www-math.mit.edu/~hajiagha/PHDThesis.pdf}
}
@MASTERSTHESIS{Hajiaghayi01,
AUTHOR = {Hajiaghayi, Mohammad Taghi},
TITLE = {Algorithms for graphs of (locally) bounded treewidth},
SCHOOL = {Department of Computer Science, University of Waterloo},
ADDRESS = {Waterloo, ON, Canada},
YEAR = {2001},
MONTH = {September},
NOTE = {Content of the thesis appeared in Journal papers~\cite{HH03}, \cite{DHN+04}, \cite{HN07}},
URL = {http://www-math.mit.edu/~hajiagha/thesis.pdf}
}
@BACHELORSTHESIS{Hajiaghayi00,
AUTHOR = {Hajiaghayi, Mohammad Taghi},
TITLE = {Multicasting and pseudomatching (in Persian)},
SCHOOL = {Department of Computer Engineering, Sharif University of Technology},
ADDRESS = {Tehran, Iran},
YEAR = {2000},
MONTH = {September},
NOTE = {Content of the thesis appeared in Journal paper~\cite{GHMM02}},
URL = {http://www-math.mit.edu/~hajiagha/PROJECT.PS}
}
@INCOLLECTION{DBLP:reference/algo/DemaineH08,
AUTHOR = {Erik D. Demaine and
MohammadTaghi Hajiaghayi},
TITLE = {Approximation Schemes for Planar Graph Problems},
BOOKTITLE = {Ming-Yang Kao (Ed.): Encyclopedia of
Algorithms},
PUBLISHER = {Springer},
LOCATION = {Berlin},
YEAR = {2008},
PAGES = {59-62},
URL = {http://dx.doi.org/10.1007/978-0-387-30162-4_32}
}
@INCOLLECTION{DBLP:reference/algo/DemaineH08a,
AUTHOR = {Erik D. Demaine and
MohammadTaghi Hajiaghayi},
TITLE = {Bidimensionality},
BOOKTITLE = {Ming-Yang Kao (Ed.): Encyclopedia of Algorithms},
PUBLISHER = {Springer},
LOCATION = {Berlin},
YEAR = {2008},
PAGES = {88-90},
URL = {http://dx.doi.org/10.1007/978-0-387-30162-4_47}
}
@BOOK{AHM00,
EDITOR = {Yaser Ahmadi and Mohammad Taghi Hajiaghayi and Vahab Mirrokni},
TITLE = {Iranian Informatics Olympiad},
PUBLISHER = {Young Scholars Club Pub. Co.},
YEAR = {2000},
MONTH = {September}
}
@UNPUBLISHED{H01c,
AUTHOR = {Mohammad Taghi Hajiaghayi},
TITLE = {Comparing of SGML documents},
MONTH = {April},
YEAR = {2001},
URL = {http://www-math.mit.edu/~hajiagha/treecor1.pdf}
}
@UNPUBLISHED{H00,
AUTHOR = {Mohammad Taghi Hajiaghayi},
TITLE = {Consecutive Ones Property},
MONTH = {December},
YEAR = {2000},
URL = {http://www-math.mit.edu/~hajiagha/pp11.ps}
}
@UNPUBLISHED{H01b,
AUTHOR = {Mohammad Taghi Hajiaghayi},
TITLE = {Clustering algorithms in PBS},
MONTH = {April},
YEAR = {2001},
URL = {http://www-math.mit.edu/~hajiagha/cluster1.pdf}
}
@UNPUBLISHED{H01a,
AUTHOR = {Mohammad Taghi Hajiaghayi},
TITLE = {Mathematical Markup Language},
MONTH = {February},
YEAR = {2001},
URL = {http://www-math.mit.edu/~hajiagha/mathml1.zip}
}
This file has been generated by bibtex2html 1.79