| Publication | Date of Publication | Type |
|---|
| New Constructions of Obviously Strategyproof Mechanisms | 2024-02-23 | Paper |
| Sequential solutions in machine scheduling games | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875632 | 2023-02-03 | Paper |
| Equilibria of Games in Networks for Local Tasks | 2022-07-21 | Paper |
| Two-way greedy: algorithms for imperfect rationality | 2022-07-06 | Paper |
| Obviously Strategyproof Mechanisms for Machine Scheduling. | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075792 | 2022-05-11 | Paper |
| Sorting with Recurrent Comparison Errors | 2020-11-25 | Paper |
| Inversions from Sorting with Distance-Based Errors | 2020-10-21 | Paper |
| Optimal Dislocation with Persistent Errors in Subquadratic Time | 2020-08-05 | Paper |
| Automated optimal OSP mechanisms for set systems. The case of small domains | 2020-06-30 | Paper |
| Optimal dislocation with persistent errors in subquadratic time | 2020-04-15 | Paper |
| Independent lazy better-response dynamics on network games | 2020-02-06 | Paper |
| Online scheduling of jobs with favorite machines | 2020-01-27 | Paper |
| Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games | 2019-01-11 | Paper |
| The price of anarchy and stability in general noisy best-response dynamics | 2018-11-09 | Paper |
| Routing selfish unsplittable traffic | 2018-11-05 | Paper |
| Data delivery by energy-constrained mobile agents | 2018-10-17 | Paper |
| No truthful mechanism can be better than \(n\) approximate for two natural problems | 2018-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636607 | 2018-04-19 | Paper |
| Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy | 2018-03-26 | Paper |
| Convergence to equilibrium of logit dynamics for strategic games | 2016-11-01 | Paper |
| Bribeproof Mechanisms for Two-Values Domains | 2016-09-29 | Paper |
| On Computing the Total Displacement Number via Weighted Motzkin Paths | 2016-09-29 | Paper |
| On the approximability of two tree drawing conventions | 2016-06-16 | Paper |
| Imperfect best-response mechanisms | 2016-01-13 | Paper |
| Mechanisms for scheduling with single-bit private values | 2016-01-13 | Paper |
| Logit dynamics with concurrent updates for local interaction potential games | 2015-11-19 | Paper |
| Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions | 2015-09-24 | Paper |
| On Sampling Simple Paths in Planar Graphs According to Their Lengths | 2015-09-16 | Paper |
| Optimal collusion-resistant mechanisms with verification | 2014-06-19 | Paper |
| Imperfect best-response mechanisms | 2013-10-23 | Paper |
| Logit Dynamics with Concurrent Updates for Local Interaction Games | 2013-09-17 | Paper |
| Mechanisms for Scheduling with Single-Bit Private Values | 2013-03-13 | Paper |
| Online Train Disposition: To Wait or Not to Wait? | 2009-12-03 | Paper |
| Private Capacities in Mechanism Design | 2009-10-16 | Paper |
| On designing truthful mechanisms for online scheduling | 2009-08-21 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Strongly polynomial-time truthful mechanisms in one shot | 2009-04-29 | Paper |
| New Constructions of Mechanisms with Verification | 2009-03-12 | Paper |
| The power of verification for one-parameter agents | 2009-03-02 | Paper |
| Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions | 2008-11-25 | Paper |
| An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem | 2008-07-01 | Paper |
| On-line load balancing made simple: greedy strikes back | 2008-05-16 | Paper |
| Alternatives to Truthfulness Are Hard to Recognize | 2008-05-02 | Paper |
| The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms | 2008-03-19 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Partial digest is hard to solve for erroneous input data | 2006-03-20 | Paper |
| XOR-based schemes for fast parallel IP lookups | 2006-02-08 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents | 2005-10-26 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673403 | 2005-04-29 | Paper |
| Proximity drawings in polynomial area and volume | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474107 | 2004-08-04 | Paper |
| On-line algorithms for the channel assignment problem in cellular networks. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449245 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437512 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437514 | 2003-12-02 | Paper |
| The minimum range assignment problem on linear radio networks | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785466 | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762500 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753931 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501569 | 2001-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501535 | 2001-01-24 | Paper |
| Strictly-upward drawings of ordered search trees | 1999-01-12 | Paper |
| Linear area upward drawings of AVL trees | 1998-04-13 | Paper |
