Stefano Leonardi

According to our database1, Stefano Leonardi authored at least 142 papers between 1993 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Approximately Efficient Two-Sided Combinatorial Auctions.
ACM Trans. Economics and Comput., 2020

Efficient Two-Sided Markets with Limited Information.
CoRR, 2020

Fair Clustering with Multiple Colors.
CoRR, 2020

Pandora's Box Problem with Order Constraints.
CoRR, 2020

Envy, Regret, and Social Welfare Loss.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

2019
Designing Cost-Sharing Methods for Bayesian Games.
Theory Comput. Syst., 2019

Online Revenue Maximization for Server Pricing.
CoRR, 2019

Principal Fairness: \\ Removing Bias via Projections.
CoRR, 2019

Algorithms for Fair Team Formation in Online Labour Marketplaces✱.
Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Stochastic Graph Exploration.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Development of a surrogate model for wind farm control.
Proceedings of the 2019 American Control Conference, 2019

2018
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path.
ACM Trans. Algorithms, 2018

Algorithms for Hiring and Outsourcing in the Online Labor Market.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Prize Collecting Traveling Salesman and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Sequential Posted-Price Mechanisms with Correlated Valuations.
ACM Trans. Economics and Comput., 2017

HALG: Highlights of Algorithms.
SIGACT News, 2017

Report on HALG 2016/2017.
Bull. EATCS, 2017

Fixed Price Approximability of the Optimal Gain from Trade.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Budget Feasible Mechanisms on Matroids.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

When the Optimum is also Blind: a New Perspective on Universal Optimization.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Nested extremum seeking control for wind farm power optimization.
Proceedings of the 2017 American Control Conference, 2017

2016
Flow Time Minimization.
Encyclopedia of Algorithms, 2016

Efficient computation of the Weighted Clustering Coefficient.
Internet Math., 2016

Online Network Design with Outliers.
Algorithmica, 2016

Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Bidding Strategies for Fantasy-Sports Auctions.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Approximately Efficient Double Auctions with Strong Budget Balance.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Network-Aware Recommendations of Novel Tweets.
Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

Lottery Pricing Equilibria.
Proceedings of the 2016 ACM Conference on Economics and Computation, 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

Reservation Exchange Markets for Internet Advertising.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Large Eddy Simulation for an array of turbines with Extremum Seeking Control.
Proceedings of the 2016 American Control Conference, 2016

2015
Stochastic Query Covering for Fast Approximate Document Retrieval.
ACM Trans. Inf. Syst., 2015

On Multiple Keyword Sponsored Search Auctions with Budgets.
ACM Trans. Economics and Comput., 2015

Efficient cost-sharing mechanisms for prize-collecting problems.
Math. Program., 2015

Robust Hierarchical k-Center Clustering.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Competitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Development of a high fidelity CFD code for wind farm control.
Proceedings of the American Control Conference, 2015

2014
Utilitarian Mechanism Design for Multiobjective Optimization.
SIAM J. Comput., 2014

Web and Social Graph Mining.
IEEE Internet Comput., 2014

Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.
Proceedings of the 23rd International World Wide Web Conference, 2014

Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A Mazing 2+ Approximation for Unsplittable Flow on a Path.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Set Covering with Our Eyes Closed.
SIAM J. Comput., 2013

Near-optimal multi-unit auctions with ordered bidders.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Algorithms for Auctions and Games.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2012
Game-theoretic analysis of Internet switching with selfish users.
Theor. Comput. Sci., 2012

Near-Optimal Multi-Unit Auctions with Ordered Bidders
CoRR, 2012

A Mazing 2+eps Approximation for Unsplittable Flow on a Path
CoRR, 2012

Online team formation in social networks.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Prior-free auctions with ordered bidders.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Revenue maximizing envy-free multi-unit auctions with budgets.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.
Proceedings of the Algorithms - ESA 2012, 2012

2011
On Multiple Round Sponsored Search Auctions with Budgets
CoRR, 2011

Stochastic query covering.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Single valued combinatorial auctions with budgets.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Approximation Algorithms for Union and Intersection Covering Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Fully decentralized computation of aggregates over data streams.
SIGKDD Explorations, 2010

Strict Cost Sharing Schemes for Steiner Forest.
SIAM J. Comput., 2010

Combinatorial Auctions with Budgets
CoRR, 2010

Utilitarian Mechanism Design for Multi-Objective Optimization.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

10211 Abstracts Collection - Flexible Network Design.
Proceedings of the Flexible Network Design, 24.05. - 28.05.2010, 2010

Power in unity: forming teams in large-scale community systems.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2008
Flow Time Minimization.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Link analysis for Web spam detection.
ACM Trans. Web, 2008

A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game.
SIAM J. Comput., 2008

Stochastic analyses for online combinatorial optimization problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Mining Large Networks with Subgraph Counting.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007
Prize-Collecting Traveling Salesman and Related Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

The Web as a graph: How far we are.
ACM Trans. Internet Techn., 2007

Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.
ACM Trans. Algorithms, 2007

Cut problems in graphs with a budget constraint.
J. Discrete Algorithms, 2007

Approximating total flow time on parallel machines.
J. Comput. Syst. Sci., 2007

Stability and Similarity of Link Analysis Ranking Algorithms.
Internet Math., 2007

An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Network formation games with local coalitions.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Pricing Tree Access Networks with Connected Backbones.
Proceedings of the Algorithms, 2007

Estimating Clustering Indexes in Data Streams.
Proceedings of the Algorithms, 2007

New Metrics for Reputation Management in P2P Networks.
Proceedings of the AIRWeb 2007, 2007

2006
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines.
Proceedings of the Efficient Approximation and Online Algorithms, 2006

A reference collection for web spam.
SIGIR Forum, 2006

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.
SIAM J. Comput., 2006

Design of trees in the hose model: The balanced case.
Oper. Res. Lett., 2006

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.
Math. Oper. Res., 2006

Algorithms and Experiments for the Webgraph.
J. Graph Algorithms Appl., 2006

Online weighted flow time and deadline scheduling.
J. Discrete Algorithms, 2006

Preferential attachment in the growth of social networks: the case of Wikipedia
CoRR, 2006

Temporal Analysis of the Wikigraph.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Counting triangles in data streams.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

On the Value of Preemption in Scheduling.
Proceedings of the Approximation, 2006

Link-Based Characterization and Detection of Web Spam.
Proceedings of the AIRWeb 2006, 2006

2005
Parallel scheduling problems in next generation wireless networks.
Networks, 2005

Special Issue on Algorithms and Models for the Web-Graph.
Internet Math., 2005

Game-Theoretic Analysis of Internet Switching with Selfish Users.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Mining the inner structure of the Web graph.
Proceedings of the Eight International Workshop on the Web & Databases (WebDB 2005), 2005

A group-strategyproof mechanism for Steiner forests.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

The Self-Star Vision.
Proceedings of the Self-star Properties in Complex Information Systems, 2005

2004
Cross-monotonic cost sharing methods for connected facility location games.
Theor. Comput. Sci., 2004

Semi-clairvoyant scheduling.
Theor. Comput. Sci., 2004

Average stretch without migration.
J. Comput. Syst. Sci., 2004

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.
J. ACM, 2004

Preface.
Algorithmica, 2004

Scheduling against an adversarial network.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

2003
Scheduling multicasts on unit-capacity trees and meshes.
J. Comput. Syst. Sci., 2003

Scheduling to Minimize Flow Time Metrics.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Algorithms and Experiments for the Webgraph.
Proceedings of the Algorithms, 2003

2002
Minimizing the Flow Time Without Migration.
SIAM J. Comput., 2002

A Multi-Layer Model for the Web Graph.
Proceedings of the Second International Workshop on Web Dynamics, 2002

An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Preface.
Theor. Comput. Sci., 2001

On-line Randomized Call Control Revisited .
SIAM J. Comput., 2001

On-Line Competitive Algorithms for Call Admission in Optical Networks.
Algorithmica, 2001

Algorithms for the On-Line Travelling Salesman.
Algorithmica, 2001

Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Multiprocessor Scheduling with Rejection.
SIAM J. Discret. Math., 2000

Minimizing stall time in single and parallel disk systems.
J. ACM, 2000

Scheduling to minimize average stretch without migration.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

On Salesmen, Repairmen, Spiders, and Other Traveling Agents.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
On-Line Routing in All-Optical Networks.
Theor. Comput. Sci., 1999

On-line Algorithms.
ACM Comput. Surv., 1999

On-Line Resource Management with Application to Routing and Scheduling.
Algorithmica, 1999

On Capital Investment.
Algorithmica, 1999

1998
Efficient Token-Based Control in Rings.
Inf. Process. Lett., 1998

Randomized Lower Bounds for Online Path Coloring.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997
On scheduling variable length broadcasts in wireless networks.
Telecommunication Systems, 1997

1996
Enclosing a Set of Objects by Two Minimum Area Rectangles.
J. Algorithms, 1996

Average Case Analysis of Fully Dynamic Reachability for Directed Graphs.
RAIRO Theor. Informatics Appl., 1996

Efficient Token-Based Control in Rings (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On-line Competive Algorithms for Call Admission in Optical Networks.
Proceedings of the Algorithms, 1996

On-line Network Routing.
Proceedings of the Online Algorithms, 1996

1995
Competitive Algorithms for the On-line Traveling Salesman.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

On-line Resource Management with Applications to Routing and Scheduling.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Serving Requests with On-line Routing.
Proceedings of the Algorithm Theory, 1994

1993
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993


  Loading...