| Publication | Date of Publication | Type |
|---|
| Contextual Bandits with Cross-Learning | 2024-02-27 | Paper |
| The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems | 2024-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147335 | 2024-01-15 | Paper |
| Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets | 2023-12-08 | Paper |
| The landscape of the proximal point method for nonconvex-nonconcave minimax optimization | 2023-08-01 | Paper |
| Approximately Optimal Core Shapes for Tensor Decompositions | 2023-02-08 | Paper |
| Design and analysis of bipartite experiments under a linear exposure-response model | 2023-02-06 | Paper |
| Dynamic Double Auctions: Toward First Best | 2022-09-19 | Paper |
| Fair Resource Allocation in a Volatile Marketplace | 2022-02-18 | Paper |
| Deals or No Deals: Contract Design for Online Advertising | 2022-02-16 | Paper |
| Budget-Management Strategies in Repeated Auctions | 2021-07-29 | Paper |
| Brief Announcement: MapReduce Algorithms for Massive Trees | 2021-07-28 | Paper |
| Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions | 2021-06-17 | Paper |
| Non‐Clairvoyant Dynamic Mechanism Design | 2021-06-07 | Paper |
| Design and Analysis of Bipartite Experiments under a Linear Exposure-Response Model | 2021-03-10 | Paper |
| Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time | 2021-02-02 | Paper |
| Clinching auctions with online supply | 2020-10-26 | Paper |
| Distributed balanced partitioning via linear embedding | 2020-10-08 | Paper |
| Dual Mirror Descent for Online Allocation Problems | 2020-02-24 | Paper |
| Dynamic Double Auctions: Towards First Best | 2019-10-15 | Paper |
| Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity | 2019-10-15 | Paper |
| Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs | 2019-10-15 | Paper |
| Stochastic bandits robust to adversarial corruptions | 2019-08-22 | Paper |
| Clinching Auctions with Online Supply | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633864 | 2019-05-06 | Paper |
| Limitations of cross-monotonic cost-sharing schemes | 2018-11-05 | Paper |
| Expanders via Local Edge Flips | 2018-07-16 | Paper |
| Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order | 2018-07-04 | Paper |
| Accelerating Greedy Coordinate Descent Methods | 2018-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607920 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598285 | 2017-12-19 | Paper |
| Robust Price of Anarchy Bounds via LP and Fenchel Duality | 2017-10-05 | Paper |
| Locality-sensitive hashing scheme based on p-stable distributions | 2017-09-29 | Paper |
| Robust Hierarchical k-Center Clustering | 2017-05-19 | Paper |
| Polyhedral Clinching Auctions and the AdWords Polytope | 2016-03-24 | Paper |
| Randomized Composable Core-sets for Distributed Submodular Maximization | 2015-08-21 | Paper |
| Online Submodular Welfare Maximization | 2015-08-21 | Paper |
| Decentralized utilitarian mechanisms for scheduling games | 2015-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501328 | 2015-08-03 | Paper |
| On spectrum sharing games | 2015-08-03 | Paper |
| Non-monotone submodular maximization under matroid and knapsack constraints | 2015-02-04 | Paper |
| Bicriteria Online Matching: Maximizing Weight and Cardinality | 2015-01-12 | Paper |
| Concise Bid Optimization Strategies with Multiple Budget Constraints | 2015-01-07 | Paper |
| On the advantage of overlapping clusters for minimizing conductance | 2014-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921718 | 2014-10-13 | Paper |
| On non-progressive spread of influence through social networks | 2014-08-26 | Paper |
| Coordination Mechanisms for Selfish Routing over Time on a Tree | 2014-07-01 | Paper |
| Inner product spaces for MinSum coordination mechanisms | 2014-06-05 | Paper |
| Polyhedral Clinching Auctions and the AdWords Polytope | 2014-05-13 | Paper |
| On spectrum sharing games | 2013-06-28 | Paper |
| PASS approximation: a framework for analyzing and designing heuristics | 2013-05-13 | Paper |
| Equilibrium pricing with positive externalities | 2013-04-17 | Paper |
| A Theoretical Examination of Practical Game Playing: Lookahead Search | 2013-03-13 | Paper |
| Two-stage robust network design with exponential scenarios | 2013-03-05 | Paper |
| Convergence and approximation in potential games | 2012-08-08 | Paper |
| On the Non-progressive Spread of Influence through Social Networks | 2012-06-29 | Paper |
| Advantage of Overlapping Clusters for Minimizing Conductance | 2012-06-29 | Paper |
| Tight Approximation Algorithms for Maximum Separable Assignment Problems | 2012-05-24 | Paper |
| Online Stochastic Weighted Matching: Improved Approximation Algorithms | 2011-12-05 | Paper |
| Maximizing Non-monotone Submodular Functions | 2011-11-07 | Paper |
| Competitive routing over time | 2011-10-10 | Paper |
| Approximating minimum-power degree and connectivity problems | 2011-07-01 | Paper |
| Permutation betting markets: singleton betting with extra information | 2011-07-01 | Paper |
| Uncoordinated Two-Sided Matching Markets | 2011-05-17 | Paper |
| Local Computation of PageRank Contributions | 2011-02-28 | Paper |
| Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints | 2010-12-03 | Paper |
| The myth of the folk theorem | 2010-09-20 | Paper |
| Online Stochastic Packing Applied to Display Ad Allocation | 2010-09-06 | Paper |
| Tight approximation algorithms for maximum general assignment problems | 2010-08-16 | Paper |
| A Unified Approach to Congestion Games and Two-Sided Markets | 2010-07-09 | Paper |
| Secure overlay network design | 2010-03-04 | Paper |
| PASS Approximation | 2009-10-28 | Paper |
| Coordination mechanisms for selfish scheduling | 2009-04-29 | Paper |
| On the Stability of Web Crawling and Web Search | 2009-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549720 | 2009-01-05 | Paper |
| Two-Stage Robust Network Design with Exponential Scenarios | 2008-11-25 | Paper |
| Approximating Minimum-Power Degree and Connectivity Problems | 2008-04-15 | Paper |
| Local Computation of PageRank Contributions | 2008-04-11 | Paper |
| Convergence and Approximation in Potential Games | 2008-03-19 | Paper |
| Traffic engineering of management flows by link augmentations on confluent trees | 2008-02-18 | Paper |
| Secure Overlay Network Design | 2008-01-04 | Paper |
| Power Optimization for Connectivity Problems | 2007-08-30 | Paper |
| Subjective-cost policy routing | 2007-06-13 | Paper |
| Power optimization for connectivity problems | 2007-04-19 | Paper |
| A relation between choosability and uniquely list colorability | 2006-07-12 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| The facility location problem with general cost functions | 2003-08-20 | Paper |
| \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges | 2002-12-10 | Paper |
| Length-constrained path-matchings in graphs | 2002-09-29 | Paper |
| On the simultaneous edge-coloring conjecture | 2001-11-28 | Paper |
