default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Mahdian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c86]Yuan Deng
, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the Generalized Second-Price Auction for Value Maximizers. WWW 2024: 46-56- [i19]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - 2023
- [j35]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. Math. Oper. Res. 48(3): 1607-1629 (2023) - [c85]Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni:
Differentially Private Hierarchical Clustering with Provable Approximation Guarantees. ICML 2023: 14353-14375 - [c84]Mohammad Mahdian, Jieming Mao, Kangning Wang:
Regret Minimization with Noisy Observations. EC 2023: 963 - [i18]Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni:
Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees. CoRR abs/2302.00037 (2023) - [i17]Yangsibo Huang, Haotian Jiang, Daogao Liu, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni:
Learning across Data Owners with Joint Differential Privacy. CoRR abs/2305.15723 (2023) - [i16]Yuan Deng, Mohammad Mahdian, Jieming Mao, Vahab Mirrokni, Hanrui Zhang, Song Zuo:
Efficiency of the Generalized Second-Price Auction for Value Maximizers. CoRR abs/2310.03105 (2023) - 2022
- [c83]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. SODA 2022: 1613-1660 - [c82]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. SODA 2022: 3005-3042 - [i15]Mohammad Mahdian, Jieming Mao, Kangning Wang:
Regret Minimization with Noisy Observations. CoRR abs/2207.09435 (2022) - 2021
- [j34]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Management Strategies in Repeated Auctions. Oper. Res. 69(3): 859-876 (2021) - [c81]Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar:
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. AISTATS 2021: 559-567 - [c80]Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian:
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. AISTATS 2021: 1657-1665 - [i14]Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar:
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. CoRR abs/2101.10639 (2021) - [i13]Vaggos Chatziafratis, Mohammad Mahdian, Sara Ahmadian:
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT. CoRR abs/2102.11548 (2021) - [i12]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. CoRR abs/2106.02685 (2021) - [i11]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong:
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches. CoRR abs/2110.15533 (2021) - 2020
- [c79]Vaggos Chatziafratis, Grigory Yaroslavtsev, Euiwoong Lee, Konstantin Makarychev, Sara Ahmadian, Alessandro Epasto, Mohammad Mahdian:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. AISTATS 2020: 3121-3132 - [c78]Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian:
Fair Correlation Clustering. AISTATS 2020: 4195-4205 - [c77]Ehsan Emamjomeh-Zadeh, David Kempe, Mohammad Mahdian, Robert E. Schapire:
Interactive Learning of a Dynamic Structure. ALT 2020: 277-296 - [c76]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. NeurIPS 2020 - [c75]Alessandro Epasto, Mohammad Mahdian, Jieming Mao, Vahab S. Mirrokni, Lijie Ren:
Smoothly Bounding User Contributions in Differential Privacy. NeurIPS 2020 - [c74]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Emmanouil Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. NeurIPS 2020 - [c73]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget-Constrained Incentive Compatibility for Stationary Mechanisms. EC 2020: 607-608 - [i10]Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian:
Fair Correlation Clustering. CoRR abs/2002.02274 (2020) - [i9]Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang:
Fair Hierarchical Clustering. CoRR abs/2006.10221 (2020) - [i8]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Manolis Zampetakis:
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions. CoRR abs/2010.11450 (2020)
2010 – 2019
- 2019
- [j33]Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility testing and counting for uncertain segments. Theor. Comput. Sci. 779: 1-7 (2019) - [c72]Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian:
Clustering without Over-Representation. KDD 2019: 267-275 - [c71]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. NeurIPS 2019: 9676-9685 - [c70]Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod:
Response Prediction for Low-Regret Agents. WINE 2019: 31-44 - [e1]Sihem Amer-Yahia, Mohammad Mahdian, Ashish Goel, Geert-Jan Houben, Kristina Lerman, Julian J. McAuley, Ricardo Baeza-Yates, Leila Zia:
Companion of The 2019 World Wide Web Conference, WWW 2019, San Francisco, CA, USA, May 13-17, 2019. ACM 2019, ISBN 978-1-4503-6675-5 [contents] - [i7]Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian:
Clustering without Over-Representation. CoRR abs/1905.12753 (2019) - [i6]Saeed Alaei, Ashwinkumar Badanidiyuru, Mohammad Mahdian, Sadra Yazdanbod:
Response Prediction for Low-Regret Agents. CoRR abs/1911.02056 (2019) - [i5]Sara Ahmadian, Vaggos Chatziafratis, Alessandro Epasto, Euiwoong Lee, Mohammad Mahdian, Konstantin Makarychev, Grigory Yaroslavtsev:
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection. CoRR abs/1912.06983 (2019) - 2018
- [c69]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark:
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA 2018: 2291-2310 - [c68]Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Song Zuo:
Incentive-Aware Learning for Large Markets. WWW 2018: 1369-1378 - [i4]Alex Fabrikant, Mohammad Mahdian, Andrew Tomkins:
SCRank: Spammer and Celebrity Ranking in Directed Social Networks. CoRR abs/1802.08204 (2018) - [i3]Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, Jon Schneider:
Contextual Bandits with Cross-learning. CoRR abs/1809.09582 (2018) - 2017
- [c67]Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility Testing and Counting for Uncertain Segments. CCCG 2017: 84-88 - [c66]Santiago R. Balseiro, Anthony Kim, Mohammad Mahdian, Vahab S. Mirrokni:
Budget Management Strategies in Repeated Auctions. WWW 2017: 15-23 - 2016
- [j32]Mohammad Mahdian, Mukund Sundararajan:
Robust Mechanisms for Sponsored Search. EAI Endorsed Trans. Serious Games 3(10): e2 (2016) - [j31]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
An Algorithmic View of Voting. SIAM J. Discret. Math. 30(4): 1978-1996 (2016) - [c65]Hoda Heidari, Mohammad Mahdian, Umar Syed, Sergei Vassilvitskii, Sadra Yazdanbod:
Pricing a Low-regret Seller. ICML 2016: 2559-2567 - [c64]Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian:
Community Detection on Evolving Graphs. NIPS 2016: 3522-3530 - [r2]Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. Encyclopedia of Algorithms 2016: 717-724 - 2015
- [j30]Mohammad Mahdian, Ebadollah S. Mahmoodian:
Sudoku Rectangle Completion (Extended Abstract). Electron. Notes Discret. Math. 49: 747-755 (2015) - [j29]Arpita Ghosh, Mohammad Mahdian, R. Preston McAfee, Sergei Vassilvitskii:
To Match or Not to Match: Economics of Cookie Matching in Online Advertising. ACM Trans. Economics and Comput. 3(2): 12:1-12:18 (2015) - [j28]Nicole Immorlica, Mohammad Mahdian:
Incentives in Large Random Two-Sided Markets. ACM Trans. Economics and Comput. 3(3): 14:1-14:25 (2015) - [c63]Mohammad Mahdian, Okke Schrijvers, Sergei Vassilvitskii:
Algorithmic Cartography: Placing Points of Interest and Ads on Maps. KDD 2015: 755-764 - [c62]Ravi Kumar, Mohammad Mahdian, Bo Pang, Andrew Tomkins, Sergei Vassilvitskii:
Driven by Food: Modeling Geographic Choice. WSDM 2015: 213-222 - 2014
- [j27]Flavio Chierichetti, Ravi Kumar, Mohammad Mahdian:
The complexity of LSH feasibility. Theor. Comput. Sci. 530: 89-101 (2014) - [c61]Flavio Chierichetti, Jon M. Kleinberg, Ravi Kumar, Mohammad Mahdian, Sandeep Pandey:
Event Detection via Communication Pattern Analysis. ICWSM 2014 - [c60]Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni:
Composable core-sets for diversity and coverage maximization. PODS 2014: 100-108 - [c59]Samuel Ieong, Mohammad Mahdian, Sergei Vassilvitskii:
Advertising in a stream. WWW 2014: 29-38 - 2013
- [c58]Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner:
Designing Markets for Daily Deals. WINE 2013: 82-95 - [i2]Yang Cai, Mohammad Mahdian, Aranyak Mehta, Bo Waggoner:
Designing Markets for Daily Deals. CoRR abs/1310.0548 (2013) - 2012
- [j26]A. A. Khanban, Mohammad Mahdian, Ebadollah S. Mahmoodian:
A linear algebraic approach to orthogonal arrays and Latin squares. Ars Comb. 105: 3-13 (2012) - [j25]Arpita Ghosh, Mohammad Mahdian:
Christmas Gift Exchange Games. Theory Comput. Syst. 50(1): 3-19 (2012) - [j24]Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Online Optimization with Uncertain Information. ACM Trans. Algorithms 8(1): 2:1-2:29 (2012) - [c57]Sharad Goel, David M. Pennock, Mohammad Mahdian, Daniel M. Reeves:
TrustBets: betting over an IOU network. AAMAS 2012: 1319-1320 - [c56]Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii:
Ad auctions with data. INFOCOM Workshops 2012: 184-189 - [c55]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin:
Algorithms on evolving graphs. ITCS 2012: 149-160 - [c54]Bahman Bahmani, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
PageRank on an evolving graph. KDD 2012: 24-32 - [c53]Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii:
Ad Auctions with Data. SAGT 2012: 168-179 - [c52]Mohammad Mahdian, Arpita Ghosh, R. Preston McAfee, Sergei Vassilvitskii:
To match or not to match: economics of cookie matching in online advertising. EC 2012: 741-753 - 2011
- [j23]Mohammad Mahdian:
Fighting censorship with algorithms. XRDS 18(2): 41 (2011) - [j22]Mohammad Mahdian, Ying Xu:
Stochastic kronecker graphs. Random Struct. Algorithms 38(4): 453-466 (2011) - [j21]Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola:
Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011) - [j20]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
Sorting and selection on dynamic data. Theor. Comput. Sci. 412(24): 2564-2576 (2011) - [c51]Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee:
The Multiple Attribution Problem in Pay-Per-Conversion Advertising. SAGT 2011: 31-43 - [c50]Mohammad Mahdian, Qiqi Yan:
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. STOC 2011: 597-606 - 2010
- [j19]Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni:
Secure Overlay Network Design. Algorithmica 57(1): 82-96 (2010) - [j18]Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Advertisement allocation for generalized second-pricing schemes. Oper. Res. Lett. 38(6): 571-576 (2010) - [c49]Arpita Ghosh, Mohammad Mahdian:
Christmas Gift Exchange Games. FUN 2010: 228-236 - [c48]Mohammad Mahdian:
Fighting Censorship with Algorithms. FUN 2010: 296-306 - [c47]Ravi Kumar, Mohammad Mahdian, Mary McGlohon:
Dynamics of conversations. KDD 2010: 553-562 - [c46]Sai-Ming Li, Mohammad Mahdian, Randolph Preston McAfee:
Value of Learning in Sponsored Search Auctions. WINE 2010: 294-305
2000 – 2009
- 2009
- [j17]Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman:
The Minimum Distance of Turbo-Like Codes. IEEE Trans. Inf. Theory 55(1): 6-15 (2009) - [c45]Mohammad Mahdian, Grant Wang:
Clustering-Based Bidding Languages for Sponsored Search. ESA 2009: 167-178 - [c44]Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra:
Approximating Matches Made in Heaven. ICALP (1) 2009: 266-278 - [c43]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal:
Sort Me If You Can: How to Sort Dynamic Data. ICALP (2) 2009: 339-350 - [c42]Ravi Kumar, Mohammad Mahdian, Amin Sayedi:
Mechanism Design for Complexity-Constrained Bidders. WINE 2009: 513-520 - 2008
- [j16]Jacob Fox, Mohammad Mahdian, Rados Radoicic:
Rainbow solutions to the Sidon equation. Discret. Math. 308(20): 4773-4778 (2008) - [j15]Mohammad Mahdian, Kerem Tomak:
Pay-Per-Action Model for On-line Advertising. Int. J. Electron. Commer. 13(2): 113-128 (2008) - [j14]Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu:
Deterministic Decentralized Search in Random Graphs. Internet Math. 5(1): 141-154 (2008) - [j13]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4(2): 24:1-24:25 (2008) - [c41]Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian:
Influence and correlation in social networks. KDD 2008: 7-15 - [c40]Arpita Ghosh, Mohammad Mahdian:
Charity auctions on social networks. SODA 2008: 1019-1028 - [c39]David Kempe, Mohammad Mahdian:
A Cascade Model for Externalities in Sponsored Search. WINE 2008: 585-596 - [c38]Mohammad Mahdian, Randolph Preston McAfee, David M. Pennock:
The Secretary Problem with a Hazard Rate Condition. WINE 2008: 708-715 - [c37]Arpita Ghosh, Mohammad Mahdian:
Externalities in online advertising. WWW 2008: 161-168 - [r1]Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. Encyclopedia of Algorithms 2008 - 2007
- [c36]Mohammad Mahdian, Kerem Tomak:
Towards a pay-per-action model in sponsored search. ICEC 2007: 87-88 - [c35]Mohammad Mahdian, Kerem Tomak:
Pay-per-action model for online advertising. AdKDD@KDD 2007: 1-6 - [c34]Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar:
Balloon Popping With Applications to Ascending Auctions. FOCS 2007: 104-112 - [c33]Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni:
Robust Combinatorial Optimization with Exponential Scenarios. IPCO 2007: 439-453 - [c32]Nicole Immorlica, Jon M. Kleinberg, Mohammad Mahdian, Tom Wexler:
The role of compatibility in the diffusion of technologies through social networks. EC 2007: 75-83 - [c31]Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Allocating online advertisement space with unreliable estimates. EC 2007: 288-294 - [c30]Mohammad Mahdian, Ying Xu:
Stochastic Kronecker Graphs. WAW 2007: 179-186 - [c29]Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu:
Deterministic Decentralized Search in Random Graphs. WAW 2007: 187-194 - [c28]Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, David M. Pennock, Ryan Fugger:
Mechanism Design on Trust Networks. WINE 2007: 257-268 - [c27]Mohammad Mahdian, Kerem Tomak:
Pay-per-action Model for Online Advertising. WINE 2007: 549-557 - [c26]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian:
Dynamics of bid optimization in online advertisement auctions. WWW 2007: 531-540 - 2006
- [j12]Mohammad Mahdian, Yinyu Ye, Jiawei Zhang:
Approximation Algorithms for Metric Facility Location Problems. SIAM J. Comput. 36(2): 411-432 (2006) - [j11]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing Partial Rankings. SIAM J. Discret. Math. 20(3): 628-648 (2006) - [c25]Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni:
Secure Overlay Network Design. AAIM 2006: 354-366 - [c24]Mohammad Mahdian:
Random popular matchings. EC 2006: 238-242 - [c23]Mohammad Mahdian, Amin Saberi:
Multi-unit auctions with unknown supply. EC 2006: 243-249 - [c22]Uriel Feige, Mohammad Mahdian:
Finding small balanced separators. STOC 2006: 375-384 - [c21]Nicole Immorlica, Kamal Jain, Mohammad Mahdian:
Game-Theoretic Aspects of Designing Hyperlink Structures. WINE 2006: 150-161 - [c20]Nicole Immorlica, Robert D. Kleinberg, Mohammad Mahdian:
Secretary Problems with Competing Employers. WINE 2006: 389-400 - 2005
- [j10]Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko:
Minimizing Makespan in No-Wait Job Shops. Math. Oper. Res. 30(4): 817-831 (2005) - [c19]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Mohammad Mahdian, Amin Saberi:
Multi-unit auctions with budget-constrained bidders. EC 2005: 44-51 - [c18]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes:
Online auctions with re-usable goods. EC 2005: 165-174 - [c17]Nicole Immorlica, Mohammad Mahdian:
Marriage, honesty, and stability. SODA 2005: 53-62 - [c16]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Limitations of cross-monotonic cost sharing schemes. SODA 2005: 602-611 - [c15]Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni:
Cycle Cover with Short Cycles. STACS 2005: 641-653 - [c14]Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Kunal Talwar:
Click Fraud Resistant Methods for Learning Click-Through Rates. WINE 2005: 34-45 - [c13]Kamal Jain, Mohammad Mahdian:
Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units. WINE 2005: 788-792 - 2004
- [j9]Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian:
On the forced matching numbers of bipartite graphs. Discret. Math. 281(1-3): 1-12 (2004) - [c12]Lisa Fleischer, Kamal Jain, Mohammad Mahdian:
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. FOCS 2004: 277-285 - [c11]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - [c10]Ranveer Chandra, Lili Qiu, Kamal Jain, Mohammad Mahdian:
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks. ICNP 2004: 271-282 - [c9]Christian Borgs, Jennifer T. Chayes, Mohammad Mahdian, Amin Saberi:
Exploring the community structure of newsgroups. KDD 2004: 783-787 - [c8]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 - 2003
- [j8]Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic:
Rainbow Arithmetic Progressions and Anti-Ramsey Results. Comb. Probab. Comput. 12(5-6): 599-620 (2003) - [j7]Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6): 795-824 (2003) - [j6]Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
The facility location problem with general cost functions. Networks 42(1): 42-47 (2003) - [c7]Mohammad Mahdian, Martin Pál:
Universal Facility Location. ESA 2003: 409-421 - [c6]Kamal Jain, Mohammad Mahdian, Amin Saberi:
Approximating Market Equilibria. RANDOM-APPROX 2003: 98-108 - [c5]Mohammad Mahdian, Yingyu Ye, Jiawei Zhang:
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. RANDOM-APPROX 2003: 129-140 - [c4]Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour:
Packing Steiner trees. SODA 2003: 266-274 - 2002
- [j5]Mohammad Mahdian:
On the computational complexity of strong edge coloring. Discret. Appl. Math. 118(3): 239-248 (2002) - [j4]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002) - [c3]Mohammad Mahdian, Yinyu Ye, Jiawei Zhang:
Improved Approximation Algorithms for Metric Facility Location Problems. APPROX 2002: 229-242 - [c2]Kamal Jain, Mohammad Mahdian, Amin Saberi:
A new greedy approach for facility location problems. STOC 2002: 731-740 - [i1]Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP. CoRR cs.DS/0207028 (2002) - 2001
- [c1]Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani:
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. RANDOM-APPROX 2001: 127-137 - 2000
- [j3]Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani:
On a conjecture of Keedwell and the cycle double cover conjecture. Discret. Math. 216(1-3): 287-292 (2000) - [j2]Mohammad Mahdian:
The strong chromatic index of C4-free graphs. Random Struct. Algorithms 17(3-4): 357-375 (2000)
1990 – 1999
- 1999
- [j1]Mohammad Mahdian, Ebadollah S. Mahmoodian:
A Characterization of Uniquely 2-List Colorable Graphs. Ars Comb. 51 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
