| Publication | Date of Publication | Type |
|---|
| Power of posted-price mechanisms for prophet inequalities | 2024-11-28 | Paper |
| Ultimate greedy approximation of independent sets in subcubic graphs | 2024-10-24 | Paper |
| Ultimate greedy approximation of independent sets in subcubic graphs | 2021-02-02 | Paper |
| Size versus truthfulness in the house allocation problem | 2019-08-20 | Paper |
| Network pollution games | 2019-01-11 | Paper |
| The Power of Verification for Greedy Mechanism Design | 2018-08-14 | Paper |
| House Markets with Matroid and Knapsack Constraints | 2017-12-19 | Paper |
| Combinatorial auctions without money | 2017-04-12 | Paper |
| New Results for Network Pollution Games | 2016-09-02 | Paper |
| Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods | 2015-10-29 | Paper |
| Computing equilibria for a service provider game with (Im)perfect information | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501334 | 2015-08-03 | Paper |
| Combinatorial auctions with verification are tractable | 2015-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934658 | 2014-12-18 | Paper |
| Utilitarian mechanism design for multiobjective optimization | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417649 | 2014-05-22 | Paper |
| Ranking games that have competitiveness-based strategies | 2013-04-17 | Paper |
| Stackelberg Network Pricing Games | 2013-03-19 | Paper |
| Online Mechanism Design (Randomized Rounding on the Fly) | 2012-11-01 | Paper |
| Stackelberg network pricing games | 2012-04-26 | Paper |
| Approximation Techniques for Utilitarian Mechanism Design | 2012-03-15 | Paper |
| Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems | 2012-03-15 | Paper |
| Externalities among Advertisers in Sponsored Search | 2011-10-28 | Paper |
| Selfish Traffic Allocation for Server Farms | 2010-11-04 | Paper |
| Combinatorial Auctions with Verification Are Tractable | 2010-09-06 | Paper |
| Single-minded unlimited supply pricing on sparse instances | 2010-08-16 | Paper |
| Approximation techniques for utilitarian mechanism design | 2010-08-16 | Paper |
| Selfish traffic allocation for server farms | 2010-08-05 | Paper |
| On the Approximability of Combinatorial Exchange Problems | 2008-05-02 | Paper |
| An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions | 2008-02-21 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Efficient approximation algorithms for the achromatic number | 2006-09-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828917 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471294 | 2004-07-28 | Paper |
| Approximating minimum size \{1,2\}-connected networks | 2003-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762522 | 2002-01-09 | Paper |
| Approximation algorithms for bounded facility location problems | 2001-09-19 | Paper |
| The STO problem is NP-complete | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938783 | 2000-03-27 | Paper |
