# Mohammad Mahdian

According to our database

Collaborative distances:

^{1}, Mohammad Mahdian authored at least 96 papers between 1999 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Incentive-Aware Learning for Large Markets.

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Budget Management Strategies in Repeated Auctions.

Proceedings of the 26th International Conference on World Wide Web, 2017

Visibility Testing and Counting for Uncertain Segments.

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Facility Location.

Encyclopedia of Algorithms, 2016

An Algorithmic View of Voting.

SIAM J. Discrete Math., 2016

Robust Mechanisms for Sponsored Search.

EAI Endorsed Trans. Serious Games, 2016

Community Detection on Evolving Graphs.

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Pricing a Low-regret Seller.

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

Incentives in Large Random Two-Sided Markets.

ACM Trans. Economics and Comput., 2015

To Match or Not to Match: Economics of Cookie Matching in Online Advertising.

ACM Trans. Economics and Comput., 2015

Sudoku Rectangle Completion (Extended Abstract).

Electronic Notes in Discrete Mathematics, 2015

Driven by Food: Modeling Geographic Choice.

Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, 2015

Algorithmic Cartography: Placing Points of Interest and Ads on Maps.

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014

The complexity of LSH feasibility.

Theor. Comput. Sci., 2014

Advertising in a stream.

Proceedings of the 23rd International World Wide Web Conference, 2014

Composable core-sets for diversity and coverage maximization.

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Event Detection via Communication Pattern Analysis.

Proceedings of the Eighth International Conference on Weblogs and Social Media, 2014

2013

Designing Markets for Daily Deals.

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Online Optimization with Uncertain Information.

ACM Trans. Algorithms, 2012

A linear algebraic approach to orthogonal arrays and Latin squares.

Ars Comb., 2012

To match or not to match: economics of cookie matching in online advertising.

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Ad Auctions with Data.

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

PageRank on an evolving graph.

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Algorithms on evolving graphs.

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Ad auctions with data.

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

TrustBets: betting over an IOU network.

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Sorting and selection on dynamic data.

Theor. Comput. Sci., 2011

Special Section on Foundations of Computer Science.

SIAM J. Comput., 2011

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

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

The Multiple Attribution Problem in Pay-Per-Conversion Advertising.

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Advertisement allocation for generalized second-pricing schemes.

Oper. Res. Lett., 2010

Value of Learning in Sponsored Search Auctions.

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Dynamics of conversations.

Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010

Fighting Censorship with Algorithms.

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Christmas Gift Exchange Games.

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

The Minimum Distance of Turbo-Like Codes.

IEEE Trans. Information Theory, 2009

Mechanism Design for Complexity-Constrained Bidders.

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Approximating Matches Made in Heaven.

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Sort Me If You Can: How to Sort Dynamic Data.

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Clustering-Based Bidding Languages for Sponsored Search.

Proceedings of the Algorithms, 2009

2008

Facility Location.

Proceedings of the Encyclopedia of Algorithms, 2008

Pay-Per-Action Model for On-line Advertising.

Int. J. Electronic Commerce, 2008

Rainbow solutions to the Sidon equation.

Discrete Mathematics, 2008

Externalities in online advertising.

Proceedings of the 17th International Conference on World Wide Web, 2008

The Secretary Problem with a Hazard Rate Condition.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A Cascade Model for Externalities in Sponsored Search.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Charity auctions on social networks.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Influence and correlation in social networks.

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

2007

Dynamics of bid optimization in online advertisement auctions.

Proceedings of the 16th International Conference on World Wide Web, 2007

Pay-per-action Model for Online Advertising.

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Mechanism Design on Trust Networks.

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Stochastic Kronecker Graphs.

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Deterministic Decentralized Search in Random Graphs.

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Allocating online advertisement space with unreliable estimates.

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

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

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Robust Combinatorial Optimization with Exponential Scenarios.

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Balloon Popping With Applications to Ascending Auctions.

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Towards a pay-per-action model in sponsored search.

Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, 2007

2006

Comparing Partial Rankings.

SIAM J. Discrete Math., 2006

Approximation Algorithms for Metric Facility Location Problems.

SIAM J. Comput., 2006

Secretary Problems with Competing Employers.

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Game-Theoretic Aspects of Designing Hyperlink Structures.

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Finding small balanced separators.

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Multi-unit auctions with unknown supply.

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Random popular matchings.

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Secure Overlay Network Design.

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Minimizing Makespan in No-Wait Job Shops.

Math. Oper. Res., 2005

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

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Click Fraud Resistant Methods for Learning Click-Through Rates.

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Cycle Cover with Short Cycles.

Proceedings of the STACS 2005, 2005

Limitations of cross-monotonic cost sharing schemes.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Marriage, honesty, and stability.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online auctions with re-usable goods.

Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

Multi-unit auctions with budget-constrained bidders.

Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

2004

On the forced matching numbers of bipartite graphs.

Discrete Mathematics, 2004

Comparing and Aggregating Rankings with Ties.

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Exploring the community structure of newsgroups.

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks.

Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), 2004

Further Improvements in Competitive Guarantees for QoS Buffering.

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

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

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

The facility location problem with general cost functions.

Networks, 2003

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

J. ACM, 2003

Rainbow Arithmetic Progressions and Anti-Ramsey Results.

Combinatorics, Probability & Computing, 2003

Packing Steiner trees.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

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

Proceedings of the Approximation, 2003

Approximating Market Equilibria.

Proceedings of the Approximation, 2003

Universal Facility Location.

Proceedings of the Algorithms, 2003

2002

Length-constrained path-matchings in graphs.

Networks, 2002

On the computational complexity of strong edge coloring.

Discrete Applied Mathematics, 2002

A new greedy approach for facility location problems.

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Improved Approximation Algorithms for Metric Facility Location Problems.

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

A Greedy Facility Location Algorithm Analyzed Using Dual Fitting.

Proceedings of the Approximation, 2001

2000

The strong chromatic index of C4-free graphs.

Random Struct. Algorithms, 2000

On a conjecture of Keedwell and the cycle double cover conjecture.

Discrete Mathematics, 2000

1999

A Characterization of Uniquely 2-List Colorable Graphs.

Ars Comb., 1999