Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Krysta, Piotr"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorial auctions with verification are tractable
Piotr Krysta
,
Carmine Ventre
Theoretical Computer Science
571
, 2015, pp. 21-35
Utilitarian mechanism design for multiobjective optimization
Fabrizio Grandoni
,
Piotr Krysta
,
Stefan Leonardi
,
Carmine Ventre
SIAM Journal on Computing
43
(4), 2014, pp. 1263-1290
Ranking games that have competitiveness-based strategies
Leslie Ann Goldberg
,
Paul W. Goldberg
,
Piotr Krysta
,
Carmine Ventre
Theoretical Computer Science
476
, 2013, pp. 24-37
Stackelberg network pricing games
Patrick Briest
,
Martin Hoefer
,
Piotr Krysta
Algorithmica
62
(3-4), 2012, pp. 733-753
Online mechanism design (randomized rounding on the fly)
Piotr Krysta
,
Berthold Vöcking
Lecture Notes in Computer Science
7392
, 2012, pp. 636-647
Approximation techniques for utilitarian mechanism design
Patrick Briest
,
Piotr Krysta
,
Berthold Vöcking
SIAM Journal on Computing
40
(6), 2011, pp. 1587-1622
Buying cheap is expensive: Approximability of combinatorial pricing problems
Patrick Briest
,
Piotr Krysta
SIAM Journal on Computing
40
(6), 2011, pp. 1554-1586
Selfish traffic allocation for server farms
Artur Czumaj
,
Piotr Krysta
,
Berthold Vöcking
SIAM Journal on Computing
39
(5), 2010, pp. 1957-1987
Combinatorial auctions with verification are tractable
Piotr Krysta
,
Carmine Ventre
Lecture Notes in Computer Science
6347
, 2010, pp. 39-50
Stackelberg network pricing games
Patrick Briest
,
Martin Hoefer
,
Piotr Krysta
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 133-144
Efficient approximation algorithms for the achromatic number
Piotr Krysta
,
Krzysztof Loryś
Theoretical Computer Science
361
(2-3), 2006, pp. 150-171
Approximation techniques for utilitarian mechanism design
Patrick Briest
,
Piotr Krysta
,
Berthold Vöcking
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 39-48
Geometric network design with selfish agents
Martin Hoefer
,
Piotr Krysta
Lecture Notes in Computer Science
3595
, 2005, pp. 167-178
Bicriteria network design via iterative rounding
Piotr Krysta
Lecture Notes in Computer Science
3595
, 2005, pp. 179-187
Greedy approximation via duality for packing, combinatorial auctions and routing
Piotr Krysta
Lecture Notes in Computer Science
3618
, 2005, pp. 615-627
Scheduling and traffic allocation for tasks with bounded splittability
Piotr Krysta
,
Peter Sanders
,
Berthold Vöcking
Lecture Notes in Computer Science
2747
, 2003, pp. 500-510
Selfish traffic allocation for server farms
Artur Czumaj
,
Piotr Krysta
,
Berthold Vöcking
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 287-296
Approximation algorithms for minimum size 2-connectivity problems
Piotr Krysta
,
V.S. Anil Kumar
Lecture Notes in Computer Science
2010
, 2001, pp. 431-442
Efficient approximation algorithms for the achromatic number
Piotr Krysta
,
Krzysztof Loryś
Lecture Notes in Computer Science
1643
, 1999, pp. 402-413
The STO problem is
NP
-complete
Piotr Krysta
,
Leszek Pacholski
Journal Symbolic Computation
27
(2), 1999, pp. 207-219
Approximation algorithms for bounded facility location
Piotr Krysta
,
Roberto Solis-Oba
Lecture Notes in Computer Science
1627
, 1999, pp. 241-250
External inverse pattern matching
Leszek Ga̧sieniec
,
Piotr Indyk
,
Piotr Krysta
Lecture Notes in Computer Science
1264
, 1997, pp. 90-101