![]() | ![]() |
MohammadTaghi Hajiaghayi
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
100 | EE | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi: Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175 |
99 | EE | MohammadHossein Bateni, MohammadTaghi Hajiaghayi: Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. SODA 2009: 805-814 |
98 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312 |
97 | EE | Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Oliver Spatscheck: Network-aware forward caching. WWW 2009: 291-300 |
96 | EE | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009) |
95 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games CoRR abs/0902.1400: (2009) |
2008 | ||
94 | EE | Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34 |
93 | EE | Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth: Regret minimization and the price of total anarchy. STOC 2008: 373-382 |
92 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi: Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2008 |
91 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality. Encyclopedia of Algorithms 2008 |
90 | EE | 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) |
89 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1): 19-36 (2008) |
88 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi: The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. 51(3): 292-302 (2008) |
87 | EE | Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee: Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008) |
86 | EE | 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) |
85 | EE | Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Hat Guessing Games. SIAM J. Discrete Math. 22(2): 592-605 (2008) |
2007 | ||
84 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm: Automated Online Mechanism Design and Prophet Inequalities. AAAI 2007: 58-65 | |
83 | EE | Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar: Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148 |
82 | EE | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252 |
81 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298 |
80 | EE | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274 |
79 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267 |
78 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar: Approximation algorithms via contraction decomposition. SODA 2007: 278-287 |
77 | EE | Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton: Semi-oblivious routing: lower bounds. SODA 2007: 929-938 |
76 | EE | 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 |
75 | EE | 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 |
74 | EE | 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) |
73 | EE | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest CoRR abs/0707.0648: (2007) |
72 | EE | MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami: Plane Embeddings of Planar Graph Metrics. Discrete & Computational Geometry 38(3): 615-637 (2007) |
71 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. 28(1): 311-314 (2007) |
70 | EE | 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) |
69 | EE | 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) |
68 | EE | MohammadTaghi Hajiaghayi, Naomi Nishimura: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73(5): 755-768 (2007) |
67 | EE | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007) |
66 | EE | 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) |
2006 | ||
65 | EE | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. APPROX-RANDOM 2006: 152-163 |
64 | EE | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686 |
63 | EE | Mohammad Taghi Hajiaghayi, Li Li, Vahab S. Mirrokni, Marina Thottan: Bandwidth Sharing Network Design for Multi-Class Traffic. INFOCOM 2006 |
62 | EE | 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 |
61 | EE | 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 |
60 | EE | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao: l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027 |
59 | EE | 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 |
58 | EE | Mohammad Taghi Hajiaghayi, Kamal Jain: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. SODA 2006: 631-640 |
57 | EE | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton: Improved lower and upper bounds for universal TSP in planar metrics. SODA 2006: 649-658 |
56 | EE | 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 |
55 | EE | Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke: Oblivious network design. SODA 2006: 970-979 |
54 | EE | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Semi-oblivious routing. SPAA 2006: 234 |
53 | EE | MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami: Plane embeddings of planar graph metrics. Symposium on Computational Geometry 2006: 197-206 |
52 | EE | Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006) |
51 | EE | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk k-Steiner trees Electronic Colloquium on Computational Complexity (ECCC)(007): (2006) |
50 | EE | 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) |
49 | EE | Mohammad Taghi Hajiaghayi, Harald Räcke: An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4): 156-160 (2006) |
48 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discrete Math. 20(2): 357-371 (2006) |
47 | EE | 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) |
46 | EE | 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) |
2005 | ||
45 | EE | 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 |
44 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi: Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646 |
43 | EE | Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar: The Generalized Deadlock Resolution Problem. ICALP 2005: 853-865 |
42 | EE | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov: Power Optimization for Connectivity Problems. IPCO 2005: 349-361 |
41 | EE | Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus: Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc 2005: 309-319 |
40 | EE | Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton: Online client-server load balancing without global information. SODA 2005: 197-206 |
39 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Bidimensionality: new connections between FPT algorithms and PTASs. SODA 2005: 590-601 |
38 | EE | 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 |
37 | EE | 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 |
36 | EE | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke: Oblivious routing on node-capacitated and directed graphs. SODA 2005: 782-790 |
35 | EE | Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke: Oblivious routing in directed graphs with random demands. STOC 2005: 193-201 |
34 | EE | Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee: Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572 |
33 | EE | 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) |
32 | EE | 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) |
31 | EE | Erik D. Demaine, MohammadTaghi Hajiaghayi: Bidimensionality, Map Graphs, and Grid Minors CoRR abs/cs/0502070: (2005) |
30 | EE | 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) |
29 | EE | 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) |
2004 | ||
28 | EE | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, David C. Parkes: Adaptive limited-supply online auctions. ACM Conference on Electronic Commerce 2004: 71-80 |
27 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. Graph Drawing 2004: 517-533 |
26 | EE | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118 |
25 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203 |
24 | EE | 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 |
23 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004: 840-849 |
22 | EE | Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329 |
21 | EE | Erik D. Demaine, Mohammad Taghi Hajiaghayi: Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40(3): 211-215 (2004) |
20 | EE | 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) |
19 | EE | 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) |
18 | EE | 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) |
17 | EE | Yashar Ganjali, Mohammad Taghi Hajiaghayi: Characterization of networks supporting multi-dimensional linear interval routing schemes. Theor. Comput. Sci. 326(1-3): 103-116 (2004) |
2003 | ||
16 | EE | 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 |
15 | EE | 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 |
14 | EE | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin: Random MAX SAT, random MAX CUT, and their phase transitions. SODA 2003: 364-373 |
13 | EE | 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) |
12 | EE | Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni: The facility location problem with general cost functions. Networks 42(1): 42-47 (2003) |
11 | EE | 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) |
2002 | ||
10 | EE | 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 |
9 | EE | 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 |
8 | EE | Mohammad Taghi Hajiaghayi, Naomi Nishimura: Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318 |
7 | 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) | |
6 | EE | Mohammad Taghi Hajiaghayi, Yashar Ganjali: A note on the Consecutive Ones Submatrix problem. Inf. Process. Lett. 83(3): 163-166 (2002) |
5 | EE | Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni: Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002) |
2001 | ||
4 | EE | 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 |
3 | EE | 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) |
2000 | ||
2 | EE | 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 |
1 | EE | 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) |