The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Piotr Krysta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Hoefer, Piotr Krysta
    Geometric Network Design with Selfish Agents. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:167-178 [Conf]
  2. Piotr Krysta
    Bicriteria Network Design via Iterative Rounding. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:179-187 [Conf]
  3. Piotr Krysta, Roberto Solis-Oba
    Approximation Algorithms for Bounded Facility Location. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:241-250 [Conf]
  4. Leszek Gasieniec, Piotr Indyk, Piotr Krysta
    External Inverse Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:90-101 [Conf]
  5. Piotr Krysta, Krzysztof Lorys
    Efficient Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:402-413 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:230-235 [Conf]
  7. Piotr Krysta
    Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:615-627 [Conf]
  8. Piotr Krysta, Peter Sanders, Berthold Vöcking
    Scheduling and Traffic Allocation for Tasks with Bounded Splittability. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:500-510 [Conf]
  9. René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Computing equilibria for congestion games with (im)perfect information. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:746-755 [Conf]
  10. Piotr Berman, Piotr Krysta
    Optimizing misdirection. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:192-201 [Conf]
  11. Patrick Briest, Piotr Krysta
    Single-minded unlimited supply pricing on sparse instances. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1093-1102 [Conf]
  12. Béla Csaba, Marek Karpinski, Piotr Krysta
    Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:74-83 [Conf]
  13. Piotr Krysta, V. S. Anil Kumar
    Approximation Algorithms for Minimum Size 2-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:431-442 [Conf]
  14. Patrick Briest, Piotr Krysta, Berthold Vöcking
    Approximation techniques for utilitarian mechanism design. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:39-48 [Conf]
  15. Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Selfish traffic allocation for server farms. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:287-296 [Conf]
  16. Jörg Knoche, Piotr Krysta
    An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:265-278 [Conf]
  17. Piotr Krysta
    Approximating minimum size {1, 2}-connected network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:125, n:2-3, pp:267-288 [Journal]
  18. Piotr Krysta, Roberto Solis-Oba
    Approximation Algorithms for Bounded Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:233-247 [Journal]
  19. Piotr Krysta, Leszek Pacholski
    The STO problem is NP-complete. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:2, pp:207-219 [Journal]
  20. René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Computing equilibria for a service provider game with (Im)perfect information. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:679-706 [Journal]
  21. Piotr Krysta, Krzysztof Lorys
    Efficient approximation algorithms for the achromatic number. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:150-171 [Journal]
  22. Patrick Briest, Piotr Krysta
    Buying cheap is expensive: hardness of non-parametric multi-product pricing. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:716-725 [Conf]

  23. Combinatorial auctions with externalities. [Citation Graph (, )][DBLP]


  24. Combinatorial Auctions with Verification Are Tractable. [Citation Graph (, )][DBLP]


  25. Ranking games that have competitiveness-based strategies. [Citation Graph (, )][DBLP]


  26. Utilitarian Mechanism Design for Multi-Objective Optimization. [Citation Graph (, )][DBLP]


  27. Stackelberg Network Pricing Games. [Citation Graph (, )][DBLP]


  28. Social Context Games. [Citation Graph (, )][DBLP]


  29. On the Approximability of Combinatorial Exchange Problems. [Citation Graph (, )][DBLP]


  30. Stackelberg Network Pricing Games [Citation Graph (, )][DBLP]


  31. Stackelberg Network Pricing Games. [Citation Graph (, )][DBLP]


  32. Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002