Mohammad Taghi Hajiaghayi

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2013
100Scheduling to minimize gaps and power consumption. Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam. J. Scheduling (16): 151-160 (2013). Web SearchBibTeXDownload
2012
99Online prophet-inequality matching with applications to ad allocation. Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat. ACM Conference on Electronic Commerce 2012, 18-35. Web SearchBibTeXDownload
98The 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
97LP Rounding for k-Centers with Non-uniform Hard Capacities. Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller. CoRR (abs/1208.3054) (2012). Web SearchBibTeXDownload
96Minimizing Movement: Fixed-Parameter Tractability. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx. CoRR (abs/1205.6960) (2012). Web SearchBibTeXDownload
2011
95Disjoint-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
94Improved Approximation Algorithms for Label Cover Problems. Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff. Algorithmica (61): 190-206 (2011). Web SearchBibTeXDownload
93AdCell: Ad Allocation in Cellular Networks. Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha. ESA 2011, 311-322. Web SearchBibTeXDownload
92To 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
91Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff. SIAM J. Comput. (40): 309-332 (2011). Web SearchBibTeXDownload
90Prize-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
89Capacitated Metric Labeling. Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra. SODA 2011, 976-995. Web SearchBibTeXDownload
88Contraction decomposition in h-minor-free graphs and algorithmic applications. Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. STOC 2011, 441-450. Web SearchBibTeXDownload
87Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses. MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff. Theory Comput. Syst. (49): 757-780 (2011). Web SearchBibTeXDownload
2010
86l22 Spreading Metrics for Vertex Ordering Problems. Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. Algorithmica (56): 577-604 (2010). Web SearchBibTeXDownload
85Approximation algorithms via contraction decomposition. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. Combinatorica (30): 533-552 (2010). Web SearchBibTeXDownload
84Deploying 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
83Approximation 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
82Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. SODA 2010, 329-344. Web SearchBibTeXDownload
81Basic network creation games. Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton. SPAA 2010, 106-113. Web SearchBibTeXDownload
2009
80Minimizing 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
79Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi. Algorithmica (54): 142-180 (2009). Web SearchBibTeXDownload
78The Price of Anarchy in Cooperative Network Creation Games. Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. CoRR (abs/0902.1400) (2009). Web SearchBibTeXDownload
77Minimizing Movement: Fixed-Parameter Tractability. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx. ESA 2009, 718-729. Web SearchBibTeXDownload
76Improved Approximation Algorithms for Label Cover Problems. Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff. ESA 2009, 23-34. Web SearchBibTeXDownload
75Improved 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
74Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. ICALP (1) 2009, 316-327. Web SearchBibTeXDownload
73Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein. ICALP (1) 2009, 328-340. Web SearchBibTeXDownload
72The 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
71Additive approximation algorithms for list-coloring minor-closed class of graphs. Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi. SODA 2009, 1166-1175. Web SearchBibTeXDownload
70Scheduling 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
69The Price of Anarchy in Cooperative Network Creation Games. Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. STACS 2009, 301-312. Web SearchBibTeXDownload
68News Posting by Strategic Users in a Social Network. Mangesh Gupte, MohammadTaghi Hajiaghayi, Lu Han, Liviu Iftode, Pravin Shankar, Raluca M. Ursu. WINE 2009, 632-639. Web SearchBibTeXDownload
67Network-aware forward caching. Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Oliver Spatscheck. WWW 2009, 291-300. Web SearchBibTeXDownload
2008
66Ordinal 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
65Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam. APPROX-RANDOM 2008, 21-34. Web SearchBibTeXDownload
64Linearity of grid minors in treewidth with applications through bidimensionality. Erik D. Demaine, MohammadTaghi Hajiaghayi. Combinatorica (28): 19-36 (2008). Web SearchBibTeXDownload
63The Bidimensionality Theory and Its Algorithmic Applications. Erik D. Demaine, MohammadTaghi Hajiaghayi. Comput. J. (51): 292-302 (2008). Web SearchBibTeXDownload
62Approximation Schemes for Planar Graph Problems. Erik D. Demaine, MohammadTaghi Hajiaghayi. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
61Combination Can Be Hard: Approximability of the Unique Coverage Problem. Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour. SIAM J. Comput. (38): 1464-1483 (2008). Web SearchBibTeXDownload
60Regret minimization and the price of total anarchy. Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth. STOC 2008, 373-382. Web SearchBibTeXDownload
2007
59Stochastic Steiner Tree with Non-uniform Inflation. Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar. APPROX-RANDOM 2007, 134-148. Web SearchBibTeXDownload
58Plane Embeddings of Planar Graph Metrics. MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami. Discrete & Computational Geometry (38): 615-637 (2007). Web SearchBibTeXDownload
57Quickly deciding minor-closed parameters in general graphs. Erik D. Demaine, Mohammad Taghi Hajiaghayi. Eur. J. Comb. (28): 311-314 (2007). Web SearchBibTeXDownload
56Power 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
55Cell 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
54Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. MohammadTaghi Hajiaghayi, Naomi Nishimura. J. Comput. Syst. Sci. (73): 755-768 (2007). Web SearchBibTeXDownload
53Power optimization for connectivity problems. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov. Math. Program. (110): 195-208 (2007). Web SearchBibTeXDownload
52The price of anarchy in network creation games. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. PODC 2007, 292-298. Web SearchBibTeXDownload
51Localized 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
50Approximation 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
49Semi-oblivious routing: lower bounds. Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton. SODA 2007, 929-938. Web SearchBibTeXDownload
48Minimizing movement. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam. SODA 2007, 258-267. Web SearchBibTeXDownload
47Approximation algorithms via contraction decomposition. Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. SODA 2007, 278-287. Web SearchBibTeXDownload
46Scheduling 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
45A Theory of Loss-Leaders: Making Money by Pricing Below Cost. Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi. WINE 2007, 293-299. Web SearchBibTeXDownload
2006
44Low-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
43Approximation 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
42Bandwidth Sharing Network Design for Multi-Class Traffic. Mohammad Taghi Hajiaghayi, Li Li, Vahab S. Mirrokni, Marina Thottan. INFOCOM 2006. Web SearchBibTeXDownload
41Algorithmic 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
40The Bidimensional Theory of Bounded-Genus Graphs. Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos. SIAM J. Discrete Math. (20): 357-371 (2006). Web SearchBibTeXDownload
39Combination 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
38New 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
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
36l22 spreading metrics for vertex ordering problems. Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. SODA 2006, 1018-1027. Web SearchBibTeXDownload
35Plane embeddings of planar graph metrics. MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami. Symposium on Computational Geometry 2006, 197-206. Web SearchBibTeXDownload
34Fault-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
33Online 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
32Fixed-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
31Exponential 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
30Bidimensionality, Map Graphs, and Grid Minors. Erik D. Demaine, MohammadTaghi Hajiaghayi. CoRR (abs/cs/0502070) (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
16Subexponential 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
15Equivalence of local treewidth and linear local treewidth and its algorithmic applications. Erik D. Demaine, Mohammad Taghi Hajiaghayi. SODA 2004, 840-849. 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