2013
69A Greedy Approximation Algorithm for Minimum-Gap Scheduling. Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor. CIAC 2013, 97-109. Web SearchBibTeXDownload
2012
68The price of anarchy in network creation games. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. ACM Transactions on Algorithms (8): 13 (2012). Web SearchBibTeXDownload
2011
67Disjoint-Path Facility Location: Theory and Practice. Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen. ALENEX 2011, 60-74. Web SearchBibTeXDownload
66AdCell: Ad Allocation in Cellular Networks. Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha. ESA 2011, 311-322. Web SearchBibTeXDownload
65To Cache or Not to Cache: The 3G Case. Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Subhabrata Sen, Oliver Spatscheck. IEEE Internet Computing (15): 27-34 (2011). Web SearchBibTeXDownload
64Capacitated Metric Labeling. Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra. SODA 2011, 976-995. Web SearchBibTeXDownload
63Prize-collecting Steiner Problems on Planar Graphs. MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx. SODA 2011, 1028-1049. Web SearchBibTeXDownload
2010
62l22 Spreading Metrics for Vertex Ordering Problems. Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. Algorithmica (56): 577-604 (2010). Web SearchBibTeXDownload
61Deploying sensor networks with guaranteed fault tolerance. Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus. IEEE/ACM Trans. Netw. (18): 216-228 (2010). Web SearchBibTeXDownload
60Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. SIAM J. Comput. (39): 1772-1798 (2010). Web SearchBibTeXDownload
2009
59Minimizing movement. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam. ACM Transactions on Algorithms (5) (2009). Web SearchBibTeXDownload
58The Price of Anarchy in Cooperative Network Creation Games. Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. CoRR (abs/0902.1400) (2009). Web SearchBibTeXDownload
57Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff. FOCS 2009, 427-436. Web SearchBibTeXDownload
56The price of anarchy in cooperative network creation games. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. SIGecom Exchanges (8): 2 (2009). Web SearchBibTeXDownload
55Scheduling to minimize staleness and stretch in real-time data warehouses. MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff. SPAA 2009, 29-38. Web SearchBibTeXDownload
54Network-aware forward caching. Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Oliver Spatscheck. WWW 2009, 291-300. Web SearchBibTeXDownload
2008
53Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
2007
52Quickly deciding minor-closed parameters in general graphs. Erik D. Demaine, Mohammad Taghi Hajiaghayi. Eur. J. Comb. (28): 311-314 (2007). Web SearchBibTeXDownload
51Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni. IEEE/ACM Trans. Netw. (15): 1345-1358 (2007). Web SearchBibTeXDownload
50Cell Breathing in Wireless LANs: Algorithms and Evaluation. Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi. IEEE Trans. Mob. Comput. (6): 164-178 (2007). Web SearchBibTeXDownload
49Power optimization for connectivity problems. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov. Math. Program. (110): 195-208 (2007). Web SearchBibTeXDownload
48Localized Client-Server Load Balancing without Global Information. Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton. SIAM J. Comput. (37): 1259-1279 (2007). Web SearchBibTeXDownload
47Approximation algorithms for node-weighted buy-at-bulk network design. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. SODA 2007, 1265-1274. Web SearchBibTeXDownload
46Approximation algorithms via contraction decomposition. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. SODA 2007, 278-287. Web SearchBibTeXDownload
45Semi-oblivious routing: lower bounds. Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton. SODA 2007, 929-938. Web SearchBibTeXDownload
44Minimizing movement. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam. SODA 2007, 258-267. Web SearchBibTeXDownload
43Scheduling to minimize gaps and power consumption. Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam. SPAA 2007, 46-54. Web SearchBibTeXDownload
2006
42Low-Dimensional Embedding with Extra Information. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk. Discrete & Computational Geometry (36): 609-632 (2006). Cited by 27Web SearchBibTeXDownload
41Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. FOCS 2006, 677-686. Web SearchBibTeXDownload
40Bandwidth Sharing Network Design for Multi-Class Traffic. Mohammad Taghi Hajiaghayi, Li Li, Vahab S. Mirrokni, Marina Thottan. INFOCOM 2006. Web SearchBibTeXDownload
39Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi. ISAAC 2006, 3-15. Web SearchBibTeXDownload
38Combination can be hard: approximability of the unique coverage problem. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour. SODA 2006, 162-171. Web SearchBibTeXDownload
37Improved lower and upper bounds for universal TSP in planar metrics. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton. SODA 2006, 649-658. Web SearchBibTeXDownload
36New lower bounds for oblivious routing in undirected graphs. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke. SODA 2006, 918-927. Web SearchBibTeXDownload
35l22 spreading metrics for vertex ordering problems. Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. SODA 2006, 1018-1027. Web SearchBibTeXDownload
34Plane embeddings of planar graph metrics. MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami. Symposium on Computational Geometry 2006, 197-206. Web SearchBibTeXDownload
33Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni. Wireless Networks (12): 179-188 (2006). Web SearchBibTeXDownload
2005
32Online auctions with re-usable goods. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes. ACM Conference on Electronic Commerce 2005, 165-174. Web SearchBibTeXDownload
31Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. ACM Transactions on Algorithms (1): 33-47 (2005). Web SearchBibTeXDownload
30Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. Algorithmica (41): 245-267 (2005). Web SearchBibTeXDownload
29Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi. FOCS 2005, 637-646. Web SearchBibTeXDownload
28The Generalized Deadlock Resolution Problem. Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar. ICALP 2005, 853-865. Web SearchBibTeXDownload
27Power Optimization for Connectivity Problems. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov. IPCO 2005, 349-361. Web SearchBibTeXDownload
26Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. J. ACM (52): 866-893 (2005). Web SearchBibTeXDownload
25Deploying sensor networks with guaranteed capacity and fault tolerance. Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus. MobiHoc 2005, 309-319. Cited by 59Web SearchBibTeXDownload
24Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. SODA 2005, 650-659. Web SearchBibTeXDownload
23Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. Erik D. Demaine, Mohammad Taghi Hajiaghayi. SODA 2005, 682-689. Web SearchBibTeXDownload
22Bidimensionality: new connections between FPT algorithms and PTASs. Erik D. Demaine, Mohammad Taghi Hajiaghayi. SODA 2005, 590-601. Web SearchBibTeXDownload
2004
21Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Erik D. Demaine, Mohammad Taghi Hajiaghayi. Algorithmica (40): 211-215 (2004). Web SearchBibTeXDownload
20Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Erik D. Demaine, Mohammad Taghi Hajiaghayi. Graph Drawing 2004, 517-533. Web SearchBibTeXDownload
19Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. J. Comput. Syst. Sci. (69): 166-195 (2004). Web SearchBibTeXDownload
18Bidimensional Parameters and Local Treewidth. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. LATIN (18): 501-511 (2004). Web SearchBibTeXDownload
17The Bidimensional Theory of Bounded-Genus Graphs. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos. MFCS 2004, 191-203. Web SearchBibTeXDownload
16Equivalence of local treewidth and linear local treewidth and its algorithmic applications. Erik D. Demaine, Mohammad Taghi Hajiaghayi. SODA 2004, 840-849. Web SearchBibTeXDownload
15Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. SODA 2004, 830-839. Web SearchBibTeXDownload
14Low-dimensional embedding with extra information. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk. Symposium on Computational Geometry 2004, 320-329. Web SearchBibTeXDownload
2003
13Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. ICALP 2003, 829-844. Web SearchBibTeXDownload
12Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni. MOBICOM 2003, 300-312. Web SearchBibTeXDownload
11The facility location problem with general cost functions. Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni. Networks (42): 42-47 (2003). Web SearchBibTeXDownload
10Palindrome recognition using a multidimensional tape. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar. Theor. Comput. Sci. (302): 475-480 (2003). Web SearchBibTeXDownload
2002
9RoboCup-2001: The Fifth Robotic Soccer World Championships. Manuela M. Veloso, Tucker R. Balch, Peter Stone, Hiroaki Kitano, Fuminori Yamasaki, Ken Endo, Minoru Asada, Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan. AI Magazine (23): 55-68 (2002). Web SearchBibTeXDownload
8-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. APPROX 2002, 67-80. Web SearchBibTeXDownload
7Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. ISAAC 2002, 262-273. Web SearchBibTeXDownload
6Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. Mohammad Taghi Hajiaghayi, Naomi Nishimura. MFCS 2002, 305-318. Web SearchBibTeXDownload
5Length-constrained path-matchings in graphs. Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni. Networks (39): 210-215 (2002). Web SearchBibTeXDownload
2001
4Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. Electronic Notes in Discrete Mathematics (10): 137-142 (2001). Web SearchBibTeXDownload
3A Fast Vision System for Middle Size Robots in RoboCup. Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan. RoboCup 2001, 71-80. Web SearchBibTeXDownload
2000
2On the simultaneous edge-coloring conjecture. Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani. Discrete Mathematics (216): 267-272 (2000). Web SearchBibTeXDownload
1A Goal Keeper for Middle Size RoboCup. Mansour Jamzad, Amirali Foroughnassiraei, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni, Reza Ghorbani, Abbas Heydarnoori, Moslem Kazemi, Hamid Reza Chitsaz, Farid Mobasser, Mohsen Ebrahimi Moghaddam, M. Gudarzi, N. Ghaffarzadegan. RoboCup 2000, 583-586. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research