The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mohammad Taghi Hajiaghayi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:67-80 [Conf]
  2. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:152-163 [Conf]
  3. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
    Low-dimensional embedding with extra information. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:320-329 [Conf]
  4. MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami
    Plane embeddings of planar graph metrics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:197-206 [Conf]
  5. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
    Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:637-646 [Conf]
  6. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:677-686 [Conf]
  7. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:517-533 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:829-844 [Conf]
  9. Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar
    The Generalized Deadlock Resolution Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:853-865 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:758-766 [Conf]
  11. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power Optimization for Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:349-361 [Conf]
  12. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
    Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:3-15 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:262-273 [Conf]
  14. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:109-118 [Conf]
  15. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    The Bidimensional Theory of Bounded-Genus Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:191-203 [Conf]
  16. Mohammad Taghi Hajiaghayi, Naomi Nishimura
    Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:305-318 [Conf]
  17. Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni
    Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2003, pp:300-312 [Conf]
  18. Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus
    Deploying sensor networks with guaranteed capacity and fault tolerance. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2005, pp:309-319 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    RoboCup, 2000, pp:583-586 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    RoboCup, 2001, pp:71-80 [Conf]
  21. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes
    Online auctions with re-usable goods. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2005, pp:165-174 [Conf]
  22. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, David C. Parkes
    Adaptive limited-supply online auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:71-80 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:650-659 [Conf]
  24. Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton
    Online client-server load balancing without global information. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:197-206 [Conf]
  25. Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
    l22 spreading metrics for vertex ordering problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1018-1027 [Conf]
  26. Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
    Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:364-373 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:830-839 [Conf]
  28. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Equivalence of local treewidth and linear local treewidth and its algorithmic applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:840-849 [Conf]
  29. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Bidimensionality: new connections between FPT algorithms and PTASs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:590-601 [Conf]
  30. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:682-689 [Conf]
  31. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour
    Combination can be hard: approximability of the unique coverage problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:162-171 [Conf]
  32. Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke
    Oblivious network design. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:970-979 [Conf]
  33. Mohammad Taghi Hajiaghayi, Kamal Jain
    The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:631-640 [Conf]
  34. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton
    Improved lower and upper bounds for universal TSP in planar metrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:649-658 [Conf]
  35. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke
    Oblivious routing on node-capacitated and directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:782-790 [Conf]
  36. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke
    New lower bounds for oblivious routing in undirected graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:918-927 [Conf]
  37. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton
    Semi-oblivious routing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:234- [Conf]
  38. Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee
    Improved approximation algorithms for minimum-weight vertex separators. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:563-572 [Conf]
  39. Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke
    Oblivious routing in directed graphs with random demands. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:193-201 [Conf]
  40. 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. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2002, v:23, n:1, pp:55-68 [Journal]
  41. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Diameter and Treewidth in Minor-Closed Graph Families, Revisited. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:3, pp:211-215 [Journal]
  42. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:41, n:4, pp:245-267 [Journal]
  43. Therese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
    Balanced vertex-orderings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:1, pp:27-48 [Journal]
  44. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
    Low-Dimensional Embedding with Extra Information. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:609-632 [Journal]
  45. Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani
    On the simultaneous edge-coloring conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:267-272 [Journal]
  46. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximating Buy-at-Bulk k-Steiner trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:007, pp:- [Journal]
  47. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:008, pp:- [Journal]
  48. Mohammad Taghi Hajiaghayi, Mahdi Hajiaghayi
    A note on the bounded fragmentation property and its applications in network reliability. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:7, pp:891-896 [Journal]
  49. Erik D. Demaine, Mohammad Taghi Hajiaghayi
    Quickly deciding minor-closed parameters in general graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:311-314 [Journal]
  50. Mohammad Taghi Hajiaghayi, Yashar Ganjali
    A note on the Consecutive Ones Submatrix problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:163-166 [Journal]
  51. Mohammad Taghi Hajiaghayi, Harald Räcke
    An O(sqrt(n))-approximation algorithm for directed sparsest cut. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:156-160 [Journal]
  52. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:6, pp:866-893 [Journal]
  53. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166-195 [Journal]
  54. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power optimization for connectivity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:195-208 [Journal]
  55. Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
    The facility location problem with general cost functions. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:42-47 [Journal]
  56. Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
    Length-constrained path-matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:4, pp:210-215 [Journal]
  57. Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin
    Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:4, pp:502-545 [Journal]
  58. Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Bidimensional Parameters and Local Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:501-511 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:33-47 [Journal]
  60. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
    Palindrome recognition using a multidimensional tape. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:475-480 [Journal]
  61. Yashar Ganjali, Mohammad Taghi Hajiaghayi
    Characterization of networks supporting multi-dimensional linear interval routing schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:103-116 [Journal]
  62. Mohammad Taghi Hajiaghayi, Tom Leighton
    On the max-flow min-cut ratio for directed multicommodity flows. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:318-321 [Journal]
  63. Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi
    Cell Breathing in Wireless LANs: Algorithms and Evaluation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2007, v:6, n:2, pp:164-178 [Journal]
  64. Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni
    Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:2, pp:179-188 [Journal]
  65. Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm
    Automated Online Mechanism Design and Prophet Inequalities. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:58-65 [Conf]
  66. Mohammad Taghi Hajiaghayi, Li Li, Vahab S. Mirrokni, Marina Thottan
    Bandwidth Sharing Network Design for Multi-Class Traffic. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  67. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
    Minimizing movement. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:258-267 [Conf]
  68. Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton
    Semi-oblivious routing: lower bounds. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:929-938 [Conf]
  69. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
    Approximation algorithms for node-weighted buy-at-bulk network design. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1265-1274 [Conf]
  70. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar
    Approximation algorithms via contraction decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:278-287 [Conf]
  71. Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
    Scheduling to minimize gaps and power consumption. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:46-54 [Conf]

  72. Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. [Citation Graph (, )][DBLP]


  73. Multi-VPN Optimization for Scalable Routing via Relaying. [Citation Graph (, )][DBLP]


  74. Scheduling to minimize staleness and stretch in real-time data warehouses. [Citation Graph (, )][DBLP]


  75. Network-aware forward caching. [Citation Graph (, )][DBLP]


  76. Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. [Citation Graph (, )][DBLP]


  77. l22 Spreading Metrics for Vertex Ordering Problems. [Citation Graph (, )][DBLP]


  78. The Price of Anarchy in Cooperative Network Creation Games [Citation Graph (, )][DBLP]


  79. Euclidean Prize-collecting Steiner Forest [Citation Graph (, )][DBLP]


Search in 1.679secs, Finished in 1.682secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002