Mohammad Mahdian

Jieming Mao

Kangning Wang

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Differentially Private Hierarchical Clustering with Provable Approximation Guarantees.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

2022

Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Massively Parallel and Dynamic Algorithms for Minimum Size Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Budget-Management Strategies in Repeated Auctions.

[BibT_eX]

[DOI]

Oper. Res., 2021

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT.

[BibT_eX]

[DOI]

Vaggos Chatziafratis

Sara Ahmadian

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Budget-Constrained Incentive Compatibility for Stationary Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Smoothly Bounding User Contributions in Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Fair Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Interactive Learning of a Dynamic Structure.

[BibT_eX]

[DOI]

Ehsan Emamjomeh-Zadeh

David Kempe

Robert E. Schapire

Proceedings of the Algorithmic Learning Theory, 2020

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.

[BibT_eX]

[DOI]

Vaggos Chatziafratis

Grigory Yaroslavtsev

Euiwoong Lee

Konstantin Makarychev

Sara Ahmadian

Alessandro Epasto

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Fair Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Visibility testing and counting for uncertain segments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Response Prediction for Low-Regret Agents.

[BibT_eX]

[DOI]

Saeed Alaei

Ashwinkumar Badanidiyuru

Sadra Yazdanbod

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Clustering without Over-Representation.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2018

SCRank: Spammer and Celebrity Ranking in Directed Social Networks.

[BibT_eX]

[DOI]

Alex Fabrikant

Andrew Tomkins

CoRR, 2018

Incentive-Aware Learning for Large Markets.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Soheil Behnezhad

Avrim Blum

Mahsa Derakhshan

Christos H. Papadimitriou

Ronald L. Rivest

Saeed Seddighin

Philip B. Stark

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

2016

Facility Location.

[BibT_eX]

[DOI]

Karen I. Aardal

Jaroslaw Byrka

Encyclopedia of Algorithms, 2016

An Algorithmic View of Voting.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Robust Mechanisms for Sponsored Search.

[BibT_eX]

[DOI]

Mukund Sundararajan

EAI Endorsed Trans. Serious Games, 2016

Community Detection on Evolving Graphs.

[BibT_eX]

[DOI]

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

Pricing a Low-regret Seller.

[BibT_eX]

[DOI]

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

2015

Incentives in Large Random Two-Sided Markets.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

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

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2015

Sudoku Rectangle Completion (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Driven by Food: Modeling Geographic Choice.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Okke Schrijvers

Sergei Vassilvitskii

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

2014

The complexity of LSH feasibility.

[BibT_eX]

[DOI]

Flavio Chierichetti

Theor. Comput. Sci., 2014

Advertising in a stream.

[BibT_eX]

[DOI]

Samuel Ieong

Sergei Vassilvitskii

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

Composable core-sets for diversity and coverage maximization.

[BibT_eX]

[DOI]

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

Event Detection via Communication Pattern Analysis.

[BibT_eX]

[DOI]

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

2013

Designing Markets for Daily Deals.

[BibT_eX]

[DOI]

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

2012

Online Optimization with Uncertain Information.

[BibT_eX]

[DOI]

Hamid Nazerzadeh

ACM Trans. Algorithms, 2012

Christmas Gift Exchange Games.

[BibT_eX]

[DOI]

Arpita Ghosh

Theory Comput. Syst., 2012

A linear algebraic approach to orthogonal arrays and Latin squares.

[BibT_eX]

A. A. Khanban

Ars Comb., 2012

PageRank on an evolving graph.

[BibT_eX]

[DOI]

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

Algorithms on evolving graphs.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Ad auctions with data.

[BibT_eX]

[DOI]

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

TrustBets: betting over an IOU network.

[BibT_eX]

[DOI]

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

2011

Sorting and selection on dynamic data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Special Section on Foundations of Computer Science.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Stochastic kronecker graphs.

[BibT_eX]

[DOI]

Ying Xu

Random Struct. Algorithms, 2011

Fighting censorship with algorithms.

[BibT_eX]

[DOI]

XRDS, 2011

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

[BibT_eX]

[DOI]

Qiqi Yan

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

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

[BibT_eX]

[DOI]

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

2010

Advertisement allocation for generalized second-pricing schemes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Secure Overlay Network Design.

[BibT_eX]

[DOI]

Li (Erran) Li

Algorithmica, 2010

Value of Learning in Sponsored Search Auctions.

[BibT_eX]

[DOI]

Sai-Ming Li

Randolph Preston McAfee

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

Dynamics of conversations.

[BibT_eX]

[DOI]

Mary McGlohon

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

2009

The Minimum Distance of Turbo-Like Codes.

[BibT_eX]

[DOI]

Louay Bazzi

Daniel A. Spielman

IEEE Trans. Inf. Theory, 2009

Mechanism Design for Complexity-Constrained Bidders.

[BibT_eX]

[DOI]

Amin Sayedi

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

Approximating Matches Made in Heaven.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Clustering-Based Bidding Languages for Sponsored Search.

[BibT_eX]

[DOI]

Grant Wang

Proceedings of the Algorithms, 2009

2008

Facility Location.

[BibT_eX]

[DOI]

Karen I. Aardal

Jaroslaw Byrka

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Limitations of cross-monotonic cost-sharing schemes.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Deterministic Decentralized Search in Random Graphs.

[BibT_eX]

[DOI]

Internet Math., 2008

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

[BibT_eX]

[DOI]

Kerem Tomak

Int. J. Electron. Commer., 2008

Rainbow solutions to the Sidon equation.

[BibT_eX]

[DOI]

Jacob Fox

Rados Radoicic

Discret. Math., 2008

Externalities in online advertising.

[BibT_eX]

[DOI]

Arpita Ghosh

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

The Secretary Problem with a Hazard Rate Condition.

[BibT_eX]

[DOI]

Randolph Preston McAfee

David M. Pennock

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

A Cascade Model for Externalities in Sponsored Search.

[BibT_eX]

[DOI]

David Kempe

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

Charity auctions on social networks.

[BibT_eX]

[DOI]

Arpita Ghosh

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

Influence and correlation in social networks.

[BibT_eX]

[DOI]

Aris Anagnostopoulos

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

2007

Dynamics of bid optimization in online advertisement auctions.

[BibT_eX]

[DOI]

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

Mechanism Design on Trust Networks.

[BibT_eX]

[DOI]

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

Allocating online advertisement space with unreliable estimates.

[BibT_eX]

[DOI]

Hamid Nazerzadeh

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.

[BibT_eX]

[DOI]

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

Robust Combinatorial Optimization with Exponential Scenarios.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Balloon Popping With Applications to Ascending Auctions.

[BibT_eX]

[DOI]

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

Pay-per-action model for online advertising.

[BibT_eX]

[DOI]

Kerem Tomak

Proceedings of the 1st international workshop on Data mining and audience intelligence for advertising, 2007

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

[BibT_eX]

[DOI]

Kerem Tomak

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

2006

Comparing Partial Rankings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Approximation Algorithms for Metric Facility Location Problems.

[BibT_eX]

[DOI]

Yinyu Ye

Jiawei Zhang

SIAM J. Comput., 2006

Secretary Problems with Competing Employers.

[BibT_eX]

[DOI]

Robert D. Kleinberg

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

Game-Theoretic Aspects of Designing Hyperlink Structures.

[BibT_eX]

[DOI]

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

Finding small balanced separators.

[BibT_eX]

[DOI]

Uriel Feige

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

Multi-unit auctions with unknown supply.

[BibT_eX]

[DOI]

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

Random popular matchings.

[BibT_eX]

[DOI]

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

2005

Minimizing Makespan in No-Wait Job Shops.

[BibT_eX]

[DOI]

Nikhil Bansal

Maxim Sviridenko

Math. Oper. Res., 2005

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

[BibT_eX]

[DOI]

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

Click Fraud Resistant Methods for Learning Click-Through Rates.

[BibT_eX]

[DOI]

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

Cycle Cover with Short Cycles.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Marriage, honesty, and stability.

[BibT_eX]

[DOI]

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

Online auctions with re-usable goods.

[BibT_eX]

[DOI]

Robert D. Kleinberg

David C. Parkes

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

Multi-unit auctions with budget-constrained bidders.

[BibT_eX]

[DOI]

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

2004

On the forced matching numbers of bipartite graphs.

[BibT_eX]

[DOI]

Peter Adams

Discret. Math., 2004

Comparing and Aggregating Rankings with Ties.

[BibT_eX]

[DOI]

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

Exploring the community structure of newsgroups.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Further Improvements in Competitive Guarantees for QoS Buffering.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Lisa Fleischer

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

2003

The facility location problem with general cost functions.

[BibT_eX]

[DOI]

Networks, 2003

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

[BibT_eX]

[DOI]

J. ACM, 2003

Rainbow Arithmetic Progressions and Anti-Ramsey Results.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Packing Steiner trees.

[BibT_eX]

[DOI]

Mohammad R. Salavatipour

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

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

[BibT_eX]

[DOI]

Yingyu Ye

Jiawei Zhang

Proceedings of the Approximation, 2003

Approximating Market Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2003

Universal Facility Location.

[BibT_eX]

[DOI]

Martin Pál

Proceedings of the Algorithms, 2003

2002

Length-constrained path-matchings in graphs.

[BibT_eX]

[DOI]

Mohammad Ghodsi

Networks, 2002

On the computational complexity of strong edge coloring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

A new greedy approach for facility location problems.

[BibT_eX]

[DOI]

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

Improved Approximation Algorithms for Metric Facility Location Problems.

[BibT_eX]

[DOI]

Yinyu Ye

Jiawei Zhang

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

A Greedy Facility Location Algorithm Analyzed Using Dual Fitting.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

The strong chromatic index of C4-free graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

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

[BibT_eX]

[DOI]

Mohammad R. Salavatipour

Ruzbeh Tusserkani

Discret. Math., 2000

1999

A Characterization of Uniquely 2-List Colorable Graphs.

[BibT_eX]