| 2025 | ESA | Beating Competitive Ratio 4 for Graphic Matroid Secretary. | Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, Jan Olkowski |
| 2024 | IJCAI | Online Sampling and Decision Making with Low Entropy. | Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski |
| 2024 | SODA | Power of Posted-price Mechanisms for Prophet Inequalities. | Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski |
| 2023 | IJCAI | Adversarial Contention Resolution Games. | Giorgos Chionas, Bogdan S. Chlebus, Dariusz R. Kowalski, Piotr Krysta |
| 2021 | AAAI | Efficient Truthful Scheduling and Resource Allocation through Monitoring. | Dimitris Fotakis, Piotr Krysta, Carmine Ventre |
| 2020 | SODA | Ultimate greedy approximation of independent sets in subcubic graphs. | Piotr Krysta, Mathieu Mari, Nan Zhi |
| 2016 | COCOON | New Results for Network Pollution Games. | Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang |
| 2016 | ICALP | House Markets with Matroid and Knapsack Constraints. | Piotr Krysta, Jinshan Zhang |
| 2015 | IJCAI | Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions. | Piotr Krysta, Orestis Telelis, Carmine Ventre |
| 2012 | ICALP | Online Mechanism Design (Randomized Rounding on the Fly). | Piotr Krysta, Berthold Vcking |
| 2011 | SAGT | Externalities among Advertisers in Sponsored Search. | Dimitris Fotakis, Piotr Krysta, Orestis Telelis |
| 2010 | ESA | Combinatorial Auctions with Verification Are Tractable. | Piotr Krysta, Carmine Ventre |
| 2010 | SODA | Utilitarian Mechanism Design for Multi-Objective Optimization. | Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre |
| 2008 | STACS | Stackelberg Network Pricing Games. | Patrick Briest, Martin Hoefer, Piotr Krysta |
| 2008 | SAGT | On the Approximability of Combinatorial Exchange Problems. | Moshe Babaioff, Patrick Briest, Piotr Krysta |
| 2007 | SODA | Buying cheap is expensive: hardness of non-parametric multi-product pricing. | Patrick Briest, Piotr Krysta |
| 2006 | SODA | Single-minded unlimited supply pricing on sparse instances. | Patrick Briest, Piotr Krysta |
| 2006 | WAOA | An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. | Jrg Knoche, Piotr Krysta |
| 2005 | COCOON | Geometric Network Design with Selfish Agents. | Martin Hoefer, Piotr Krysta |
| 2005 | COCOON | Bicriteria Network Design via Iterative Rounding. | Piotr Krysta |
| 2005 | MFCS | Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. | Piotr Krysta |
| 2005 | STOC | Approximation techniques for utilitarian mechanism design. | Patrick Briest, Piotr Krysta, Berthold Vcking |
| 2004 | SODA | Computing equilibria for congestion games with (im)perfect information. | Ren Beier, Artur Czumaj, Piotr Krysta, Berthold Vcking |
| 2003 | EuroPar | An Experimental Study of | Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, Berthold Vcking |
| 2003 | MFCS | Scheduling and Traffic Allocation for Tasks with Bounded Splittability. | Piotr Krysta, Peter Sanders, Berthold Vcking |
| 2003 | SODA | Optimizing misdirection. | Piotr Berman, Piotr Krysta |
| 2002 | SODA | Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. | Bla Csaba, Marek Karpinski, Piotr Krysta |
| 2002 | STOC | Selfish traffic allocation for server farms. | Artur Czumaj, Piotr Krysta, Berthold Vcking |
| 2001 | STACS | Approximation Algorithms for Minimum Size 2-Connectivity Problems. | Piotr Krysta, V. S. Anil Kumar |
| 1999 | COCOON | Approximation Algorithms for Bounded Facility Location. | Piotr Krysta, Roberto Solis-Oba |
| 1999 | ESA | Efficient Approximation Algorithms for the Achromatic Number. | Piotr Krysta, Krzysztof Lorys |
| 1997 | CPM | External Inverse Pattern Matching. | Leszek Gasieniec, Piotr Indyk, Piotr Krysta |