Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Seddighin, Saeed; Stein, Cliff Fast algorithms for knapsack via convolution and prediction. (English) Zbl 1427.68376 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1269-1282 (2018). MSC: 68W40 90C27 90C39 PDFBibTeX XMLCite \textit{M. Bateni} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 1269--1282 (2018; Zbl 1427.68376) Full Text: DOI arXiv
Dehghani, Sina; Ehsani, Soheil; Hajiaghayi, Mohammad; Liaghat, Vahid; Seddighin, Saeed Stochastic \(k\)-server: how should Uber work? (English) Zbl 1442.68274 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 126, 14 p. (2017). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{S. Dehghani} et al., LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 126, 14 p. (2017; Zbl 1442.68274) Full Text: DOI arXiv
Bhangale, Amey; Gandhi, Rajiv; Hajiaghayi, Mohammad T.; Khandekar, Rohit; Kortsarz, Guy Bi-covering: covering edges with two small subsets of vertices. (English) Zbl 1380.90230 SIAM J. Discrete Math. 31, No. 4, 2626-2646 (2017). MSC: 90C27 05C85 68W25 PDFBibTeX XMLCite \textit{A. Bhangale} et al., SIAM J. Discrete Math. 31, No. 4, 2626--2646 (2017; Zbl 1380.90230) Full Text: DOI
Hajiaghayi, Mohammad Taghi; Khandekar, Rohit; Khani, Mohammad Reza; Kortsarz, Guy Approximation algorithms for movement repairmen. (English) Zbl 1445.68348 ACM Trans. Algorithms 12, No. 4, Article No. 54, 38 p. (2016). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{M. T. Hajiaghayi} et al., ACM Trans. Algorithms 12, No. 4, Article No. 54, 38 p. (2016; Zbl 1445.68348) Full Text: DOI arXiv
Alon, Noga; Demaine, Erik D.; Hajiaghayi, Mohammadtaghi; Kanellopoulos, Panagiotis; Leighton, Tom Correction: “Basic network creation games”. (English) Zbl 1302.90163 SIAM J. Discrete Math. 28, No. 3, 1638-1640 (2014). MSC: 90C27 05C85 91A06 PDFBibTeX XMLCite \textit{N. Alon} et al., SIAM J. Discrete Math. 28, No. 3, 1638--1640 (2014; Zbl 1302.90163) Full Text: DOI
Bateni, Mohammadhossein; Hajiaghayi, Mohammadtaghi; Zadimoghaddam, Morteza Submodular secretary problem and extensions. (English) Zbl 1301.91016 ACM Trans. Algorithms 9, No. 4, Article No. 32, 23 p. (2013). MSC: 91B26 68W27 90C27 PDFBibTeX XMLCite \textit{M. Bateni} et al., ACM Trans. Algorithms 9, No. 4, Article No. 32, 23 p. (2013; Zbl 1301.91016) Full Text: DOI Link
Hajiaghayi, MohammadTaghi; Khandekar, Rohit; Khani, M. Reza; Kortsarz, Guy Approximation algorithms for movement repairmen. (English) Zbl 1405.68444 Raghavendra, Prasad (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 16th international workshop, APPROX 2013, and 17th international workshop, RANDOM 2013, Berkeley, CA, USA, August 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40327-9/pbk). Lecture Notes in Computer Science 8096, 218-232 (2013). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{M. Hajiaghayi} et al., Lect. Notes Comput. Sci. 8096, 218--232 (2013; Zbl 1405.68444) Full Text: DOI arXiv
Alaei, Saeed; Hajiaghayi, MohammadTaghi; Liaghat, Vahid The online stochastic generalized assignment problem. (English) Zbl 1405.68450 Raghavendra, Prasad (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 16th international workshop, APPROX 2013, and 17th international workshop, RANDOM 2013, Berkeley, CA, USA, August 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40327-9/pbk). Lecture Notes in Computer Science 8096, 11-25 (2013). MSC: 68W27 90B60 90C27 PDFBibTeX XMLCite \textit{S. Alaei} et al., Lect. Notes Comput. Sci. 8096, 11--25 (2013; Zbl 1405.68450) Full Text: DOI
Alon, Noga; Demaine, Erik D.; Hajiaghayi, Mohammad T.; Leighton, Tom Basic network creation games. (English) Zbl 1273.90167 SIAM J. Discrete Math. 27, No. 2, 656-668 (2013); correction ibid. 28, No. 3, 1638-1640 (2014). MSC: 90C27 05C85 91A06 PDFBibTeX XMLCite \textit{N. Alon} et al., SIAM J. Discrete Math. 27, No. 2, 656--668 (2013; Zbl 1273.90167) Full Text: DOI Link
Hajiaghayi, Mohammadtaghi; Khandekar, Rohit; Kortsarz, Guy; Nutov, Zeev Prize-collecting Steiner Network problems. (English) Zbl 1301.90079 ACM Trans. Algorithms 9, No. 1, Article No. 2, 13 p. (2012). MSC: 90C27 68W25 90C05 90C35 90C59 PDFBibTeX XMLCite \textit{M. Hajiaghayi} et al., ACM Trans. Algorithms 9, No. 1, Article No. 2, 13 p. (2012; Zbl 1301.90079) Full Text: DOI
Hajiaghayi, M.; Khandekar, R.; Kortsarz, G. Local search algorithms for the red-blue median problem. (English) Zbl 1262.90146 Algorithmica 63, No. 4, 795-814 (2012). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hajiaghayi} et al., Algorithmica 63, No. 4, 795--814 (2012; Zbl 1262.90146) Full Text: DOI
Archer, Aaron; Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Karloff, Howard Improved approximation algorithms for prize-collecting Steiner tree and TSP. (English) Zbl 1223.68125 SIAM J. Comput. 40, No. 2, 309-332 (2011). MSC: 68W25 90C27 05C85 PDFBibTeX XMLCite \textit{A. Archer} et al., SIAM J. Comput. 40, No. 2, 309--332 (2011; Zbl 1223.68125) Full Text: DOI
Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. Approximation algorithms for nonuniform buy-at-bulk network design. (English) Zbl 1207.90019 SIAM J. Comput. 39, No. 5, 1772-1798 (2010). MSC: 90B10 90C27 90C59 90C60 PDFBibTeX XMLCite \textit{C. Chekuri} et al., SIAM J. Comput. 39, No. 5, 1772--1798 (2010; Zbl 1207.90019) Full Text: DOI
Hajiaghayi, Mohammad Taghi; Khandekar, Rohit; Kortsarz, Guy; Mestre, Julián The checkpoint problem. (English) Zbl 1306.90128 Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 219-231 (2010). MSC: 90C27 68Q17 68W25 90C35 PDFBibTeX XMLCite \textit{M. T. Hajiaghayi} et al., Lect. Notes Comput. Sci. 6302, 219--231 (2010; Zbl 1306.90128) Full Text: DOI
Bateni, MohammadHossein; Hajiaghayi, MohammadTaghi; Zadimoghaddam, Morteza Submodular secretary problem and extensions. (English) Zbl 1305.91158 Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 39-52 (2010). MSC: 91B26 60G40 68W25 90C27 PDFBibTeX XMLCite \textit{M. Bateni} et al., Lect. Notes Comput. Sci. 6302, 39--52 (2010; Zbl 1305.91158) Full Text: DOI Link
Hajiaghayi, MohammadTaghi; Khandekar, Rohit; Kortsarz, Guy Budgeted red-blue median and its generalizations. (English) Zbl 1287.90054 de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 314-325 (2010). MSC: 90C27 68W25 90C59 PDFBibTeX XMLCite \textit{M. Hajiaghayi} et al., Lect. Notes Comput. Sci. 6346, 314--325 (2010; Zbl 1287.90054) Full Text: DOI
Hajiaghayi, MohammadTaghi; Khandekar, Rohit; Kortsarz, Guy; Nutov, Zeev Prize-collecting Steiner network problems. (English) Zbl 1285.90049 Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 14th international conference, IPCO 2010, Lausanne, Switzerland, June 9–11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13035-9/pbk). Lecture Notes in Computer Science 6080, 71-84 (2010). MSC: 90C27 68W25 90C35 90C59 PDFBibTeX XMLCite \textit{M. Hajiaghayi} et al., Lect. Notes Comput. Sci. 6080, 71--84 (2010; Zbl 1285.90049) Full Text: DOI
Bateni, Mohammad Hossein; Hajiaghayi, Mohammad Taghi Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. (English) Zbl 1422.68293 Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 805-814 (2009). MSC: 68W25 68Q17 90B80 90C27 PDFBibTeX XMLCite \textit{M. H. Bateni} and \textit{M. T. Hajiaghayi}, in: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4--6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 805--814 (2009; Zbl 1422.68293) Full Text: Link
Archer, Aaron; Bateni, MohammadHossein; Hajiaghayi MohammadTaghi; Karloff, Howard Improved approximation algorithms for prize-collecting Steiner tree and TSP. (English) Zbl 1292.68161 2009 IEEE 50th annual symposium on foundations of computer science – FOCS 2009. Proceedings of the symposium, Atlanta, GA, USA, October 24–27, 2009. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-3850-1; 978-1-4244-5116-6/ebook). 427-436 (2009). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{A. Archer} et al., in: 2009 IEEE 50th annual symposium on foundations of computer science -- FOCS 2009. Proceedings of the symposium, Atlanta, GA, USA, October 24--27, 2009. Los Alamitos, CA: IEEE Computer Society. 427--436 (2009; Zbl 1292.68161) Full Text: DOI
Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Klein, Philip N. Node-weighted Steiner tree and group Steiner tree in planar graphs. (English) Zbl 1248.68556 Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02926-4/pbk). Lecture Notes in Computer Science 5555, 328-340 (2009). MSC: 68W25 05C10 05C85 90C27 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 5555, 328--340 (2009; Zbl 1248.68556) Full Text: DOI Link
Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Mohar, Bojan Approximation algorithms via contraction decomposition. (English) Zbl 1302.05185 Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 278-287 (2007). MSC: 05C85 05C83 68R10 68W25 90C27 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., in: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7--9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 278--287 (2007; Zbl 1302.05185)
Hajiaghayi, Mohammad T.; Kortsarz, Guy; Mirrokni, Vahab S.; Nutov, Zeev Power optimization for connectivity problems. (English) Zbl 1192.90173 Math. Program. 110, No. 1 (B), 195-208 (2007). MSC: 90C27 90C59 05C85 68R10 68W25 PDFBibTeX XMLCite \textit{M. T. Hajiaghayi} et al., Math. Program. 110, No. 1 (B), 195--208 (2007; Zbl 1192.90173) Full Text: DOI
Hajiaghayi, Mohammad T.; Kleinberg, Robert; Leighton, Tom Improved lower and upper bounds for universal TSP in planar metrics. (English) Zbl 1192.90172 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 649-658 (2006). MSC: 90C27 68Q25 05C85 54E35 PDFBibTeX XMLCite \textit{M. T. Hajiaghayi} et al., in: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, FL, January 22--24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 649--658 (2006; Zbl 1192.90172) Full Text: DOI
Demaine, Erik D.; Hajiaghayi, MohammadTaghi Bidimensionality: new connections between FPT algorithms and PTASs. (English) Zbl 1297.05056 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 590-601 (2005). MSC: 05C10 68W25 90C27 PDFBibTeX XMLCite \textit{E. D. Demaine} and \textit{M. Hajiaghayi}, in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 590--601 (2005; Zbl 1297.05056)
Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. The bidimensional theory of bounded-genus graphs. (English) Zbl 1100.05095 Fiala, Jiří(ed.) et al., Mathematical foundations of computer science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 191-203 (2004). MSC: 05C85 05C83 05C10 90C27 68R10 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 3153, 191--203 (2004; Zbl 1100.05095) Full Text: DOI
Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. 1. 5-approximation for treewidth of graphs excluding a graph with one crossing as a minor. (English) Zbl 1013.90125 Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2462, 67-80 (2002). MSC: 90C27 68W25 05C85 90C59 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 2462, 67--80 (2002; Zbl 1013.90125) Full Text: Link