| Publication | Date of Publication | Type |
|---|
| Graph connectivity with noisy queries | 2024-12-03 | Paper |
| A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds | 2024-08-20 | Paper |
| Opinion dynamics with limited information | 2023-12-13 | Paper |
| Malleable scheduling beyond identical machines | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875469 | 2023-02-03 | Paper |
| Mechanism design for perturbation stable combinatorial auctions | 2022-12-21 | Paper |
| Asymptotically optimal communication in simple mechanisms | 2022-12-21 | Paper |
| Escaping Braess's paradox through approximate Caratheodory's theorem | 2022-10-28 | Paper |
| A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds | 2022-08-16 | Paper |
| Efficient parameter estimation of truncated Boolean product distributions | 2022-08-03 | Paper |
| Metric-Distortion Bounds under Limited Information | 2022-08-02 | Paper |
| Mechanism design for perturbation stable combinatorial auctions | 2022-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091070 | 2022-07-21 | Paper |
| Strategyproof facility location in perturbation stable instances | 2022-07-06 | Paper |
| Metric-distortion bounds under limited information | 2022-06-01 | Paper |
| Memoryless algorithms for the generalized k-server problem on uniform metrics | 2022-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999211 | 2021-07-06 | Paper |
| Reallocating multiple facilities on the line | 2021-02-03 | Paper |
| Efficient Parameter Estimation of Truncated Boolean Product Distributions | 2020-07-05 | Paper |
| Scheduling MapReduce jobs on identical and unrelated processors | 2020-07-02 | Paper |
| Opinion dynamics with limited information | 2020-06-18 | Paper |
| Improving selfish routing for risk-averse players | 2020-02-27 | Paper |
| Opinion formation games with aggregation and negative influence | 2019-09-05 | Paper |
| Malleable scheduling beyond identical machines | 2019-03-26 | Paper |
| Atomic congestion games among coalitions | 2018-11-05 | Paper |
| The Power of Verification for Greedy Mechanism Design | 2018-08-14 | Paper |
| Opinion formation games with aggregation and negative influence | 2018-02-13 | Paper |
| Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse | 2018-01-24 | Paper |
| Scheduling MapReduce jobs under multi-round precedences | 2018-01-11 | Paper |
| On the Size and the Approximability of Minimum Temporally Connected Subgraphs | 2017-12-19 | Paper |
| Efficient lineage for SUM aggregate queries | 2017-11-07 | Paper |
| Resolving Braess's paradox in random networks | 2017-10-09 | Paper |
| Stathis Zachos at 70! | 2017-07-21 | Paper |
| Combinatorial auctions without money | 2017-04-12 | Paper |
| Selfish Transportation Games | 2017-04-04 | Paper |
| Conference Program Design with Single-Peaked and Single-Crossing Preferences | 2017-02-10 | Paper |
| Efficient money burning in general domains | 2017-02-01 | Paper |
| Strategyproof facility location for concave cost functions | 2016-11-01 | Paper |
| On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations | 2016-01-27 | Paper |
| A Selective Tour Through Congestion Games | 2016-01-27 | Paper |
| A Glimpse at Paul G. Spirakis | 2016-01-27 | Paper |
| Improving Selfish Routing for Risk-Averse Players | 2016-01-08 | Paper |
| Efficient Money Burning in General Domains | 2015-11-04 | Paper |
| Influence Maximization in Switching-Selection Threshold Models | 2015-01-14 | Paper |
| Resolving Braess’s Paradox in Random Networks | 2015-01-12 | Paper |
| Truthfulness Flooded Domains and the Power of Verification for Mechanism Design | 2015-01-12 | Paper |
| Combined land-use and water allocation planning | 2014-11-26 | Paper |
| Memoryless facility location in one pass | 2014-09-09 | Paper |
| Online sum-radii clustering | 2014-06-06 | Paper |
| On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities | 2014-06-06 | Paper |
| On the hardness of network design for bottleneck routing games | 2014-01-22 | Paper |
| Stochastic Congestion Games with Risk-Averse Players | 2013-10-23 | Paper |
| On the Power of Deterministic Mechanisms for Facility Location Games | 2013-08-06 | Paper |
| On the Hardness of Network Design for Bottleneck Routing Games | 2013-03-13 | Paper |
| Winner-imposing strategyproof mechanisms for multiple facility location games | 2013-03-04 | Paper |
| The impact of social ignorance on weighted congestion games | 2012-12-06 | Paper |
| Online Sum-Radii Clustering | 2012-09-25 | Paper |
| Efficient methods for selfish network design | 2012-08-09 | Paper |
| A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems | 2012-06-11 | Paper |
| Externalities among Advertisers in Sponsored Search | 2011-10-28 | Paper |
| On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users | 2010-10-19 | Paper |
| Atomic congestion games: fast, myopic and concurrent | 2010-08-13 | Paper |
| Congestion games with linearly independent paths: convergence time and price of anarchy | 2010-08-13 | Paper |
| Stackelberg strategies for atomic congestion games | 2010-08-13 | Paper |
| Cost-Balancing Tolls for Atomic Network Congestion Games | 2010-07-09 | Paper |
| The structure and complexity of Nash equilibria for a selfish routing game | 2009-08-21 | Paper |
| Efficient Methods for Selfish Network Design | 2009-07-14 | Paper |
| Atomic Congestion Games Among Coalitions | 2009-03-12 | Paper |
| Stackelberg Strategies for Atomic Congestion Games | 2008-09-25 | Paper |
| A primal-dual algorithm for online non-uniform facility location | 2008-05-16 | Paper |
| Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy | 2008-05-02 | Paper |
| Atomic Congestion Games: Fast, Myopic and Concurrent | 2008-05-02 | Paper |
| Memoryless Facility Location in One Pass | 2008-03-19 | Paper |
| On the competitive ratio for online facility location | 2008-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433948 | 2007-04-23 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies | 2006-10-31 | Paper |
| Incremental algorithms for facility location and \(k\)-median | 2006-09-14 | Paper |
| Selfish unsplittable flows | 2006-01-09 | Paper |
| Radiocoloring in planar graphs: Complexity and approximations | 2005-09-22 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Space efficient hash tables with worst case constant access time | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737150 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449209 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418656 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414500 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708560 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791664 | 2003-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152424 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550766 | 2002-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536372 | 2002-11-04 | Paper |
| Minimum congestion redundant assignments to tolerate random faults | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2770494 | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527190 | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247263 | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232883 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375813 | 1998-06-11 | Paper |
