Obserwuj
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi
ACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park
Zweryfikowany adres z cs.umd.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Improved approximation algorithms for minimum-weight vertex separators
U Feige, MT Hajiaghayi, JR Lee
SIAM J. Comput. 38 (2), 629-657, 2008
4122008
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
ED Demaine, FV Fomin, M Hajiaghayi, DM Thilikos
Journal of the ACM (JACM) 52 (6), 866-893, 2005
4002005
Deploying sensor networks with guaranteed capacity and fault tolerance
JL Bredin, ED Demaine, MT Hajiaghayi, D Rus
Proceedings of the 6th ACM international symposium on Mobile ad hoc …, 2005
3892005
Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks
M Bahramgiri, M Hajiaghayi, VS Mirrokni
Proceedings. Eleventh International Conference on Computer Communications …, 2002
301*2002
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
MT Hajiaghayi, N Immorlica, VS Mirrokni
IEEE/ACM Transactions on Networking (TON) 15 (6), 1345-1358, 2007
269*2007
Automated online mechanism design and prophet inequalities
MT Hajiaghayi, R Kleinberg, T Sandholm
AAAI 7, 58-65, 2007
2402007
Adaptive limited-supply online auctions
MT Hajiaghayi, R Kleinberg, DC Parkes
Proceedings of the 5th ACM Conference on Electronic Commerce, 71-80, 2004
2392004
Algorithmic graph minor theory: Decomposition, approximation, and coloring
ED Demaine, MT Hajiaghayi, K Kawarabayashi
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 637-646, 2005
2282005
Algorithmic graph minor theory: Decomposition, approximation, and coloring
ED Demaine, MT Hajiaghayi, K Kawarabayashi
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer …, 2005
2282005
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, ...
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
219*2010
The bidimensionality theory and its algorithmic applications
ED Demaine, MT Hajiaghayi
The Computer Journal 51 (3), 292-302, 2008
2122008
To cache or not to cache: The 3G case
J Erman, A Gerber, M Hajiaghayi, D Pei, S Sen, O Spatscheck
IEEE Internet Computing 15 (2), 27-34, 2011
2002011
Regret minimization and the price of total anarchy
A Blum, MT Hajiaghayi, K Ligett, A Roth
Proceedings of the fortieth annual ACM symposium on Theory of computing, 373-382, 2008
1972008
Online auctions with re-usable goods
MT Hajiaghayi, RD Kleinberg, M Mahdian, DC Parkes
Proceedings of the 6th ACM conference on Electronic commerce, 165-174, 2005
1952005
Submodular secretary problem and extensions
MH Bateni, MT Hajiaghayi, M Zadimoghaddam
ACM Transactions on Algorithms (TALG) 9 (4), 1-23, 2013
1902013
Bidimensionality: new connections between FPT algorithms and PTASs.
ED Demaine, MT Hajiaghayi
SODA 5, 590-601, 2005
1872005
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ED Demaine, FV Fomin, MT Hajiaghayi, DM Thilikos
ACM Transactions on Algorithms (TALG) 1 (1), 33-47, 2005
1862005
Combination can be hard: Approximability of the unique coverage problem
ED Demaine, U Feige, MT Hajiaghayi, MR Salavatipour
SIAM Journal on Computing 38 (4), 1464-1483, 2008
1702008
Cell breathing in wireless LANs: Algorithms and evaluation
P Bahl, MT Hajiaghayi, K Jain, SV Mirrokni, L Qiu, A Saberi
IEEE Transactions on Mobile Computing 6 (2), 164-178, 2007
1662007
Improved approximation algorithms for prize-collecting Steiner tree and TSP
A Archer, MH Bateni, MT Hajiaghayi, H Karloff
SIAM J. Comput. 40 (2), 309-332, 2009
1592009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20