| 2012 | ||
|---|---|---|
| 38 | Patrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games. Algorithmica 62(3-4): 733-753 (2012) | |
| 2011 | ||
| 37 | Dimitris Fotakis, Piotr Krysta, Orestis Telelis: Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116 | |
| 36 | Patrick Briest, Piotr Krysta: Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM J. Comput. 40(6): 1554-1586 (2011) | |
| 35 | Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011) | |
| 2010 | ||
| 34 | Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael Wooldridge: Combinatorial auctions with externalities. AAMAS 2010: 1471-1472 | |
| 33 | Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre: Ranking games that have competitiveness-based strategies. ACM Conference on Electronic Commerce 2010: 335-344 | |
| 32 | Piotr Krysta, Carmine Ventre: Combinatorial Auctions with Verification Are Tractable. ESA (2) 2010: 39-50 | |
| 31 | Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre: Utilitarian Mechanism Design for Multi-Objective Optimization. SODA 2010: 573-584 | |
| 30 | Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39(5): 1957-1987 (2010) | |
| 2008 | ||
| 29 | Moshe Babaioff, Patrick Briest, Piotr Krysta: On the Approximability of Combinatorial Exchange Problems. SAGT 2008: 83-94 | |
| 28 | Patrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games. STACS 2008: 133-142 | |
| 27 | Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz: Social Context Games. WINE 2008: 675-683 | |
| 26 | Piotr Krysta, Berthold Vöcking: Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms 2008 | |
| 25 | Patrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games CoRR abs/0802.2841: (2008) | |
| 2007 | ||
| 24 | Patrick Briest, Piotr Krysta: Buying cheap is expensive: hardness of non-parametric multi-product pricing. SODA 2007: 716-725 | |
| 23 | Patrick Briest, Martin Hoefer, Piotr Krysta: Stackelberg Network Pricing Games. Electronic Colloquium on Computational Complexity (ECCC) 14(101): (2007) | |
| 2006 | ||
| 22 | Patrick Briest, Piotr Krysta: Single-minded unlimited supply pricing on sparse instances. SODA 2006: 1093-1102 | |
| 21 | Jörg Knoche, Piotr Krysta: An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. WAOA 2006: 265-278 | |
| 20 | 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 | 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 | Piotr Krysta, Krzysztof Lorys: Efficient approximation algorithms for the achromatic number. Theor. Comput. Sci. 361(2-3): 150-171 (2006) | |
| 2005 | ||
| 17 | Martin Hoefer, Piotr Krysta: Geometric Network Design with Selfish Agents. COCOON 2005: 167-178 | |
| 16 | Piotr Krysta: Bicriteria Network Design via Iterative Rounding. COCOON 2005: 179-187 | |
| 15 | Piotr Krysta: Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. MFCS 2005: 615-627 | |
| 14 | Patrick Briest, Piotr Krysta, Berthold Vöcking: Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48 | |
| 2004 | ||
| 13 | René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755 | |
| 2003 | ||
| 12 | 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 | Piotr Krysta, Peter Sanders, Berthold Vöcking: Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS 2003: 500-510 | |
| 10 | 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 | 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 | Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish traffic allocation for server farms. STOC 2002: 287-296 | |
| 2001 | ||
| 6 | 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 | Piotr Krysta, Roberto Solis-Oba: Approximation Algorithms for Bounded Facility Location. COCOON 1999: 241-250 | |
| 3 | 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 | |
| 1 | Amit Agarwal | [12] |
| 2 | Tarun Agarwal | [12] |
| 3 | Itai Ashlagi | [27] |
| 4 | Moshe Babaioff | [29] |
| 5 | René Beier | [13] [20] |
| 6 | Piotr Berman | [10] |
| 7 | Patrick Briest | [14] [19] [22] [23] [24] [25] [28] [29] [35] [36] [38] |
| 8 | Sumit Chopra | [12] |
| 9 | Béla Csaba | [8] |
| 10 | Artur Czumaj | [7] [13] [20] [30] |
| 11 | Anja Feldmann | [12] |
| 12 | Dimitris Fotakis | [37] |
| 13 | Leszek Gasieniec | [1] |
| 14 | Leslie Ann Goldberg | [33] |
| 15 | Paul W. Goldberg | [33] |
| 16 | Fabrizio Grandoni | [31] |
| 17 | Martin Hoefer | [17] [23] [25] [28] [38] |
| 18 | Piotr Indyk | [1] |
| 19 | Nils Kammenhuber | [12] |
| 20 | Marek Karpinski | [8] |
| 21 | Jörg Knoche | [21] |
| 22 | V. S. Anil Kumar | [6] |
| 23 | Stefano Leonardi | [31] |
| 24 | Krzysztof Lorys | [3] [18] |
| 25 | Tomasz P. Michalak | [34] |
| 26 | Leszek Pacholski | [2] |
| 27 | Peter Sanders | [11] |
| 28 | Tuomas Sandholm | [34] |
| 29 | Roberto Solis-Oba | [4] [5] |
| 30 | Orestis Telelis | [37] |
| 31 | Moshe Tennenholtz | [27] |
| 32 | Carmine Ventre | [31] [32] [33] |
| 33 | Berthold Vöcking | [7] [11] [12] [13] [14] [20] [26] [30] [35] |
| 34 | Michael Wooldridge (Michael J. Wooldridge) | [34] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page