Stefano Leonardi

From MaRDI portal
Person:334926

Available identifiers

zbMath Open leonardi.stefanoWikidataQ102282268 ScholiaQ102282268MaRDI QIDQ334926

List of research outcomes

PublicationDate of PublicationType
Bilateral Trade: A Regret Minimization Perspective2024-03-05Paper
Pandora’s Box Problem with Order Constraints2024-02-23Paper
Average case analysis of fully dynamic connectivity for directed graphs2024-01-05Paper
Flow time scheduling with uncertain processing time2023-11-14Paper
Efficient two-sided markets with limited information2023-11-14Paper
Competitive algorithms for the on-line traveling salesman2022-12-16Paper
Serving requests with on-line routing2022-12-09Paper
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint2022-08-02Paper
Stochastic graph exploration2022-07-21Paper
Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness2022-07-06Paper
Heat transfer increase by convection in liquid-infused surfaces for laminar and turbulent flows2022-04-29Paper
Algorithms for fair \(k\)-clustering with multiple protected attributes2021-12-13Paper
Budget feasible mechanisms on matroids2021-04-19Paper
Efficient computation of the Weighted Clustering Coefficient2021-03-26Paper
Heat transfer in a turbulent channel flow with super-hydrophobic or liquid-infused walls2021-01-19Paper
Prior-free multi-unit auctions with ordered bidders2020-11-06Paper
https://portal.mardi4nfdi.de/entity/Q51113662020-05-27Paper
(1 + )-Approximate Incremental Matching in Constant Deterministic Amortized Time2019-10-15Paper
A Mazing 2+ Approximation for Unsplittable Flow on a Path2019-06-20Paper
Comparison between super-hydrophobic, liquid infused and rough surfaces: a direct numerical simulation study2019-05-28Paper
A Mazing 2+ε Approximation for Unsplittable Flow on a Path2019-03-28Paper
Designing cost-sharing methods for Bayesian games2019-03-21Paper
Fixed Price Approximability of the Optimal Gain from Trade2019-01-30Paper
On-line resource management with applications to routing and scheduling2019-01-10Paper
Approximately Efficient Double Auctions with Strong Budget Balance2018-07-16Paper
On-line routing in all-optical networks2018-07-04Paper
The role of vorticity in the turbulent/thermal transport of a channel flow with local blowing2018-06-27Paper
https://portal.mardi4nfdi.de/entity/Q45982852017-12-19Paper
On-line competitive algorithms for call admission in optical networks2017-12-05Paper
Budget feasible mechanisms on matroids2017-08-31Paper
Robust Hierarchical k-Center Clustering2017-05-19Paper
Bidding Strategies for Fantasy-Sports Auctions2017-02-10Paper
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets2017-02-10Paper
Online network design with outliers2016-11-01Paper
Designing Cost-Sharing Methods for Bayesian Games2016-09-29Paper
Minimizing the flow time without migration2016-09-29Paper
Heat transfer in a turbulent channel flow with square bars or circular rods on one wall2016-03-29Paper
Sequential Posted Price Mechanisms with Correlated Valuations2016-01-08Paper
Efficient Computation of the Weighted Clustering Coefficient2015-09-09Paper
Sharing the cost more efficiently2015-09-02Paper
Efficient cost-sharing mechanisms for prize-collecting problems2015-08-31Paper
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines2015-02-27Paper
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets2015-01-07Paper
https://portal.mardi4nfdi.de/entity/Q29347102014-12-18Paper
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree2014-11-25Paper
Utilitarian Mechanism Design for Multiobjective Optimization2014-11-14Paper
https://portal.mardi4nfdi.de/entity/Q29217192014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q54176492014-05-22Paper
Prior-free auctions with ordered bidders2014-05-13Paper
Network formation games with local coalitions2014-03-13Paper
Set Covering with Our Eyes Closed2013-09-25Paper
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path2013-03-19Paper
On Multiple Keyword Sponsored Search Auctions with Budgets2012-11-01Paper
Game-theoretic analysis of Internet switching with selfish users2012-10-11Paper
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees2012-09-25Paper
Approximation Algorithms for Union and Intersection Covering Problems2012-08-31Paper
Strict Cost Sharing Schemes for Steiner Forest2011-04-04Paper
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines2011-02-01Paper
Steady and time-periodic blowing/suction perturbations in a turbulent channel flow2011-01-21Paper
Online Network Design with Outliers2010-09-07Paper
https://portal.mardi4nfdi.de/entity/Q35793862010-08-06Paper
Channel flow over large cube roughness: a direct numerical simulation study2010-06-30Paper
Direct numerical simulation of turbulent channel flow with wall velocity disturbances2010-04-22Paper
Properties of d- and k-type roughness in a turbulent channel flow2010-03-18Paper
Numerical assessment of local forcing on the heat transfer in a turbulent channel flow2010-03-18Paper
Algorithms - ESA 20032010-03-03Paper
Algorithms and Experiments for the Webgraph2009-01-19Paper
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game2008-10-28Paper
Direct numerical simulation of three-dimensional turbulent rough channels: parameterization and flow physics2008-10-24Paper
Pricing Tree Access Networks with Connected Backbones2008-09-25Paper
Estimating Clustering Indexes in Data Streams2008-09-25Paper
Cut Problems in Graphs with a Budget Constraint2008-09-18Paper
Passive scalar statistics in a turbulent channel with local time-periodic blowing/suction at walls2008-09-05Paper
Stability and Similarity of Link Analysis Ranking Algorithms2008-08-19Paper
Comparison between experiments and direct numerical simulations in a channel flow with roughness on one wall2008-06-17Paper
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm2008-05-27Paper
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines2008-03-14Paper
Cut problems in graphs with a budget constraint2007-10-30Paper
On the Value of Preemption in Scheduling2007-08-28Paper
Approximating total flow time on parallel machines2007-08-23Paper
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing2007-05-03Paper
Design of trees in the hose model: the balanced case2007-02-19Paper
Guidelines for modeling a 2D rough wall channel flow2007-01-24Paper
Online weighted flow time and deadline scheduling2006-10-31Paper
Turbulent channel flow with either transverse or longitudinal roughness elements on one wall2006-09-25Paper
Minimizing stall time in single and parallel disk systems2006-09-12Paper
Passive scalar in a turbulent channel flow with wall velocity disturbances2006-01-31Paper
Efficient token-based control in rings.2006-01-17Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Cross-monotonic cost sharing methods for connected facility location games2005-01-11Paper
Semi-clairvoyant scheduling2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q48188552004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44724632004-08-04Paper
Direct numerical simulations of turbulent channel flow with transverse square bars on one wall2004-06-09Paper
https://portal.mardi4nfdi.de/entity/Q45425642004-01-27Paper
Scheduling multicasts on unit-capacity trees and meshes.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47077882003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q47807812002-11-21Paper
Minimizing the Flow Time Without Migration2002-09-29Paper
Algorithms for the on-line travelling salesman2002-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45039352001-11-28Paper
On-line Randomized Call Control Revisited2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45269752001-02-28Paper
Multiprocessor Scheduling with Rejection2000-03-19Paper
On-line routing in all-optical networks2000-01-12Paper
On capital investment.2000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42501981999-07-08Paper
https://portal.mardi4nfdi.de/entity/Q42523181999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42285081999-03-01Paper
Enclosing a Set of Objects by Two Minimum Area Rectangles1997-06-22Paper
Average case analysis of fully dynamic reachability for directed graphs1997-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48751731996-09-15Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stefano Leonardi