The following pages link to Stefano Leonardi (Q334926):
Displayed 50 items.
- (Q203390) (redirect page) (← links)
- Online network design with outliers (Q334928) (← links)
- Efficient cost-sharing mechanisms for prize-collecting problems (Q494320) (← links)
- Steady and time-periodic blowing/suction perturbations in a turbulent channel flow (Q617535) (← links)
- Cross-monotonic cost sharing methods for connected facility location games (Q703566) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Passive scalar in a turbulent channel flow with wall velocity disturbances (Q813252) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Guidelines for modeling a 2D rough wall channel flow (Q862592) (← links)
- Design of trees in the hose model: the balanced case (Q867917) (← links)
- Passive scalar statistics in a turbulent channel with local time-periodic blowing/suction at walls (Q942810) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- The role of vorticity in the turbulent/thermal transport of a channel flow with local blowing (Q1648581) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- On capital investment. (Q1818269) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Algorithms for fair \(k\)-clustering with multiple protected attributes (Q2060384) (← links)
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
- Prior-free multi-unit auctions with ordered bidders (Q2210509) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Efficient token-based control in rings. (Q2583556) (← links)
- Approximating total flow time on parallel machines (Q2641865) (← links)
- On-line Randomized Call Control Revisited (Q2719132) (← links)
- Heat transfer in a turbulent channel flow with square bars or circular rods on one wall (Q2796693) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- Minimizing the flow time without migration (Q2819546) (← links)
- Set Covering with Our Eyes Closed (Q2848202) (← links)
- Approximation Algorithms for Union and Intersection Covering Problems (Q2911608) (← links)
- A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees (Q2912854) (← links)
- (Q2921719) (← links)
- Utilitarian Mechanism Design for Multiobjective Optimization (Q2929697) (← links)
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (Q2931426) (← links)
- (Q2934710) (← links)
- Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets (Q2936988) (← links)
- Sharing the cost more efficiently (Q2944561) (← links)
- Efficient Computation of the Weighted Clustering Coefficient (Q2945270) (← links)
- Bidding Strategies for Fantasy-Sports Auctions (Q2959822) (← links)
- Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets (Q2959831) (← links)
- Robust Hierarchical k-Center Clustering (Q2989032) (← links)
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (Q3069900) (← links)
- Average case analysis of fully dynamic reachability for directed graphs (Q3124401) (← links)
- Minimizing the Flow Time Without Migration (Q3149872) (← links)
- On Multiple Keyword Sponsored Search Auctions with Budgets (Q3166992) (← links)
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (Q3434990) (← links)
- Sequential Posted Price Mechanisms with Correlated Valuations (Q3460773) (← links)
- Comparison between experiments and direct numerical simulations in a channel flow with roughness on one wall (Q3506809) (← links)
- Stability and Similarity of Link Analysis Ranking Algorithms (Q3519888) (← links)
- Cut Problems in Graphs with a Budget Constraint (Q3525779) (← links)
- Pricing Tree Access Networks with Connected Backbones (Q3527238) (← links)