| Publication | Date of Publication | Type |
|---|
Sequential solutions in machine scheduling games
Journal of Scheduling | 2024-10-16 | Paper |
| Truthful mechanisms for delivery with agents | 2024-07-11 | Paper |
| Upward drawings of search trees (extended abstract) | 2024-06-05 | Paper |
New Constructions of Obviously Strategyproof Mechanisms
Mathematics of Operations Research | 2024-02-23 | Paper |
New Constructions of Obviously Strategyproof Mechanisms
Mathematics of Operations Research | 2024-02-23 | Paper |
Sequential solutions in machine scheduling games
(available as arXiv preprint) | 2023-03-21 | Paper |
| scientific article; zbMATH DE number 7650297 (Why is no real title available?) | 2023-02-03 | Paper |
| Equilibria of Games in Networks for Local Tasks | 2022-07-21 | Paper |
Two-way greedy: algorithms for imperfect rationality
(available as arXiv preprint) | 2022-07-06 | Paper |
| Obviously Strategyproof Mechanisms for Machine Scheduling. | 2022-05-11 | Paper |
Optimal sorting with persistent comparison errors
(available as arXiv preprint) | 2022-05-11 | Paper |
Sorting with Recurrent Comparison Errors
(available as arXiv preprint) | 2020-11-25 | Paper |
Inversions from sorting with distance-based errors
SOFSEM 2018: Theory and Practice of Computer Science | 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
Theory of Computing Systems | 2020-04-15 | Paper |
Independent lazy better-response dynamics on network games
(available as arXiv preprint) | 2020-02-06 | Paper |
Online scheduling of jobs with favorite machines
Computers & Operations Research | 2020-01-27 | Paper |
Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
Operations Research Letters | 2019-01-11 | Paper |
The price of anarchy and stability in general noisy best-response dynamics
International Journal of Game Theory | 2018-11-09 | Paper |
Routing selfish unsplittable traffic
ACM Transactions on Algorithms | 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
Games and Economic Behavior | 2018-10-12 | Paper |
scientific article; zbMATH DE number 6862102 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy
(available as arXiv preprint) | 2018-03-26 | Paper |
Convergence to equilibrium of logit dynamics for strategic games
Algorithmica | 2016-11-01 | Paper |
On computing the total displacement number via weighted Motzkin paths
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Bribeproof Mechanisms for Two-Values Domains
Algorithmic Game Theory | 2016-09-29 | Paper |
On the approximability of two tree drawing conventions
Information Processing Letters | 2016-06-16 | Paper |
Mechanisms for scheduling with single-bit private values
Theory of Computing Systems | 2016-01-13 | Paper |
Imperfect best-response mechanisms
Theory of Computing Systems | 2016-01-13 | Paper |
Logit dynamics with concurrent updates for local interaction potential games
Algorithmica | 2015-11-19 | Paper |
Collusion-resistant mechanisms with verification yielding optimal solutions
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
On sampling simple paths in planar graphs according to their lengths
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Optimal collusion-resistant mechanisms with verification
Games and Economic Behavior | 2014-06-19 | Paper |
Imperfect best-response mechanisms
Lecture Notes in Computer Science | 2013-10-23 | Paper |
Logit Dynamics with Concurrent Updates for Local Interaction Games
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Mechanisms for scheduling with single-bit private values
Algorithmic Game Theory | 2013-03-13 | Paper |
Online train disposition: to wait or not to wait?
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Private Capacities in Mechanism Design
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
On designing truthful mechanisms for online scheduling
Theoretical Computer Science | 2009-08-21 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Strongly polynomial-time truthful mechanisms in one shot
Theoretical Computer Science | 2009-04-29 | Paper |
New Constructions of Mechanisms with Verification
Automata, Languages and Programming | 2009-03-12 | Paper |
The power of verification for one-parameter agents
Journal of Computer and System Sciences | 2009-03-02 | Paper |
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
Algorithms - ESA 2008 | 2008-11-25 | Paper |
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
On-line load balancing made simple: greedy strikes back
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Alternatives to Truthfulness Are Hard to Recognize
Algorithmic Game Theory | 2008-05-02 | Paper |
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms
STACS 2006 | 2008-03-19 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Partial digest is hard to solve for erroneous input data
Theoretical Computer Science | 2006-03-20 | Paper |
XOR-based schemes for fast parallel IP lookups
Theory of Computing Systems | 2006-02-08 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Theoretical Computer Science | 2005-10-26 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2163018 (Why is no real title available?) | 2005-04-29 | Paper |
Proximity drawings in polynomial area and volume
Computational Geometry | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2081007 (Why is no real title available?) | 2004-08-04 | Paper |
On-line algorithms for the channel assignment problem in cellular networks.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038778 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2011862 (Why is no real title available?) | 2003-12-02 | Paper |
| scientific article; zbMATH DE number 2011860 (Why is no real title available?) | 2003-12-02 | Paper |
The minimum range assignment problem on linear radio networks
Algorithmica | 2003-06-02 | Paper |
| scientific article; zbMATH DE number 1848288 (Why is no real title available?) | 2003-02-04 | Paper |
| scientific article; zbMATH DE number 1688358 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1670654 (Why is no real title available?) | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1500550 (Why is no real title available?) | 2001-12-05 | Paper |
| scientific article; zbMATH DE number 1500518 (Why is no real title available?) | 2001-01-24 | Paper |
Strictly-upward drawings of ordered search trees
Theoretical Computer Science | 1999-01-12 | Paper |
Linear area upward drawings of AVL trees
Computational Geometry | 1998-04-13 | Paper |
