The SCEAS System
| |||||||

## Search the dblp DataBase
Mohammad Mahdian:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
**Secure Overlay Network Design.**[Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:354-366 [Conf] - Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
**Improved Approximation Algorithms for Metric Facility Location Problems.**[Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:229-242 [Conf] - Mohammad Mahdian, Martin Pál
**Universal Facility Location.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:409-421 [Conf] - Lisa Fleischer, Kamal Jain, Mohammad Mahdian
**Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:277-285 [Conf] - Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
**Further Improvements in Competitive Guarantees for QoS Buffering.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:196-207 [Conf] - Ranveer Chandra, Lili Qiu, Kamal Jain, Mohammad Mahdian
**Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks.**[Citation Graph (0, 0)][DBLP] ICNP, 2004, pp:271-282 [Conf] - Christian Borgs, Jennifer T. Chayes, Mohammad Mahdian, Amin Saberi
**Exploring the community structure of newsgroups.**[Citation Graph (0, 0)][DBLP] KDD, 2004, pp:783-787 [Conf] - Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
**Comparing and Aggregating Rankings with Ties.**[Citation Graph (0, 0)][DBLP] PODS, 2004, pp:47-58 [Conf] - Kamal Jain, Mohammad Mahdian, Amin Saberi
**Approximating Market Equilibria.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:98-108 [Conf] - Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
**A Greedy Facility Location Algorithm Analyzed Using Dual Fitting.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2001, pp:127-137 [Conf] - Mohammad Mahdian, Yingyu Ye, Jiawei Zhang
**A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:129-140 [Conf] - Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Mohammad Mahdian, Amin Saberi
**Multi-unit auctions with budget-constrained bidders.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2005, pp:44-51 [Conf] - Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes
**Online auctions with re-usable goods.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2005, pp:165-174 [Conf] - Mohammad Mahdian
**Random popular matchings.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2006, pp:238-242 [Conf] - Mohammad Mahdian, Amin Saberi
**Multi-unit auctions with unknown supply.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2006, pp:243-249 [Conf] - Nicole Immorlica, Mohammad Mahdian
**Marriage, honesty, and stability.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:53-62 [Conf] - Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
**Limitations of cross-monotonic cost sharing schemes.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:602-611 [Conf] - Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour
**Packing Steiner trees.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:266-274 [Conf] - Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
**Cycle Cover with Short Cycles.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:641-653 [Conf] - Uriel Feige, Mohammad Mahdian
**Finding small balanced separators.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:375-384 [Conf] - Kamal Jain, Mohammad Mahdian, Amin Saberi
**A new greedy approach for facility location problems.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:731-740 [Conf] - Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Kunal Talwar
**Click Fraud Resistant Methods for Learning Click-Through Rates.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:34-45 [Conf] - Nicole Immorlica, Robert D. Kleinberg, Mohammad Mahdian
**Secretary Problems with Competing Employers.**[Citation Graph (0, 0)][DBLP] WINE, 2006, pp:389-400 [Conf] - Kamal Jain, Mohammad Mahdian
**Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:788-792 [Conf] - Nicole Immorlica, Kamal Jain, Mohammad Mahdian
**Game-Theoretic Aspects of Designing Hyperlink Structures.**[Citation Graph (0, 0)][DBLP] WINE, 2006, pp:150-161 [Conf] - Mohammad Mahdian, Ebadollah S. Mahmoodian
**A Characterization of Uniquely 2-List Colorable Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:51, n:, pp:- [Journal] - Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
**Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic
**Rainbow Arithmetic Progressions and Anti-Ramsey Results.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:599-620 [Journal] - Mohammad Mahdian
**On the computational complexity of strong edge coloring.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:118, n:3, pp:239-248 [Journal] - Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian
**On the forced matching numbers of bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:281, n:1-3, pp:1-12 [Journal] - Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani
**On a conjecture of Keedwell and the cycle double cover conjecture.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:216, n:1-3, pp:287-292 [Journal] - Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
**Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP.**[Citation Graph (0, 0)][DBLP] J. ACM, 2003, v:50, n:6, pp:795-824 [Journal] - Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
**The facility location problem with general cost functions.**[Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:1, pp:42-47 [Journal] - Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
**Length-constrained path-matchings in graphs.**[Citation Graph (0, 0)][DBLP] Networks, 2002, v:39, n:4, pp:210-215 [Journal] - Mohammad Mahdian
**The strong chromatic index of C4-free graphs.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2000, v:17, n:3-4, pp:357-375 [Journal] - Mohammad Mahdian, Yinyu Ye, Jiawei Zhang
**Approximation Algorithms for Metric Facility Location Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:2, pp:411-432 [Journal] - Mohammad Mahdian, Kerem Tomak
**Towards a pay-per-action model in sponsored search.**[Citation Graph (0, 0)][DBLP] ICEC, 2007, pp:87-88 [Conf] - Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni
**Robust Combinatorial Optimization with Exponential Scenarios.**[Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:439-453 [Conf] - Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi
**Allocating online advertisement space with unreliable estimates.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:288-294 [Conf] - Nicole Immorlica, Jon M. Kleinberg, Mohammad Mahdian, Tom Wexler
**The role of compatibility in the diffusion of technologies through social networks.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:75-83 [Conf] - Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu 0002
**Deterministic Decentralized Search in Random Graphs.**[Citation Graph (0, 0)][DBLP] WAW, 2007, pp:187-194 [Conf] - Mohammad Mahdian, Ying Xu 0002
**Stochastic Kronecker Graphs.**[Citation Graph (0, 0)][DBLP] WAW, 2007, pp:179-186 [Conf] - Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian
**Dynamics of bid optimization in online advertisement auctions.**[Citation Graph (0, 0)][DBLP] WWW, 2007, pp:531-540 [Conf] **Clustering-Based Bidding Languages for Sponsored Search.**[Citation Graph (, )][DBLP]**Balloon Popping With Applications to Ascending Auctions.**[Citation Graph (, )][DBLP]**Approximating Matches Made in Heaven.**[Citation Graph (, )][DBLP]**Sort Me If You Can: How to Sort Dynamic Data.**[Citation Graph (, )][DBLP]**Influence and correlation in social networks.**[Citation Graph (, )][DBLP]**Dynamics of conversations.**[Citation Graph (, )][DBLP]**Charity auctions on social networks.**[Citation Graph (, )][DBLP]**The Secretary Problem with a Hazard Rate Condition.**[Citation Graph (, )][DBLP]**A Cascade Model for Externalities in Sponsored Search.**[Citation Graph (, )][DBLP]**Mechanism Design on Trust Networks.**[Citation Graph (, )][DBLP]**Pay-per-action Model for Online Advertising.**[Citation Graph (, )][DBLP]**Mechanism Design for Complexity-Constrained Bidders.**[Citation Graph (, )][DBLP]**Externalities in online advertising.**[Citation Graph (, )][DBLP]**Christmas Gift Exchange Games.**[Citation Graph (, )][DBLP]**Fighting Censorship with Algorithms.**[Citation Graph (, )][DBLP]**Secure Overlay Network Design.**[Citation Graph (, )][DBLP]**Rainbow solutions to the Sidon equation.**[Citation Graph (, )][DBLP]
Search in 0.655secs, Finished in 0.660secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |