Publications :

Journal Articles:

  • 38  E.D. Demaine; M.T. Hajiaghayi;

Linearity of Grid Minors in Treewidth with Applications through Bidimensionality,
Combinatorica. To appear.  A preliminary version appeared in the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 682-689.

  • 37  U. Feige; M.T. Hajiaghayi; J.R. Lee;

                 Improved approximation algorithms for minimum-weight vertex separators,

 A special issue of SIAM Journal on Computing for selected papers from STOC 2005. To appear. A preliminary version appeared in the 37th ACM Symposium on Theory of Computing (STOC), pp. 563-572, Baltimore, MD, May 21-24, 2005.

  • 36  B. Awerbuch; M.T. Hajiaghayi; R.D. Kleinberg; T. Leighton;

               Online Client-Server Load Balancing Without Global Information,

SIAM Journal on Computing. To appear.  A preliminary version appeared in the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, BC, Canada, January 23-25, 2005, 197-206.
Invitation to Journal of Scheduling special issue for selected papers from SODA 2005 regretfully declined.

  • 35  E.D. Demaine, U. Feige, M.T. Hajiaghayi;  M.R. Salavatipour;

Combination can be hard: approximability of the unique coverage problem,
SIAM Journal on Computing. To appear. A preliminary version appeared in the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, Miami, Florida, January 22-24, 2006, pp. 162-171.

  • 34  E.D. Demaine; Hajiaghayi, M.T.; Fomin, F.V.;Thilikos, D.;

Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-minor-free Graphs,

Journal of the ACM. Vol 52, No 6, pp. 866-893. A preliminary version appeared in the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 11-13, 2004, New   Orleans, pp. 830-839. 

  • 33  S. Butler; M.T. Hajiaghayi; R.D. Kleinberg; T. Leighton;

            Hat Guessing Games,

SIAM Journal on Discrete Mathematics. To appear.

  • 32  N. Alon; M. Badoiu; E.D. Demaine; M. Farach-Colton; M.T. Hajiaghayi; A. Sidiropoulos;

Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics,
ACM Transactions on Algorithms. To appear. A preliminary version appeared in the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 650-659.

  • 31  M.T. Hajiaghayi; R.D. Kleinberg; T. Leighton; H. Raecke;

Oblivious Routing on Node-Capacitated and Directed Graphs,

ACM Transactions on Algorithms. To appear. A preliminary version appeared in the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 782-790.
Invitation to Journal of Scheduling special issue for selected papers from SODA 2005 regretfully declined.

  • 30   M.T. Hajiaghayi; N. Immorlica; V.S. Mirrokni;

Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks,
IEEE/ACM Transactions on Networking. To appear. A preliminary version appeared in the Ninth Annual International Conference on Mobile Computing and Networking (MOBICOM), San Diego, CA,  September 15-18 2003, pp. 300-312.

  • 29  M.T. Hajiaghayi; G. Kortsarz; M. R. Salavatipour;

Approximating Buy-at-Bulk and Shallow-light k-Steiner trees,
Algorithmica, To appear. A preliminary version appeared in Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), Spain, August 28-30, 2006, pp. 153-163.

  • 28  E.D. Demaine; M.T. Hajiaghayi; K. Kawarabayashi;

          Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction,

A special issue of Algorithmica for selected papers from ISAAC 2006. To appear. A preliminary version appeared in Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006), Calcutta, India, December 18-20, 2006, pages 3-15. 

               ** Winner of the best paper award in ISAAC 2006.

  • 27  M.S. Bateni; E.D. Demaine; M.T. Hajiaghayi; M. Moharrami;

                 Plane embeddings of planar graph metrics,

Discrete & Computational Geometry. To appear. A preliminary version appeared in the 22nd Annual ACM Symposium on Computational Geometry (SoCG), Ann Arbor, Michigan, June 2006, pp. 197-206. 

  • 26    Hajiaghayi, M.T; Nishimura, N.;

Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth,
Journal of Computer and System Sciences, Vol 73, No 5, pp. 755--768, 2007.

A preliminary version appeared in the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), August 26-30, 2002, Poland, Lecture Notes in Computer Science 2420, pp. 305-318, 2002.

  • 25  M.T. Hajiahgayi; G. Kortsarz; V. S. Mirrokni; Z. Nutov;

         Power Optimization for Connectivity Problems,

A special issue of Mathematical Programming, Series B for selected papers from IPCO 2005. Vol 110, No 1, pp. 195--208, 2007. A preliminary version appeared in the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 349-361, Berlin, Germany, June 2005.

  • 24  M. Badoiu; E.D. Demaine;  M.T. Hajiaghayi; P. Indyk;

Low Dimensional Embedding with Extra Information,
A special issue of Discrete & Computational Geometry for selected papers from SoCG 2004. Vol 36, No. 4, pp. 609-632, 2006.   A preliminary version appeared in the 20th ACM Symposium on Computational Geometry (SoCG), June 9 - 11, 2004, New York. pp. 320-329.

  • 23    E.D. Demaine; Hajiaghayi, M.T.; Thilikos, D.;

The Bidimensional Theory of Bounded-Genus Graphs,
SIAM Journal on Discrete Mathematics. Vol. 20, No. 2, pp. 357-371, 2006.  A preliminary version appeared in the 29th International Symposium on Math. Foundations of Computer Science, 2004, Prague, Europe, 2004. pp. 191-203.

  • 22  P. Bahl; M.T. Hajiaghayi; K. Jain; V.S. Mirrokni; L. Qui; A. Saberi;

            Cell Breathing in Wireless LANs: Algorithms and Evaluation.

        IEEE Transactions on Mobile Computing, Vol 6, No 2, pp. 164--178, 2007.

  • 21  E.D. Demaine; M.T. Hajiaghayi;

The Bidimensionality Theory and Its Algorithmic Applications,
A special issue of Computer Journal for selected survey-papers in Fixed-Parameter Tractability(FPT), To appear.  A preliminary version of this paper appeared as an Invited presentation in the 12th International Symposium on Graph Drawing(GD), pp. 517-533, New York City, NY, 2004.

 

**This paper surveys our theory of bidimensionality and its known combinatorial and algorithmic results of this theory. See the Slides here .pdf , .ppt.

  • 20  E.D. Demaine; M.T. Hajiaghayi;

Quickly Deciding Minor-Closed Parameters in General Graphs,
European Journal of Combinatorics, Vol 28, No. 1, pp. 311-314, 2007. 

  • 19  Hajiaghayi, M.T.;  Leighton, F.T.;

                On the max-flow min-cut ratio for directed multicommodity flows,
                Theoretical Computer science, Vol 352, No. 1--3: 318-321, 2006.

  • 18  M.T. Hajiaghayi; H. Raecke;

An O(sqrt{n})-Approximation Algorithm For Directed Sparsest Cut,
 Information Processing Letters, Vol  97, No. 4, pp. 156-160, 2006.

  • 17   Hajiaghayi, M. T.; Bahramgiri, M.; Mirrokni, V. S.;

Fault-tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks,
ACM/Kluwer Wireless Networks. Vol. 12, No. 2, pp. 179-188, 2006. A preliminary version appeared in the 11th IEEE International Conference on Computer Communications and Networks, October, 2002, p. 392-398.

  • 16    Hajiaghayi, M.T.; Demaine, E.D.; Fomin, F.V.;Thilikos, D.;

Fixed-Parameter Algorithms for the (k,r)-Center in Planar Graphs and Map Graphs,
ACM Transactions on Algorithms. Vol 1, No 1, pp. 33-47, 2005.  A preliminary version appeared in 30th International Colloquium on Automata, Languages and Programming (ICALP), July, 2003,  pp. 829-844.

  • 15  Hajiaghayi, M.T; Biedl, T;  Chan. T; Ganjali, Y; Wood, D.R.;

            Balanced vertex-orderings of graphs, 

Discrete Applied Mathematics. Vol 148, No 1, pp. 27-48, 2005.

  • 14   Hajiaghayi, M.T.; Demaine, E.D.; Thilikos, D.;

Exponential Speedup of Fixed Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors,
Algorithmica, Vol 41, No. 4, pp. 245-267, 2005. A preliminary version appeared in Annual International Symposium on Algorithms and Computation, November, 2002.

  • 13   Hajiaghayi, M.T.; Demaine, E.D.; Fomin, F.V.;Thilikos, D.;

Bidimensional Parameters and Local Treewidth,
SIAM Journal on Discrete Mathematics. Vol 18, No. 3, pp. 501-511, 2004. Preliminary versions appeared in  Latin American Theoretical Informatics, April, 2004 and Annual European Symposium on Algorithms, September, 2003.

  • 12  Hajiaghayi, M. T.; Ganjali Y.;

Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes
Theoretical Computer Science, Vol 326, No. 1-3, pp. 103-116.

  • 11 M.T. Hajiaghayi; E.D. Demaine.;

Diameter and Treewidth in Minor-Closed Graph Families, Revisited,
Algorithmica. Vol 40, No. 3, pp. 211-215, 2004.

  • 10  Hajiaghayi, M.T.; Demaine, E.D.;  Nishimura, N; Ragde, P; Thilikos, D.;

               Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
         Journal of Computer and System Sciences,   Vol 69, No. 2, pp. 166-195,  2004.

  • 9  M.T. Hajiaghayi;  D. Coppersmith; D. Gamarnik;  G.B. Sorkin;

Random MAX SAT, Random MAX CUT, and Their Phase Transitions 
A special issue of Random Structures and Algorithms, Vol 24, Issue 4 , pp. 502-545. A preliminary version  appeared in Proceedings of Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 364-373, January 12-14, 2003, Baltimore.

  • 8    M.T.  Hajiaghayi; M. Hajiaghayi;

On the bounded  fragmentation property and its applications,

European Journal of Combinatorics, Vol 24, No. 7, pp. 891-896, 2003.  A preliminary version  appeared in  Proc. Euroconference on Combinatorics, Graph Theory and Applications,  EuroCOMB'03,  Sep. 2003.

  • 7    Hajiaghayi, M. T.; Mahdian, M.; Mirrokni, V.S.;

The facility location problem with general cost functions,
Networks, Vol. 42, No. 1, pp.  42-47, 2003.

  • 6    Hajiaghayi, M.T.;  Biedl,  T.; Buss, J.F.; Demaine, E.D., Demaine, M.L.; Vinar,T.;

Palindrome Recognition Using a Multidimensioinal Tape,
Theoretical Computer science, Vol. 302, No. 1-3, pp. 475-480, 2003.

  • 5     Hajiaghai1, M.T.; Veloso, M.; Balch, T.; Stone, P.; Kitano, H.; Yamasaki, F.; Endo, K.; Asada, M; Jamzad, M; Sadjad, B. S.; Mirrokni, V. S.; Kazemi, M.; Chitsaz, H.; Heydarnoori, A.; Chiniforooshan E.;

                RoboCup-2001 -The Fifth Robotic Soccer World Chapmpionships.
                AI magazine, Vol. 23, No. 1, pp. 55-68, 2002.

  • 4     M.T. Hajiaghayi; M. Ghodsi; M. Mahdian; V.S. Mirrokni;

Path-matching in graphs with length constraints,
Networks, Vol 39, No. 4, pp. 210-215, 2002.

  • 3     M.T. Hajiaghayi; Y. Ganjali;

A Note on the Consecutive Ones Submatrix Problem,
Information Processing Letters, Vol 83, No. 3, pp. 163-166, 2002.

  • 2    M.T. Hajiaghayi; N. Nishimura; P. Ragde; D. Thilikos;

Fast approximation schemes for K_{3,3}-minor-free or K_{5}-minor-free graphs,

Electronic Notes in Discrete Mathematics Vol 10, 2001.  A preliminary version appeared in  Proc. Euroconference on Combinatorics, Graph Theory and Applications,  EuroCOMB'01,  Sep. 2001: 158-163.

  • 1    M.T. Hajiaghaee1; E.S. Mahmoodian; V.S. Mirrokni; A. Saberi; R. Tusserkani;

On the simultaneous edge-coloring conjecture,
Discrete Mathematics 216 (2000), no. 1-3, 267--272.  

 

Conference and Submitted Papers (excluding those that have already appeared in journals)

  • 38  E.D. Demaine; M.T. Hajiaghayi; D. Marx;

Minimizing movement: fixed-parameter tractability,

Submitted.

  • 37  E.D. Demaine; M.T. Hajiaghayi; K. Kawarabayashi;

Decomposition, approximation, and coloring of odd-minor-free graphs,

Submitted.

  • 36   E.D. Demaine; M.T. Hajiaghayi; K. Kawarabayashi;

Approximation algorithms via structural results for apex-minor-free graphs,

Submitted.

  • 35   E.D. Demaine; M.T. Hajiaghayi; H. Mahini; M. Zadimoghadam;

The price of anarchy in cooperative network creation.

 Submitted.

  • 34   E.D. Demaine; M.  Badoiu, M.T. Hajiaghayi; A. Sidiropoulos; M. Zadimoghadam;

Ordinal embedding: approximation algorithms and dimensionality reduction.

 Submitted.

  • 33  I. Diakonikolas; D. S. Johnson; Y. Gu; H. Karloff; etc.;

Robust Internet server placement with high availability.

 Submitted.

  • 32  A. Blum; M.T. Hajiaghayi; K. Ligett; A. Roth;

Regret minimization and the price of total anarchy.

In Proceedings of the 40th ACM Symposium on Theory of Computing (STOC), Victoria, BC, May 2008.  To appear.

  • 31  E.D. Demaine; M.T. Hajiaghayi; H. Mahini; M. Zadimoghadam;

The price of anarchy in network creation games,

In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), Portland, Oregon, August 2007, pages 292--298.

  • 30  E.D. Demaine; M. Ghodsi; M.T. Hajiaghayi; A.S. Sayedi; M. Zadimoghadam;

Scheduling to minimize gaps and power consumption,

In Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, (SPAA), San Diego, CA, June 2007, pages 46--54.

  • 29 A. Gupta; M.T. Hajiaghayi; A. Kumar;

Stochastic Steiner Tree with Non-Uniform Inflation,

In Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, (APPROX), Princeton, NJ, August 2007, pages 134---148.

  • 28  M.T. Hajiaghayi; R.D. Kleinberg; T. Sandholm;

Automated online mechanism design and Prophet inequalities,
In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI), Vancouver, Canada, July 2007, pages 58--65.

  • 27  M.F. Balcan; A. Blum; H. Chan; M.T. Hajiaghayi;

A Theory of Loss-leaders: Making Money by Pricing below Cost,
In Proceedings of the 3rd International Workshop on Internet And Network Economics (WINE), San Diego, CA, December 2007. To appear. Journal version to be submitted to Journal of Computer and System Sciences.

  • 26  A. Gupta; M.T. Hajiaghayi; V. Nagarajan; R. Ravi;

Improved Algorithms for the dial-and-ride problem,
In Proceedings of the 15th Annual European Symposium on Algorithms (ESA), Eilat, October 2007, pages 241--252. Journal version submitted to ACM Transactions on Algorithms.

  • 25  E.D. Demaine; M.T. Hajiaghayi; H. Mahini; S. Oveisgharan; A. Sayedi; M. Zadimoghadam;

Minimizing movement,
In Proceedings of  the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  New Orleans, LA, January 7-9, 2007, pp.  258--267.  Journal version invited to a special issue of ACM Transactions on Algorithms for selected papers from  SODA 2007.

  • 24  C. Chekuri; M.T. Hajiaghayi; G. Kortsarz; M. R. Salavatipour;

                Approximation algorithms for node–weighted  buy-at-bulk networks,

In  Proceedings of  the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  New Orleans, LA, January 7-9, 2007, pp. 1265--1274.

  • 23  E.D. Demaine; M.T. Hajiaghayi; B. Mohar;

Approximation algorithms via contraction decomposition,
In  Proceedings of  the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  New Orleans, LA, January 7-9, 2007, pp. 278--287. Journal version submitted to Combinatorica.

  • 22  M.T. Hajiaghayi; R. D. Kleinberg; T. Leighton;

Semi-oblivious routing: Lower bounds,
In Proceedings of  the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  New Orleans, LA, January 7-9, 2007, pp. 929--938.

       

 ** A brief announcement of this paper appeared in Proceedings of 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Cambridge, MA, July 30 - August 2, 2006, pp. 234.

  • 21  C. Chekuri; M.T. Hajiaghayi; G. Kortsarz; M. R. Salavatipour;

                Approximation algorithms for non-uniform buy-at-bulk network design problems

 In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, PA, October 22-24, 2006, pp. 677--686. Journal version submitted to Journal of the ACM.

  • 20  M.T. Hajiaghayi; L.E. Li; V.S. Mirrokni; M. Thottan;

Bandwidth Sharing VPN Network Design for Multi-class Traffic with Application to VoIP,
In Proceedings of the 25th Annual IEEE Conference on Computer Communications (INFOCOM), Barcelona, Spain, April 23-29, 2006.

  • 19  M. Charikar; M.T. Hajiaghayi;  H. Karloff; S. Rao;

l22 spreading metrics for vertex ordering problems,
In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver,  Miami, Florida, January 22-24, pp.1018-1027. Journal version submitted to Algorithmica.

  • 18  A. Gupta; M.T. Hajiaghayi;  H. Raecke;

Oblivious Network Design,
In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver,  Miami, Florida, January 22-24, 2006, pp. 970-979.

  • 17  M.T. Hajiaghayi; R. D. Kleinberg; T. Leighton; H. Raecke;

 New lower bounds for oblivious routing in undirected graphs,
 In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, Miami, Florida, January 22-24, 2006, pp. 918-927. Journal version submitted to SIAM Journal on Computing.

  • 16  M.T. Hajiaghayi; R. D. Kleinberg; T. Leighton;

 Improved lower and upper bounds for universal TSP in planar metrics,
In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  Vancouver,  Miami, Florida, January 22-24, 2006, pp.649-658.

  • 15  M.T. Hajiaghayi; K. Jain;

The Prize-Collecting Generalized Steiner Tree Problem via a new approach of Primal-Dual Schema,
In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver,  Miami, Florida, January 22-24, 2006, pp. 631-640.

  • 14  M.T. Hajiaghayi; K. Jain; K. Konwar;  L.C. Lau; I.I. Mandoiu; V.V. Vazirani;

 Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping,
In Proceedings of International Workshop on Bioinformatics Research and Applications (IWBRA), University of Reading, UK, May 2006,  pp.758-766.

  • 13  E.D. Demaine; M.T. Hajiaghayi; K Kawarabayashi;

                Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring,

In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Pittsburgh, PA, October 23-25, 2005, pp.  637-646.

  • 12  K. Jain;  M.T. Hajiaghayi; K. Talwar;

The Generalized Deadlock Resolution Problem,
In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Lisbon, Portugal, July 2005, pp. 853-865. Journal version invited to Theoretical Computer Science special issue for selected papers from ICALP 2005.

  • 11  J.L. Bredin; E.D. Demaine; M.T. Hajiaghayi; D. Rus;

Deploying Sensor Nets with Guaranteed Capacity and Fault Tolerance,
In Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc),  Urbana-Champaign, IL, May 2005,  pp. 309--319. Journal version submitted to IEEE/ACM Transactions on Networking.

  • 10  M.T. Hajiahgayi; J.H. Kim; T. Leighton; H. Raecke;

         Oblivious routing in directed graphs with random demands,

In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pp. 193-201, Baltimore, MD, May 21-24, 2005.

  • 9  M.T. Hajiaghayi; R.D. Kleinberg; M. Mahdian; D.C. Parkes;

Online Auctions with Re-usable Goods,
In Proceedings of the 6th ACM Conference on Electronic Commerce (EC), pp. 165-174, Vancouver, Canada, June 5-8, 2005.

  • 8  E.D. Demaine; M.T. Hajiaghayi;

Bidimensionality: New Connections between FPT Algorithms and PTASs (full paper),
in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 590-601.

  • 7  Hajiaghayi, M.T.; Kleinberg, R.; Parkes, D.C.;

                Adaptive Limited-Supply Online Auctions (full paper),
                Proc. ACM Conference on Electronic Commerce (EC), pp. 71-80, May 17-20, 2004. New York.

  • 6   Hajiaghayi, M.T.; Demaine, E.D.;

Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications (full paper),
in Proceedings of  the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 840-849, January 11-13, 2004, New Orleans. See Tech. Report MIT-LCS-TR-903 for a more complete version.

  • 5   Hajiaghayi, M.T.; Sorkin, G.B.;

The Satisfiability Threshold of Random 3-SAT Is at Least 3.52,
arXiv:math.CO/0310193 v2 22 Oct 2003. See also IBM Research Report RC22942, 2003.

  • 4   Demaine, E.D.; Hajiaghayi, M.T.; Thilikos, D.;

1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor,
Proc. the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), September 17-21, 2002, Italy, Lecture Notes in Computer Science 2462, pp. 67-80, 2002.

  • 3   Hajiaghayi,  M.T; Jamzad, M.;

Simple, fast, and robust self-localization in environments similar to the robocup environment,
Proc. the 18th International Conference on CAD/CAM, Robotics and Factories of the future (CARS&FOF), Porto, Portugal, vol (2), pp:513-522, 2002. Journal version submitted.

  • 2    Hajiaghai1, M.T.; Jamzad, M; Sadjad, B. S.; Mirrokni, V. S.; Kazemi, M.; Chitsaz, H.; Heydarnoori, A.; Chiniforooshan E.;

 A Fast Vision System for Middle Size Robots in RoboCup,
The RoboCup 2001 International Symposium,  winner of The Best Engineering Challenge Award, Lecture Notes in Computer Science 2377, pp. 71-80, 2002.

  •  1     Hadji Aaghai1, T; Jamzad, M.; Foroughnassiraei, A.; Mirrokni, V.S.; Ghorbani, R.; Heydar Noori,  A.; Kazemi, M.; Chitsaz, H.; Mobasser, F.; Ebraahimi  M.; Gudarzi, M; Ghaffarzadeganet. N.;

A Goal Keeper for Middle  Size RoboCup,
RoboCup 2000, Lecture Notes in Computer Science 2019, 2001: 583-586. 


Thesis

  • Hajiaghayi, M.T.;

The bidimensionality Theory and Its Algorithmic Applications,
Ph.D. Thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, U.S.A., May 2005.

  • Hajiaghayi, M.T.;

 Algorithms for Graphs of (Locally) Bounded Treewidth,
M.Sc. Thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario,  Canada, September 2001.

Content of the thesis appeared in Journal papers [8], [10], and [26].

  •       Hajiaghayi, M.T.;

 Multicasting and Pseudomatching (in Persian),
B.Sc. Thesis, Department of Computer Engineering, Sharif University of Technology, Tehran, Iran, September 2000

            Content of the thesis appeared in Journal paper [4].

 Book

           Iranian Informatics Olympiad  shared with V.S. Mirrokni and Y. Ahmadi, Young Scholars Club Pub. Sept,  2000.

Some Other Manuscripts

     Hajiaghayi, M.T.; Comparing of SGML documents,  Appril 2001.

        Hajiaghayi, M.T.; Consecutive Ones Property, December 2000.

        Hajiaghayi, M.T.; Clustering algorithms in PBS,  Appril 2001.

        Hajiaghayi, M.T.; Mathematical Markup Language, Feb. 2001.

        Some educational papers (in Persian) published in Olympiad Quarterly and The Way to Olympiad magazines.

1 :The name is mis-spelled a bit in the publication.