List of publications
Conferences
Patrick Briest and Piotr Krysta.
Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product
Pricing.
To appear in the Proceedings of The 18th
ACM-SIAM Symposium on Discrete Algorithms (SODA '07),
2007. Also appeared as
ECCC
Technical Report No. TR06-068, 2006.
Jörg Knoche and Piotr Krysta.
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
In the Proceedings of The 4th Workshop on Approximation and Online
Algorithms (WAOA '06), 2006. PS file
PDF file
©
Patrick Briest and Piotr Krysta.
Single-Minded Unlimited Supply Pricing on Sparse Instances.
In the Proceedings of The 17th
ACM-SIAM Symposium on Discrete Algorithms (SODA '06),
2006. PS file
PDF file
©
Piotr Krysta.
Greedy Approximation via Duality for Packing, Combinatorial
Auctions and Routing.
In the Proceedings of The 30th International Symposium on
Mathematical Foundations of Computer Science (MFCS '05),
2005. PS file
PDF file
©
Piotr Krysta.
Bicriteria Network Design via Iterative Rounding.
In the Proceedings of The 11th International Computing and Combinatorics Conference (COCOON '05),
2005. PS file
PDF file
©
Martin Hoefer and Piotr Krysta.
Geometric Network Design with Selfish Agents.
In the Proceedings of The 11th International Computing and Combinatorics Conference (COCOON '05),
2005. PS file
PDF file
©
Patrick Briest, Piotr Krysta and Berthold Vöcking.
Approximation Techniques for Utilitarian Mechanism Design.
In the Proceedings of The 37th
ACM Symposium on Theory of Computing (STOC '05),
2005. PS file
PDF file
©
Rene Beier, Artur Czumaj, Piotr Krysta and Berthold Vöcking.
Computing Equilibria for Congestion Games with (Im)perfect Information.
In the Proceedings of The 15th
ACM-SIAM Symposium on Discrete Algorithms (SODA '04),
2004. PS file
PDF file
©
Piotr Krysta, Peter Sanders and Berthold Vöcking.
Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
In the Proceedings of The 28th International Symposium on
Mathematical Foundations of Computer Science (MFCS '03),
2003. PS file
PDF file
©
Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann,
Nils Kammenhuber, Piotr Krysta and Berthold Vöcking.
An Experimental Study of Different Strategies for DNS-Based Load Balancing.
In the Proceedings of The 9th International Conference on
Parallel and Distributed Computing (EUROPAR '03),
2003.
Piotr Berman and Piotr Krysta.
Optimizing misdirection.
In the Proceedings of The 14th
ACM-SIAM Symposium on Discrete Algorithms (SODA '03),
2003. PS file
PDF file
©
Artur Czumaj, Piotr Krysta and Berthold Vöcking.
Selfish Traffic Allocation for Server Farms.
In the Proceedings of The 34th
ACM Symposium on Theory of Computing (STOC '02),
2002. PS file
PDF file
©
Bela Csaba, Marek Karpinski and Piotr Krysta.
Approximability of Dense and Sparse Instances of Minimum
2-Connectivity, TSP and Path Problems.
In the Proceedings of The 13th
ACM-SIAM Symposium on Discrete Algorithms (SODA '02),
2002. PS file
PDF file
©
Piotr Krysta and V.S. Anil Kumar.
Approximation Algorithms for Minimum Size 2-Connectivity Problems.
In the Proceedings of The 18th International Symposium
on Theoretical Aspects of Computer Science (STACS '01),
2001.
Piotr Krysta and Krzysztof Lorys.
Efficient Approximation Algorithms for the Achromatic Number.
In the Proceedings of The 7th Annual European Symposium on Algorithms
(ESA '99), 1999.
Piotr Krysta and Roberto Solis-Oba.
Approximation Algorithms for Bounded Facility Location.
In the Proceedings of The 5th Annual International Computing and
Combinatorics Conference (COCOON '99), 1999.
Leszek Gasieniec, Piotr Indyk and Piotr Krysta.
External Inverse Pattern Matching.
In the Proceedings of The 8th Annual Symposium on Combinatorial
Pattern Matching (CPM '97), 1997.
Journals
Rene Beier, Artur Czumaj, Piotr Krysta, and Berthold Vöcking.
Computing Equilibria for Congestion Games with (Im)perfect Information.
Accepted to ACM Transactions on Algorithms, April 2005, special issue
of the journal devoted to selected papers from SODA'04.
Piotr Krysta and Krzysztof Lorys.
Efficient Approximation Algorithms for the Achromatic Number.
Theoretical Computer Science, Special issue
on approximation and on-line algorithms, Vol. 361,
pp. 150-171, September, 2006.
Piotr Krysta. Approximating Minimum Size
{1,2}-Connected Networks. Discrete Applied Mathematics,
Vol. 125, pp. 267-288, January, 2003.
Piotr Krysta and Roberto Solis-Oba.
Approximation Algorithms for Bounded Facility Location.
Journal of Combinatorial Optimization, Vol. 5(2),
pp. 233-247, June, 2001.
Piotr Krysta and Leszek Pacholski.
The STO-problem is NP-complete.
Journal of Symbolic Computation, Vol. 27, No. 2,
pp. 207-219, February, 1999.
Piotr Krysta.
Solving Functional Equations. Pi Mu Epsilon Journal,
Vol. 9, No. 10, Fall, 1994.
© Copyright Notice:
The documents distributed by this server have been provided
by the contributing authors as a means to ensure timely
dissemination of scholarly and technical work on a
noncommercial basis. Copyright and all rights therein are
maintained by the authors or by other copyright holders,
notwithstanding that they have offered their works here
electronically. It is understood that all persons copying this
information will adhere to the terms and constraints invoked
by each author's copyright. These works may not be reposted
without the explicit permission of the copyright holder.