Piotr Krysta

According to our database1, Piotr Krysta authored at least 48 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Ultimate greedy approximation of independent sets in subcubic graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Deterministic coloring algorithms in the LOCAL model.
CoRR, 2019

Size Versus Truthfulness in the House Allocation Problem.
Algorithmica, 2019

Network Pollution Games.
Algorithmica, 2019

Truthful Mechanisms for Multi Agent Self-interested Correspondence Selection.
Proceedings of the Semantic Web - ISWC 2019, 2019

2018
The Power of Verification for Greedy Mechanism Design.
J. Artif. Intell. Res., 2018

2017
Learning Powers of Poisson Binomial Distributions.
CoRR, 2017

Combinatorial Auctions Without Money.
Algorithmica, 2017

Mechanism Design for Ontology Alignment.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Utilitarian Mechanism Design for Single-Minded Agents.
Encyclopedia of Algorithms, 2016

House Markets with Matroid and Knapsack Constraints.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

New Results for Network Pollution Games.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Combinatorial auctions with verification are tractable.
Theor. Comput. Sci., 2015

Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods.
J. Artif. Intell. Res., 2015

Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Utilitarian Mechanism Design for Multiobjective Optimization.
SIAM J. Comput., 2014

2013
Ranking games that have competitiveness-based strategies.
Theor. Comput. Sci., 2013

2012
Stackelberg Network Pricing Games.
Algorithmica, 2012

Limited Supply Online Auctions for Revenue Maximization.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Online Mechanism Design (Randomized Rounding on the Fly).
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Approximation Techniques for Utilitarian Mechanism Design.
SIAM J. Comput., 2011

Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.
SIAM J. Comput., 2011

Externalities among Advertisers in Sponsored Search.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010
Selfish Traffic Allocation for Server Farms.
SIAM J. Comput., 2010

Utilitarian Mechanism Design for Multi-Objective Optimization.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Combinatorial auctions with externalities.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2008
Utilitarian Mechanism Design for Single-Minded Agents.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Social Context Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On the Approximability of Combinatorial Exchange Problems.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2006
Efficient approximation algorithms for the achromatic number.
Theor. Comput. Sci., 2006

Computing equilibria for a service provider game with (Im)perfect information.
ACM Trans. Algorithms, 2006

Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing.
Electronic Colloquium on Computational Complexity (ECCC), 2006

An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Single-minded unlimited supply pricing on sparse instances.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Bicriteria Network Design via Iterative Rounding.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Geometric Network Design with Selfish Agents.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Computing equilibria for congestion games with (im)perfect information.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Approximating minimum size {1, 2}-connected network.
Discret. Appl. Math., 2003

Optimizing misdirection.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

2002
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Approximation Algorithms for Bounded Facility Location Problems.
J. Comb. Optim., 2001

Approximation Algorithms for Minimum Size 2-Connectivity Problems.
Proceedings of the STACS 2001, 2001

1999
The STO problem is NP-complete.
J. Symb. Comput., 1999

Approximation Algorithms for Bounded Facility Location.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1997
External Inverse Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997


  Loading...