Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Krysta, Piotr - Department of Computer Science, University of Liverpool
Single-Minded Unlimited Supply Pricing on Sparse Instances Patrick Briest
Optimizing misdirection Piotr Berman Piotr Krysta y
Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
Computing Equilibria for Congestion Games with (Im)perfect Information
Geometric Network Design with Selfish Agents Martin Hoefer1
Bicriteria Network Design via Iterative Piotr Krysta #
SingleMinded Unlimited Supply Pricing on Sparse Instances Patrick Briest # Piotr Krysta +
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
Selfish Traffic Allocation for Server Farms Artur Czumaj
Bicriteria Network Design via Iterative Piotr Krysta
Geometric Network Design with Selfish Agents Martin Hoefer 1 # and Piotr Krysta 2 ##
Approximation Techniques for Utilitarian Mechanism Design
Scheduling and Trac Allocation for Tasks with Bounded Splittability ?
Approximation Techniques for Utilitarian Mechanism Design
