MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 15 documents:

  1. Computing Equilibria for a Service Provider Game with (Im)perfect Information
    René Beier, Artur Czumaj, Piotr Krysta, and Berthold Vöcking
    ACM Transactions on Algorithms 2 (4): 679-706, 2006

  2. Computing Equilibria for Congestion Games with (Im)perfect Information
    Rene Beier, Piotr Krysta, Artur Czumaj, and Berthold Vöcking
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, January, 11-13, 2004, 739-748
  3. An experimental study of k-splittable scheduling for DNS-based traffic allocation
    Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, and Berthold Vöcking
    In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, Klagenfurt, Austria, June 30 - July 4, 2003, 2003, 230-235
  4. Approximating Minimum Size 1,2-Connected Networks
    Piotr Krysta
    Discrete Applied Mathematics 125: 267-288, 2003
  5. Optimizing Misdirection
    Piotr Berman and Piotr Krysta
    In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, USA, January, 12-14, 2003, 192-201
  6. Scheduling and Traffic Allocation for Tasks with Bounded Splittability
    Piotr Krysta, Peter Sanders, and Berthold Vöcking
    In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Agust, 25 - August, 29, 2003, 500-510
  7. Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
    Bela Csaba, Piotr Krysta, and Marek Karpinski
    In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), San Francisco, CA, USA, 2002, 74-83
  8. Selfish Traffic Allocation for Server Farms
    Artur Czumaj, Piotr Krysta, and Berthold Vöcking
    In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), Montreal, Canada, 2002, 287-296
  9. Approximation Algorithms for Bounded Facility Location
    Piotr Krysta and Roberto Solis-Oba
    Journal of Combinatorial Optimization 5 (2): 233-247, 2001
  10. Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
    Piotr Krysta
    Doctoral dissertation, Universität des Saarlandes, 2001
  11. Approximation Algorithms for Minimum Size 2-connectivity Problems
    Piotr Krysta and V. S. Anil Kumar
    In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), Dresden, Germany, February 15-17, 2001, 431-442
  12. External inverse pattern matching
    Leszek Gasieniec, Piotr Indyk, and Piotr Krysta
    In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), Aarhus, Denmark, June 30 - July 2, 1997, 90-101
  13. Approximation algorithms for bounded facility location
    Piotr Krysta and Roberto Solis-Oba
    In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), Tokyo, Japan, July, 26 - July, 28, 1999, 241-250
  14. Efficient approximation algorithms for the achromatic number
    Piotr Krysta and Krzysztof Lorys
    In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), Prague, Czech Republic, July, 16-18, 1999, 402-413
  15. The STO problem is NP-complete
    Piotr Krysta and Leszek Pacholski
    Journal of Symbolic Computation 27 (2): 207-219, 1999