MohammadTaghi Hajiaghayi
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j61 | Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. J. Scheduling 16(2): 151-160 (2013) | |
| i19 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat: Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. CoRR abs/1304.7530 (2013) | |
| 2012 | ||
| j60 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi: Euclidean Prize-Collecting Steiner Forest. Algorithmica 62(3-4): 906-929 (2012) | |
| j59 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz: Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63(4): 795-814 (2012) | |
| j58 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. ACM Transactions on Algorithms 8(2): 13 (2012) | |
| j57 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi: Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. ACM Transactions on Algorithms 8(3): 20 (2012) | |
| j56 | Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-collecting steiner network problems. ACM Transactions on Algorithms 9(1): 2 (2012) | |
| j55 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The checkpoint problem. Theor. Comput. Sci. 452: 88-99 (2012) | |
| c90 | Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller: LP Rounding for k-Centers with Non-uniform Hard Capacities. FOCS 2012: 273-282 | |
| c89 | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk: Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469 | |
| c88 | Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2012: 230-241 | |
| c87 | Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Ioannis Pefkianakis, Songwu Lu, He Yan, Zihui Ge, Jennifer Yates, Mario Kosseifi: Threshold compression for 3G scalable monitoring. INFOCOM 2012: 1350-1358 | |
| c86 | Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat: Online prophet-inequality matching with applications to ad allocation. ACM Conference on Electronic Commerce 2012: 18-35 | |
| c85 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu: A polynomial-time approximation scheme for planar multiway cut. SODA 2012: 639-655 | |
| c84 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SODA 2012: 1713-1725 | |
| i18 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee: A Game-Theoretic Model Motivated by the DARPA Network Challenge. CoRR abs/1204.6552 (2012) | |
| i17 | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Dániel Marx: Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable. CoRR abs/1205.1271 (2012) | |
| i16 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx: Minimizing Movement: Fixed-Parameter Tractability. CoRR abs/1205.6960 (2012) | |
| i15 | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk: Designing FPT algorithms for cut problems using randomized contractions. CoRR abs/1207.4079 (2012) | |
| i14 | Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller: LP Rounding for k-Centers with Non-uniform Hard Capacities. CoRR abs/1208.3054 (2012) | |
| 2011 | ||
| j54 | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for Label Cover Problems. Algorithmica 61(1): 190-206 (2011) | |
| j53 | Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Subhabrata Sen, Oliver Spatscheck: To Cache or Not to Cache: The 3G Case. IEEE Internet Computing 15(2): 27-34 (2011) | |
| j52 | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx: Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. J. ACM 58(5): 21 (2011) | |
| j51 | MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff: Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses. Theory Comput. Syst. 49(4): 757-780 (2011) | |
| j50 | Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. SIAM J. Comput. 40(2): 309-332 (2011) | |
| c83 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat: Parameterized Complexity of Problems in Coalitional Resource Games. AAAI 2011 | |
| c82 | Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen: Disjoint-Path Facility Location: Theory and Practice. ALENEX 2011: 60-74 | |
| c81 | Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha: AdCell: Ad Allocation in Cellular Networks. ESA 2011: 311-322 | |
| c80 | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Sina Jafarpour, Dan Pei: Towards an efficient algorithmic framework for pricing cellular data service. INFOCOM 2011: 581-585 | |
| c79 | Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Ioannis Pefkianakis, Songwu Lu, He Yan, Zihui Ge, Jennifer Yates, Mario Kosseifi: Scalable monitoring via threshold compression in a large operational 3G network. SIGMETRICS 2011: 135-136 | |
| c78 | Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra: Capacitated Metric Labeling. SODA 2011: 976-995 | |
| c77 | MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx: Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049 | |
| c76 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat: On a local protocol for concurrent file transfers. SPAA 2011: 269-278 | |
| c75 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450 | |
| i13 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat: Parameterized Complexity of Problems in Coalitional Resource Games. CoRR abs/1105.0707 (2011) | |
| i12 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011) | |
| i11 | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx: Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. CoRR abs/1110.0259 (2011) | |
| i10 | Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha: AdCell: Ad Allocation in Cellular Networks. CoRR abs/1112.5396 (2011) | |
| 2010 | ||
| j49 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao: l22 Spreading Metrics for Vertex Ordering Problems. Algorithmica 56(4): 577-604 (2010) | |
| j48 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. Combinatorica 30(5): 533-552 (2010) | |
| j47 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39(5): 1772-1798 (2010) | |
| j46 | Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. ACM Transactions on Algorithms 6(2) (2010) | |
| j45 | Mohammad Taghi Hajiaghayi, Shang-Hua Teng: Foreword to special issue on SODA 2008. ACM Transactions on Algorithms 6(4) (2010) | |
| j44 | Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed fault tolerance. IEEE/ACM Trans. Netw. 18(1): 216-228 (2010) | |
| j43 | MohammadHossein Bateni, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Subhabrata Sen: Multi-VPN Optimization for Scalable Routing via Relaying. IEEE/ACM Trans. Netw. 18(5): 1544-1556 (2010) | |
| c74 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam: Submodular Secretary Problem and Extensions. APPROX-RANDOM 2010: 39-52 | |
| c73 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The Checkpoint Problem. APPROX-RANDOM 2010: 219-231 | |
| c72 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz: Budgeted Red-Blue Median and Its Generalizations. ESA (1) 2010: 314-325 | |
| c71 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini: The Cooperative Game Theory Foundations of Network Bargaining Games. ICALP (1) 2010: 67-78 | |
| c70 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84 | |
| c69 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi: Euclidean Prize-Collecting Steiner Forest. LATIN 2010: 503-514 | |
| c68 | MohammadTaghi Hajiaghayi, Arefeh A. Nasri: Prize-Collecting Steiner Networks via Iterative Rounding. LATIN 2010: 515-526 | |
| c67 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344 | |
| c66 | Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton: Basic network creation games. SPAA 2010: 106-113 | |
| c65 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. STOC 2010: 211-220 | |
| i9 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini: The cooperative game theory foundations of network bargaining games. CoRR abs/1004.4317 (2010) | |
| i8 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx: Prize-collecting Network Design on Planar Graphs. CoRR abs/1006.4339 (2010) | |
| 2009 | ||
| j42 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009) | |
| j41 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica 54(2): 142-180 (2009) | |
| j40 | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi: A note on the subadditive network design problem. Oper. Res. Lett. 37(5): 339-344 (2009) | |
| j39 | Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Hat Guessing Games. SIAM Review 51(2): 399-413 (2009) | |
| j38 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2): 2 (2009) | |
| j37 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. ACM Transactions on Algorithms 5(3) (2009) | |
| c64 | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34 | |
| c63 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx: Minimizing Movement: Fixed-Parameter Tractability. ESA 2009: 718-729 | |
| c62 | Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436 | |
| c61 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327 | |
| c60 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340 | |
| c59 | MohammadHossein Bateni, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Subhabrata Sen: Multi-VPN Optimization for Scalable Routing via Relaying. INFOCOM 2009: 2756-2760 | |
| c58 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi: Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. SODA 2009: 805-814 | |
| c57 | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175 | |
| c56 | MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff: Scheduling to minimize staleness and stretch in real-time data warehouses. SPAA 2009: 29-38 | |
| c55 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312 | |
| c54 | Mangesh Gupte, MohammadTaghi Hajiaghayi, Lu Han, Liviu Iftode, Pravin Shankar, Raluca M. Ursu: News Posting by Strategic Users in a Social Network. WINE 2009: 632-639 | |
| c53 | Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Oliver Spatscheck: Network-aware forward caching. WWW 2009: 291-300 | |
| i7 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. CoRR abs/0902.1400 (2009) | |
| i6 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx: Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. CoRR abs/0911.5143 (2009) | |
| i5 | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi: Euclidean Prize-collecting Steiner Forest. CoRR abs/0912.1137 (2009) | |
| 2008 | ||
| j36 | Erik D. Demaine, MohammadTaghi Hajiaghayi: The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. 51(3): 292-302 (2008) | |
| j35 | Erik D. Demaine, MohammadTaghi Hajiaghayi: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1): 19-36 (2008) | |
| j34 | Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee: Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008) | |
| j33 | Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour: Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008) | |
| j32 | Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Hat Guessing Games. SIAM J. Discrete Math. 22(2): 592-605 (2008) | |
| j31 | Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos: Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Transactions on Algorithms 4(4) (2008) | |
| c52 | Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34 | |
| c51 | Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth: Regret minimization and the price of total anarchy. STOC 2008: 373-382 | |
| r2 | Erik D. Demaine, MohammadTaghi Hajiaghayi: Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2008 | |
| r1 | ||
| 2007 | ||
| j30 | MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami: Plane Embeddings of Planar Graph Metrics. Discrete & Computational Geometry 38(3): 615-637 (2007) | |
| j29 | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. 28(1): 311-314 (2007) | |
| j28 | MohammadTaghi Hajiaghayi, Naomi Nishimura: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73(5): 755-768 (2007) | |
| j27 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007) | |
| j26 | Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton: Localized Client-Server Load Balancing without Global Information. SIAM J. Comput. 37(4): 1259-1279 (2007) | |
| j25 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton: Oblivious routing on node-capacitated and directed graphs. ACM Transactions on Algorithms 3(4) (2007) | |
| j24 | Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi: Cell Breathing in Wireless LANs: Algorithms and Evaluation. IEEE Trans. Mob. Comput. 6(2): 164-178 (2007) | |
| j23 | Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Trans. Netw. 15(6): 1345-1358 (2007) | |
| c50 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm: Automated Online Mechanism Design and Prophet Inequalities. AAAI 2007: 58-65 | |
| c49 | Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar: Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148 | |
| c48 | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252 | |
| c47 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298 | |
| c46 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267 | |
| c45 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287 | |
| c44 | Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton: Semi-oblivious routing: lower bounds. SODA 2007: 929-938 | |
| c43 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274 | |
| c42 | Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54 | |
| c41 | Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi: A Theory of Loss-Leaders: Making Money by Pricing Below Cost. WINE 2007: 293-299 | |
| i4 | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. CoRR abs/0707.0648 (2007) | |
| 2006 | ||
| j22 | Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006) | |
| j21 | Mohammad Taghi Hajiaghayi, Harald Räcke: An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4): 156-160 (2006) | |
| j20 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discrete Math. 20(2): 357-371 (2006) | |
| j19 | Mohammad Taghi Hajiaghayi, Tom Leighton: On the max-flow min-cut ratio for directed multicommodity flows. Theor. Comput. Sci. 352(1-3): 318-321 (2006) | |
| j18 | Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni: Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. Wireless Networks 12(2): 179-188 (2006) | |
| c40 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. APPROX-RANDOM 2006: 152-163 | |
| c39 | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami: Plane embeddings of planar graph metrics. Symposium on Computational Geometry 2006: 197-206 | |
| c38 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686 | |
| c37 | Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani: Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. International Conference on Computational Science (2) 2006: 758-766 | |
| c36 | Mohammad Taghi Hajiaghayi, Li Li, Vahab S. Mirrokni, Marina Thottan: Bandwidth Sharing Network Design for Multi-Class Traffic. INFOCOM 2006 | |
| c35 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15 | |
| c34 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour: Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171 | |
| c33 | Mohammad Taghi Hajiaghayi, Kamal Jain: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. SODA 2006: 631-640 | |
| c32 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton: Improved lower and upper bounds for universal TSP in planar metrics. SODA 2006: 649-658 | |
| c31 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke: New lower bounds for oblivious routing in undirected graphs. SODA 2006: 918-927 | |
| c30 | ||
| c29 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao: l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027 | |
| c28 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Semi-oblivious routing. SPAA 2006: 234 | |
| i3 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk k-Steiner trees. Electronic Colloquium on Computational Complexity (ECCC)(007) (2006) | |
| i2 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk. Electronic Colloquium on Computational Complexity (ECCC)(008) (2006) | |
| 2005 | ||
| j17 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. Algorithmica 41(4): 245-267 (2005) | |
| j16 | Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood: Balanced vertex-orderings of graphs. Discrete Applied Mathematics 148(1): 27-48 (2005) | |
| j15 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6): 866-893 (2005) | |
| j14 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Transactions on Algorithms 1(1): 33-47 (2005) | |
| c27 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646 | |
| c26 | Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar: The Generalized Deadlock Resolution Problem. ICALP 2005: 853-865 | |
| c25 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power Optimization for Connectivity Problems. IPCO 2005: 349-361 | |
| c24 | Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc 2005: 309-319 | |
| c23 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes: Online auctions with re-usable goods. ACM Conference on Electronic Commerce 2005: 165-174 | |
| c22 | Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Online client-server load balancing without global information. SODA 2005: 197-206 | |
| c21 | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Bidimensionality: new connections between FPT algorithms and PTASs. SODA 2005: 590-601 | |
| c20 | Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos: Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA 2005: 650-659 | |
| c19 | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. SODA 2005: 682-689 | |
| c18 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke: Oblivious routing on node-capacitated and directed graphs. SODA 2005: 782-790 | |
| c17 | Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke: Oblivious routing in directed graphs with random demands. STOC 2005: 193-201 | |
| c16 | Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee: Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572 | |
| i1 | Erik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality, Map Graphs, and Grid Minors. CoRR abs/cs/0502070 (2005) | |
| 2004 | ||
| j13 | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40(3): 211-215 (2004) | |
| j12 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004) | |
| j11 | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin: Random MAX SAT, random MAX CUT, and their phase transitions. Random Struct. Algorithms 24(4): 502-545 (2004) | |
| j10 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. SIAM J. Discrete Math. 18(3): 501-511 (2004) | |
| j9 | Yashar Ganjali, Mohammad Taghi Hajiaghayi: Characterization of networks supporting multi-dimensional linear interval routing schemes. Theor. Comput. Sci. 326(1-3): 103-116 (2004) | |
| c15 | Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329 | |
| c14 | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Graph Drawing 2004: 517-533 | |
| c13 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118 | |
| c12 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203 | |
| c11 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, David C. Parkes: Adaptive limited-supply online auctions. ACM Conference on Electronic Commerce 2004: 71-80 | |
| c10 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. SODA 2004: 830-839 | |
| c9 | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004: 840-849 | |
| 2003 | ||
| j8 | Mohammad Taghi Hajiaghayi, Mahdi Hajiaghayi: A note on the bounded fragmentation property and its applications in network reliability. Eur. J. Comb. 24(7): 891-896 (2003) | |
| j7 | Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni: The facility location problem with general cost functions. Networks 42(1): 42-47 (2003) | |
| j6 | Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar: Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003) | |
| c8 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP 2003: 829-844 | |
| c7 | Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni: Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. MOBICOM 2003: 300-312 | |
| c6 | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin: Random MAX SAT, random MAX CUT, and their phase transitions. SODA 2003: 364-373 | |
| 2002 | ||
| j5 | 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: RoboCup-2001: The Fifth Robotic Soccer World Championships. AI Magazine 23(1): 55-68 (2002) | |
| j4 | Mohammad Taghi Hajiaghayi, Yashar Ganjali: A note on the Consecutive Ones Submatrix problem. Inf. Process. Lett. 83(3): 163-166 (2002) | |
| j3 | Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni: Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002) | |
| c5 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX 2002: 67-80 | |
| c4 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. ISAAC 2002: 262-273 | |
| c3 | Mohammad Taghi Hajiaghayi, Naomi Nishimura: Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318 | |
| 2001 | ||
| j2 | Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electronic Notes in Discrete Mathematics 10: 137-142 (2001) | |
| c2 | Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan: A Fast Vision System for Middle Size Robots in RoboCup. RoboCup 2001: 71-80 | |
| 2000 | ||
| j1 | Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani: On the simultaneous edge-coloring conjecture. Discrete Mathematics 216(1-3): 267-272 (2000) | |
| c1 | 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: A Goal Keeper for Middle Size RoboCup. RoboCup 2000: 583-586 | |
Colors in the list of coauthors
Last update Sun May 19 11:10:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page