| 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 Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Opinion dynamics with limited information Algorithmica | 2023-12-13 | Paper |
Malleable scheduling beyond identical machines Journal of Scheduling | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7650084 (Why is no real title available?) | 2023-02-03 | Paper |
Mechanism design for perturbation stable combinatorial auctions Algorithmic Game Theory | 2022-12-21 | Paper |
Asymptotically optimal communication in simple mechanisms | 2022-12-21 | Paper |
Escaping Braess's paradox through approximate Caratheodory's theorem Information Processing Letters | 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 Algorithmica | 2022-08-03 | Paper |
Metric-Distortion Bounds under Limited Information Journal of Artificial Intelligence Research | 2022-08-02 | Paper |
Mechanism design for perturbation stable combinatorial auctions Theory of Computing Systems | 2022-07-26 | Paper |
scientific article; zbMATH DE number 7561427 (Why is no real title available?) | 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 |
Object allocation and positive graph externalities | 2021-07-06 | Paper |
Reallocating multiple facilities on the line Theoretical Computer Science | 2021-02-03 | Paper |
Efficient Parameter Estimation of Truncated Boolean Product Distributions | 2020-07-05 | Paper |
Scheduling MapReduce jobs on identical and unrelated processors Theory of Computing Systems | 2020-07-02 | Paper |
Opinion dynamics with limited information | 2020-06-18 | Paper |
Improving selfish routing for risk-averse players Theory of Computing Systems | 2020-02-27 | Paper |
Opinion formation games with aggregation and negative influence Theory of Computing Systems | 2019-09-05 | Paper |
Malleable scheduling beyond identical machines | 2019-03-26 | Paper |
Atomic congestion games among coalitions ACM Transactions on Algorithms | 2018-11-05 | Paper |
The power of verification for greedy mechanism design Journal of Artificial Intelligence Research | 2018-08-14 | Paper |
Opinion formation games with aggregation and negative influence Algorithmic Game Theory | 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 AI Communications | 2017-11-07 | Paper |
Resolving Braess's paradox in random networks Algorithmica | 2017-10-09 | Paper |
Stathis Zachos at 70! Lecture Notes in Computer Science | 2017-07-21 | Paper |
Combinatorial auctions without money Algorithmica | 2017-04-12 | Paper |
Selfish transportation games SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Conference program design with single-peaked and single-crossing preferences Web and Internet Economics | 2017-02-10 | Paper |
Efficient money burning in general domains Theory of Computing Systems | 2017-02-01 | Paper |
Strategyproof facility location for concave cost functions Algorithmica | 2016-11-01 | Paper |
On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
A selective tour through congestion games Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
A glimpse at Paul G. Spirakis Algorithms, Probability, Networks, and Games | 2016-01-27 | Paper |
Improving selfish routing for risk-averse players Web and Internet Economics | 2016-01-08 | Paper |
Efficient money burning in general domains Algorithmic Game Theory | 2015-11-04 | Paper |
Influence maximization in switching-selection threshold models Algorithmic Game Theory | 2015-01-14 | Paper |
Resolving Braess's paradox in random networks Web and Internet Economics | 2015-01-12 | Paper |
Truthfulness flooded domains and the power of verification for mechanism design Web and Internet Economics | 2015-01-12 | Paper |
Combined land-use and water allocation planning Annals of Operations Research | 2014-11-26 | Paper |
Memoryless facility location in one pass ACM Transactions on Algorithms | 2014-09-09 | Paper |
Online sum-radii clustering Theoretical Computer Science | 2014-06-06 | Paper |
On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities Theoretical Computer Science | 2014-06-06 | Paper |
On the hardness of network design for bottleneck routing games Theoretical Computer Science | 2014-01-22 | Paper |
Stochastic congestion games with risk-averse players Algorithmic Game Theory | 2013-10-23 | Paper |
On the power of deterministic mechanisms for facility location games Automata, Languages, and Programming | 2013-08-06 | Paper |
On the hardness of network design for bottleneck routing games Algorithmic Game Theory | 2013-03-13 | Paper |
Winner-imposing strategyproof mechanisms for multiple facility location games Theoretical Computer Science | 2013-03-04 | Paper |
The impact of social ignorance on weighted congestion games Theory of Computing Systems | 2012-12-06 | Paper |
Online sum-radii clustering Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Efficient methods for selfish network design Theoretical Computer Science | 2012-08-09 | Paper |
A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems Applied Mathematics and Computation | 2012-06-11 | Paper |
Externalities among Advertisers in Sponsored Search Algorithmic Game Theory | 2011-10-28 | Paper |
On the existence of optimal taxes for network congestion games with heterogeneous users Algorithmic Game Theory | 2010-10-19 | Paper |
Atomic congestion games: fast, myopic and concurrent Theory of Computing Systems | 2010-08-13 | Paper |
Congestion games with linearly independent paths: convergence time and price of anarchy Theory of Computing Systems | 2010-08-13 | Paper |
Stackelberg strategies for atomic congestion games Theory of Computing Systems | 2010-08-13 | Paper |
Cost-balancing tolls for atomic network congestion games Internet Mathematics | 2010-07-09 | Paper |
The structure and complexity of Nash equilibria for a selfish routing game Theoretical Computer Science | 2009-08-21 | Paper |
Efficient Methods for Selfish Network Design Automata, Languages and Programming | 2009-07-14 | Paper |
Atomic Congestion Games Among Coalitions Automata, Languages and Programming | 2009-03-12 | Paper |
Stackelberg Strategies for Atomic Congestion Games Algorithms – ESA 2007 | 2008-09-25 | Paper |
A primal-dual algorithm for online non-uniform facility location Journal of Discrete Algorithms | 2008-05-16 | Paper |
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy Algorithmic Game Theory | 2008-05-02 | Paper |
Atomic Congestion Games: Fast, Myopic and Concurrent Algorithmic Game Theory | 2008-05-02 | Paper |
Memoryless Facility Location in One Pass STACS 2006 | 2008-03-19 | Paper |
On the competitive ratio for online facility location Algorithmica | 2008-02-18 | Paper |
scientific article; zbMATH DE number 5145382 (Why is no real title available?) | 2007-04-23 | Paper |
Approximation and Online Algorithms Lecture Notes in Computer Science | 2007-02-12 | Paper |
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies Journal of Discrete Algorithms | 2006-10-31 | Paper |
Incremental algorithms for facility location and \(k\)-median Theoretical Computer Science | 2006-09-14 | Paper |
Selfish unsplittable flows Theoretical Computer Science | 2006-01-09 | Paper |
Radiocoloring in planar graphs: Complexity and approximations Theoretical Computer Science | 2005-09-22 | Paper |
Automata, Languages and Programming Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004 Lecture Notes in Computer Science | 2005-08-18 | Paper |
Space efficient hash tables with worst case constant access time Theory of Computing Systems | 2005-04-19 | Paper |
scientific article; zbMATH DE number 2086616 (Why is no real title available?) | 2004-08-11 | Paper |
scientific article; zbMATH DE number 2038744 (Why is no real title available?) | 2004-02-08 | Paper |
scientific article; zbMATH DE number 1962820 (Why is no real title available?) | 2003-08-11 | Paper |
scientific article; zbMATH DE number 1953096 (Why is no real title available?) | 2003-07-25 | Paper |
scientific article; zbMATH DE number 1929928 (Why is no real title available?) | 2003-06-18 | Paper |
scientific article; zbMATH DE number 1862255 (Why is no real title available?) | 2003-01-30 | Paper |
scientific article; zbMATH DE number 1819633 (Why is no real title available?) | 2002-12-10 | Paper |
scientific article; zbMATH DE number 1795717 (Why is no real title available?) | 2002-11-11 | Paper |
scientific article; zbMATH DE number 1759423 (Why is no real title available?) | 2002-11-04 | Paper |
Minimum congestion redundant assignments to tolerate random faults Algorithmica | 2002-05-21 | Paper |
scientific article; zbMATH DE number 1703855 (Why is no real title available?) | 2002-02-13 | Paper |
scientific article; zbMATH DE number 1560339 (Why is no real title available?) | 2001-04-26 | Paper |
scientific article; zbMATH DE number 1302022 (Why is no real title available?) | 1999-06-16 | Paper |
scientific article; zbMATH DE number 1263991 (Why is no real title available?) | 1999-03-16 | Paper |
scientific article; zbMATH DE number 1114044 (Why is no real title available?) | 1998-06-11 | Paper |