2008 |
29 | EE | Moshe Babaioff,
Patrick Briest,
Piotr Krysta:
On the Approximability of Combinatorial Exchange Problems.
SAGT 2008: 83-94 |
28 | EE | Patrick Briest,
Martin Hoefer,
Piotr Krysta:
Stackelberg Network Pricing Games.
STACS 2008: 133-142 |
27 | EE | Itai Ashlagi,
Piotr Krysta,
Moshe Tennenholtz:
Social Context Games.
WINE 2008: 675-683 |
26 | EE | Piotr Krysta,
Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents.
Encyclopedia of Algorithms 2008 |
25 | EE | Patrick Briest,
Martin Hoefer,
Piotr Krysta:
Stackelberg Network Pricing Games
CoRR abs/0802.2841: (2008) |
2007 |
24 | EE | Patrick Briest,
Piotr Krysta:
Buying cheap is expensive: hardness of non-parametric multi-product pricing.
SODA 2007: 716-725 |
23 | EE | Patrick Briest,
Martin Hoefer,
Piotr Krysta:
Stackelberg Network Pricing Games.
Electronic Colloquium on Computational Complexity (ECCC) 14(101): (2007) |
2006 |
22 | EE | Patrick Briest,
Piotr Krysta:
Single-minded unlimited supply pricing on sparse instances.
SODA 2006: 1093-1102 |
21 | EE | Jörg Knoche,
Piotr Krysta:
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
WAOA 2006: 265-278 |
20 | EE | René Beier,
Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Computing equilibria for a service provider game with (Im)perfect information.
ACM Transactions on Algorithms 2(4): 679-706 (2006) |
19 | EE | Patrick Briest,
Piotr Krysta:
Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing.
Electronic Colloquium on Computational Complexity (ECCC) 13(068): (2006) |
18 | EE | Piotr Krysta,
Krzysztof Lorys:
Efficient approximation algorithms for the achromatic number.
Theor. Comput. Sci. 361(2-3): 150-171 (2006) |
2005 |
17 | EE | Martin Hoefer,
Piotr Krysta:
Geometric Network Design with Selfish Agents.
COCOON 2005: 167-178 |
16 | EE | Piotr Krysta:
Bicriteria Network Design via Iterative Rounding.
COCOON 2005: 179-187 |
15 | EE | Piotr Krysta:
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.
MFCS 2005: 615-627 |
14 | EE | Patrick Briest,
Piotr Krysta,
Berthold Vöcking:
Approximation techniques for utilitarian mechanism design.
STOC 2005: 39-48 |
2004 |
13 | EE | René Beier,
Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information.
SODA 2004: 746-755 |
2003 |
12 | EE | Amit Agarwal,
Tarun Agarwal,
Sumit Chopra,
Anja Feldmann,
Nils Kammenhuber,
Piotr Krysta,
Berthold Vöcking:
An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.
Euro-Par 2003: 230-235 |
11 | EE | Piotr Krysta,
Peter Sanders,
Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
MFCS 2003: 500-510 |
10 | EE | Piotr Berman,
Piotr Krysta:
Optimizing misdirection.
SODA 2003: 192-201 |
9 | | Piotr Krysta:
Approximating minimum size {1, 2}-connected network.
Discrete Applied Mathematics 125(2-3): 267-288 (2003) |
2002 |
8 | EE | Béla Csaba,
Marek Karpinski,
Piotr Krysta:
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
SODA 2002: 74-83 |
7 | EE | Artur Czumaj,
Piotr Krysta,
Berthold Vöcking:
Selfish traffic allocation for server farms.
STOC 2002: 287-296 |
2001 |
6 | EE | Piotr Krysta,
V. S. Anil Kumar:
Approximation Algorithms for Minimum Size 2-Connectivity Problems.
STACS 2001: 431-442 |
5 | | Piotr Krysta,
Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location Problems.
J. Comb. Optim. 5(2): 233-247 (2001) |
1999 |
4 | EE | Piotr Krysta,
Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location.
COCOON 1999: 241-250 |
3 | EE | Piotr Krysta,
Krzysztof Lorys:
Efficient Approximation Algorithms for the Achromatic Number.
ESA 1999: 402-413 |
2 | | Piotr Krysta,
Leszek Pacholski:
The STO problem is NP-complete.
J. Symb. Comput. 27(2): 207-219 (1999) |
1997 |
1 | | Leszek Gasieniec,
Piotr Indyk,
Piotr Krysta:
External Inverse Pattern Matching.
CPM 1997: 90-101 |