| Publication | Date of Publication | Type |
|---|
| Optimizing over serial dictatorships | 2024-11-12 | Paper |
| Optimizing over serial dictatorships | 2024-05-29 | Paper |
| Repeatedly matching items to agents fairly and efficiently | 2024-05-29 | Paper |
| Computing better approximate pure Nash equilibria in cut games via semidefinite programming | 2024-05-08 | Paper |
| Repeatedly matching items to agents fairly and efficiently | 2024-02-23 | Paper |
| Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship | 2024-02-21 | Paper |
| Truthful ownership transfer with expert advice | 2024-02-21 | Paper |
| Portioning using ordinal preferences: fairness and efficiency | 2023-01-04 | Paper |
| The metric distortion of multiwinner voting | 2022-11-08 | Paper |
| On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090386 | 2022-07-18 | Paper |
| Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching | 2022-07-06 | Paper |
| Computing envy-freeable allocations with limited subsidies | 2022-07-06 | Paper |
| Impartial selection with additive approximation guarantees | 2022-06-21 | Paper |
| Almost envy-free allocations with connected bundles | 2022-02-25 | Paper |
| Bounding the inefficiency of compromise in opinion formation | 2022-02-01 | Paper |
| Stable fractional matchings | 2021-11-02 | Paper |
| The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users | 2021-07-15 | Paper |
| On approximate pure Nash equilibria in weighted congestion games with polynomial latencies | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133008 | 2020-11-12 | Paper |
| Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems | 2020-05-27 | Paper |
| Impartial selection with additive approximation guarantees | 2020-02-04 | Paper |
| Limitations of Deterministic Auction Design for Correlated Bidders | 2019-12-06 | Paper |
| Optimizing positional scoring rules for rank aggregation | 2019-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633894 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633920 | 2019-05-06 | Paper |
| An almost ideal coordination mechanism for unrelated machine scheduling | 2019-03-21 | Paper |
| Information Retention in Heterogeneous Majority Dynamics | 2019-01-30 | Paper |
| Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling | 2019-01-30 | Paper |
| Opting Into Optimal Matchings | 2018-07-16 | Paper |
| Near-optimal asymmetric binary matrix partitions | 2018-02-28 | Paper |
| Efficiency and complexity of price competition among single-product vendors | 2017-09-29 | Paper |
| Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games | 2017-05-02 | Paper |
| Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship | 2017-02-10 | Paper |
| Welfare guarantees for proportional allocations | 2017-02-01 | Paper |
| Subset Selection Via Implicit Utilitarian Voting | 2017-01-18 | Paper |
| An almost ideal coordination mechanism for unrelated machine scheduling | 2016-09-29 | Paper |
| Minority Becomes Majority in Social Networks | 2016-01-08 | Paper |
| Optimal social choice functions: a utilitarian view | 2015-12-21 | Paper |
| Space lower bounds for low-stretch greedy embeddings | 2015-12-10 | Paper |
| Near-Optimal Asymmetric Binary Matrix Partitions | 2015-09-16 | Paper |
| Socially desirable approximations for dodgson’s voting rule | 2015-08-14 | Paper |
| An improved 2-agent kidney exchange mechanism | 2015-06-01 | Paper |
| Enforcing efficient equilibria in network design games via subsidies | 2015-05-21 | Paper |
| Bounding the inefficiency of outcomes in generalized second price auctions | 2015-02-13 | Paper |
| Welfare Guarantees for Proportional Allocations | 2015-01-14 | Paper |
| Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games | 2015-01-14 | Paper |
| Taxes for linear atomic congestion games | 2014-09-09 | Paper |
| Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games | 2014-07-30 | Paper |
| Limitations of Deterministic Auction Design for Correlated Bidders | 2013-09-17 | Paper |
| Tight approximation bounds for combinatorial frugal coverage algorithms | 2013-08-02 | Paper |
| Improved lower bounds on the price of stability of undirected network design games | 2013-08-01 | Paper |
| Efficient coordination mechanisms for unrelated machine scheduling | 2013-06-25 | Paper |
| Energy-efficient communication in multi-interface wireless networks | 2013-04-15 | Paper |
| A 6/5-approximation algorithm for the maximum 3-cover problem | 2013-04-08 | Paper |
| The efficiency of fair division | 2012-12-06 | Paper |
| On the approximability of Dodgson and Young elections | 2012-11-15 | Paper |
| Space Lower Bounds for Low-Stretch Greedy Embeddings | 2012-09-26 | Paper |
| Revenue Guarantees in Sponsored Search Auctions | 2012-09-25 | Paper |
| Voting almost maximizes social welfare despite limited communication | 2011-11-17 | Paper |
| Tight bounds for selfish and greedy load balancing | 2011-11-07 | Paper |
| Tight approximation bounds for greedy frugal coverage algorithms | 2011-06-03 | Paper |
| Improved lower bounds on the price of stability of undirected network design games | 2010-10-19 | Paper |
| Fractional path coloring in bounded degree trees with applications | 2010-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579419 | 2010-08-06 | Paper |
| Wavelength management in WDM rings to maximize the number of connections | 2010-06-01 | Paper |
| Game-theoretic approaches to optimization problems in communication networks | 2010-02-09 | Paper |
| Energy consumption minimization in ad hoc wireless and multi-interface networks | 2010-02-09 | Paper |
| On Low-Envy Truthful Allocations | 2009-11-17 | Paper |
| Energy-Efficient Communication in Multi-interface Wireless Networks | 2009-10-16 | Paper |
| An Improved Approximation Bound for Spanning Star Forest and Color Saving | 2009-10-16 | Paper |
| Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs | 2009-09-02 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem | 2009-03-23 | Paper |
| Tight Bounds for Selfish and Greedy Load Balancing | 2009-03-12 | Paper |
| Scheduling to Maximize Participation | 2009-03-05 | Paper |
| A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem | 2009-02-03 | Paper |
| Competitive algorithms and lower bounds for online randomized call control in cellular networks | 2008-12-17 | Paper |
| Scheduling to maximize participation | 2008-08-06 | Paper |
| Approximation Algorithms for Path Coloring in Trees | 2008-03-14 | Paper |
| Taxes for Linear Atomic Congestion Games | 2008-03-11 | Paper |
| Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs | 2008-02-26 | Paper |
| An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks | 2007-11-28 | Paper |
| A tight bound for online colouring of disk graphs | 2007-10-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Wavelength Management in WDM Rings to Maximize the Number of Connections | 2007-09-03 | Paper |
| Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs | 2007-02-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Energy-efficient wireless network design | 2006-10-16 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Approximate constrained bipartite edge coloring | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448743 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427855 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791663 | 2003-01-30 | Paper |
| New bounds on the size of the minimum feedback vertex set in meshes and butterflies. | 2003-01-21 | Paper |
| Randomized path coloring on binary trees. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152809 | 2002-12-10 | Paper |
| Efficient on-line frequency allocation and call control in cellular networks | 2002-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535060 | 2002-06-12 | Paper |
| Sparse and limited wavelength conversion in all-optical tree networks | 2002-03-03 | Paper |
| Edge coloring of bipartite graphs with constraints | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753727 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941916 | 2000-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250414 | 2000-03-29 | Paper |
