Mohammad Mahdian

Google Publications

Previous Publications

  •  

    Algorithms on evolving graphs

    Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin

    ITCS (2012), pp. 149-160

  •  

    Christmas Gift Exchange Games

    Arpita Ghosh, Mohammad Mahdian

    Theory Comput. Syst., vol. 50 (2012), pp. 3-19

  •  

    Online Optimization with Uncertain Information

    Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi

    ACM Transactions on Algorithms, vol. 8 (2012), pp. 2

  •  

    TrustBets: betting over an IOU network

    Sharad Goel, David M. Pennock, Mohammad Mahdian, Daniel M. Reeves

    AAMAS (2012), pp. 1319-1320

  •  

    Fighting censorship with algorithms

    Mohammad Mahdian

    ACM Crossroads, vol. 18 (2011), pp. 41

  •  

    Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs

    Mohammad Mahdian, Qiqi Yan

    STOC (2011), pp. 597-606

  •  

    Sorting and selection on dynamic data

    Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal

    Theor. Comput. Sci., vol. 412 (2011), pp. 2564-2576

  •  

    Special Section on Foundations of Computer Science

    Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola

    SIAM J. Comput., vol. 40 (2011), pp. 770

  •  

    Stochastic kronecker graphs

    Mohammad Mahdian, Ying Xu 0002

    Random Struct. Algorithms, vol. 38 (2011), pp. 453-466

  •  

    The Multiple Attribution Problem in Pay-Per-Conversion Advertising

    Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee

    SAGT (2011), pp. 31-43

  •  

    Advertisement allocation for generalized second-pricing schemes

    Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi

    Oper. Res. Lett., vol. 38 (2010), pp. 571-576

  •  

    Christmas Gift Exchange Games

    Arpita Ghosh, Mohammad Mahdian

    FUN (2010), pp. 228-236

  •  

    Dynamics of conversations

    Ravi Kumar, Mohammad Mahdian, Mary McGlohon

    KDD (2010), pp. 553-562

  •  

    Fighting Censorship with Algorithms

    Mohammad Mahdian

    FUN (2010), pp. 296-306

  •   

    Secure Overlay Network Design

    Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni

    Algorithmica, vol. 57 (2010), pp. 82-96

  •  

    Value of Learning in Sponsored Search Auctions

    Sai-Ming Li, Mohammad Mahdian, Randolph Preston McAfee

    WINE (2010), pp. 294-305

  •  

    Approximating Matches Made in Heaven

    Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra

    ICALP (1) (2009), pp. 266-278

  •  

    Clustering-Based Bidding Languages for Sponsored Search

    Mohammad Mahdian, Grant Wang

    ESA (2009), pp. 167-178

  •  

    Mechanism Design for Complexity-Constrained Bidders

    Ravi Kumar, Mohammad Mahdian, Amin Sayedi

    WINE (2009), pp. 513-520

  •  

    Sort Me If You Can: How to Sort Dynamic Data

    Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian, Eli Upfal

    ICALP (2) (2009), pp. 339-350

  •  

    The Minimum Distance of Turbo-Like Codes

    Louay Bazzi, Mohammad Mahdian, Daniel A. Spielman

    IEEE Transactions on Information Theory, vol. 55 (2009), pp. 6-15

  •  

    A Cascade Model for Externalities in Sponsored Search

    David Kempe, Mohammad Mahdian

    WINE (2008), pp. 585-596

  •  

    Charity auctions on social networks

    Arpita Ghosh, Mohammad Mahdian

    SODA (2008), pp. 1019-1028

  •  

    Deterministic Decentralized Search in Random Graphs

    Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu 0002

    Internet Mathematics, vol. 5 (2008), pp. 141-154

  •  

    Externalities in online advertising

    Arpita Ghosh, Mohammad Mahdian

    WWW (2008), pp. 161-168

  •  

    Facility Location

    Karen Aardal, Jaroslaw Byrka, Mohammad Mahdian

    Encyclopedia of Algorithms (2008)

  •  

    Influence and correlation in social networks

    Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian

    KDD (2008), pp. 7-15

  •   

    Limitations of cross-monotonic cost-sharing schemes

    Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni

    ACM Transactions on Algorithms, vol. 4 (2008)

  •  

    Rainbow solutions to the Sidon equation

    Jacob Fox, Mohammad Mahdian, Rados Radoicic

    Discrete Mathematics, vol. 308 (2008), pp. 4773-4778

  •  

    The Secretary Problem with a Hazard Rate Condition

    Mohammad Mahdian, Randolph Preston McAfee, David Pennock

    WINE (2008), pp. 708-715

  •  

    Allocating online advertisement space with unreliable estimates

    Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi

    ACM Conference on Electronic Commerce (2007), pp. 288-294

  •  

    Balloon Popping With Applications to Ascending Auctions

    Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Kunal Talwar

    FOCS (2007), pp. 104-112

  •  

    Deterministic Decentralized Search in Random Graphs

    Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu 0002

    WAW (2007), pp. 187-194

  •  

    Dynamics of bid optimization in online advertisement auctions

    Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian

    WWW (2007), pp. 531-540

  •  

    Mechanism Design on Trust Networks

    Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, David M. Pennock, Ryan Fugger

    WINE (2007), pp. 257-268

  •  

    Pay-per-action Model for Online Advertising

    Mohammad Mahdian, Kerem Tomak

    WINE (2007), pp. 549-557

  •   

    Robust Combinatorial Optimization with Exponential Scenarios

    Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni

    IPCO (2007), pp. 439-453

  •  

    Stochastic Kronecker Graphs

    Mohammad Mahdian, Ying Xu 0002

    WAW (2007), pp. 179-186

  •  

    The role of compatibility in the diffusion of technologies through social networks

    Nicole Immorlica, Jon M. Kleinberg, Mohammad Mahdian, Tom Wexler

    ACM Conference on Electronic Commerce (2007), pp. 75-83

  •  

    Towards a pay-per-action model in sponsored search

    Mohammad Mahdian, Kerem Tomak

    ICEC (2007), pp. 87-88

  •  

    Approximation Algorithms for Metric Facility Location Problems

    Mohammad Mahdian, Yinyu Ye, Jiawei Zhang

    SIAM J. Comput., vol. 36 (2006), pp. 411-432

  •  

    Comparing Partial Rankings

    Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee

    SIAM J. Discrete Math., vol. 20 (2006), pp. 628-648

  •  

    Finding small balanced separators

    Uriel Feige, Mohammad Mahdian

    STOC (2006), pp. 375-384

  •  

    Game-Theoretic Aspects of Designing Hyperlink Structures

    Nicole Immorlica, Kamal Jain, Mohammad Mahdian

    WINE (2006), pp. 150-161

  •  

    Multi-unit auctions with unknown supply

    Mohammad Mahdian, Amin Saberi

    ACM Conference on Electronic Commerce (2006), pp. 243-249

  •  

    Random popular matchings

    Mohammad Mahdian

    ACM Conference on Electronic Commerce (2006), pp. 238-242

  •  

    Secretary Problems with Competing Employers

    Nicole Immorlica, Robert D. Kleinberg, Mohammad Mahdian

    WINE (2006), pp. 389-400

  •   

    Secure Overlay Network Design

    Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni

    AAIM (2006), pp. 354-366

  •   

    Click Fraud Resistant Methods for Learning Click-Through Rates

    Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Kunal Talwar

    WINE (2005), pp. 34-45

  •  

    Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units

    Kamal Jain, Mohammad Mahdian

    WINE (2005), pp. 788-792

  •  

    Cycle Cover with Short Cycles

    Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni

    STACS (2005), pp. 641-653

  •   

    Limitations of cross-monotonic cost sharing schemes

    Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni

    SODA (2005), pp. 602-611

  •  

    Marriage, honesty, and stability

    Nicole Immorlica, Mohammad Mahdian

    SODA (2005), pp. 53-62

  •  

    Minimizing Makespan in No-Wait Job Shops

    Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko

    Math. Oper. Res., vol. 30 (2005), pp. 817-831

  •  

    Multi-unit auctions with budget-constrained bidders

    Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Mohammad Mahdian, Amin Saberi

    ACM Conference on Electronic Commerce (2005), pp. 44-51

  •  

    Online auctions with re-usable goods

    Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes

    ACM Conference on Electronic Commerce (2005), pp. 165-174

  •   

    Comparing and Aggregating Rankings with Ties

    Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee

    PODS (2004), pp. 47-58

  •  

    Exploring the community structure of newsgroups

    Christian Borgs, Jennifer T. Chayes, Mohammad Mahdian, Amin Saberi

    KDD (2004), pp. 783-787

  •  

    Further Improvements in Competitive Guarantees for QoS Buffering

    Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko

    ICALP (2004), pp. 196-207

  •  

    On the forced matching numbers of bipartite graphs

    Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian

    Discrete Mathematics, vol. 281 (2004), pp. 1-12

  •  

    Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks

    Ranveer Chandra, Lili Qiu, Kamal Jain, Mohammad Mahdian

    ICNP (2004), pp. 271-282

  •  

    Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games

    Lisa Fleischer, Kamal Jain, Mohammad Mahdian

    FOCS (2004), pp. 277-285

  •  

    A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem

    Mohammad Mahdian, Yingyu Ye, Jiawei Zhang

    RANDOM-APPROX (2003), pp. 129-140

  •  

    Approximating Market Equilibria

    Kamal Jain, Mohammad Mahdian, Amin Saberi

    RANDOM-APPROX (2003), pp. 98-108

  •  

    Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

    Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani

    J. ACM, vol. 50 (2003), pp. 795-824

  •  

    Packing Steiner trees

    Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour

    SODA (2003), pp. 266-274

  •  

    Rainbow Arithmetic Progressions and Anti-Ramsey Results

    Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic

    Combinatorics, Probability & Computing, vol. 12 (2003), pp. 599-620

  •   

    The facility location problem with general cost functions

    Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni

    Networks, vol. 42 (2003), pp. 42-47

  •  

    Universal Facility Location

    Mohammad Mahdian, Martin Pál

    ESA (2003), pp. 409-421

  •  

    A new greedy approach for facility location problems

    Kamal Jain, Mohammad Mahdian, Amin Saberi

    STOC (2002), pp. 731-740

  •  

    Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP

    Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani

    CoRR, vol. cs.DS/0207028 (2002)

  •  

    Improved Approximation Algorithms for Metric Facility Location Problems

    Mohammad Mahdian, Yinyu Ye, Jiawei Zhang

    APPROX (2002), pp. 229-242

  •   

    Length-constrained path-matchings in graphs

    Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni

    Networks, vol. 39 (2002), pp. 210-215

  •  

    On the computational complexity of strong edge coloring

    Mohammad Mahdian

    Discrete Applied Mathematics, vol. 118 (2002), pp. 239-248

  •  

    A Greedy Facility Location Algorithm Analyzed Using Dual Fitting

    Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani

    RANDOM-APPROX (2001), pp. 127-137

  •  

    On a conjecture of Keedwell and the cycle double cover conjecture

    Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani

    Discrete Mathematics, vol. 216 (2000), pp. 287-292

  •  

    The strong chromatic index of C4-free graphs

    Mohammad Mahdian

    Random Struct. Algorithms, vol. 17 (2000), pp. 357-375

  •  

    A Characterization of Uniquely 2-List Colorable Graphs

    Mohammad Mahdian, Ebadollah S. Mahmoodian

    Ars Comb., vol. 51 (1999)