| Publication | Date of Publication | Type |
|---|
| A fair and truthful mechanism with limited subsidy | 2024-04-30 | Paper |
| Online scheduling on identical machines with a metric state space | 2024-04-23 | Paper |
| Randomized strategies for robust combinatorial optimization with approximate separation | 2024-01-25 | Paper |
| The Last Success Problem with a Single Sample | 2023-08-18 | Paper |
| Fair ride allocation on a line | 2023-07-28 | Paper |
| Online max-min fair allocation | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6109649 | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875590 | 2023-02-03 | Paper |
| Tight Approximation for Unconstrained XOS Maximization | 2022-02-08 | Paper |
| Subgame perfect equilibria under the deferred acceptance algorithm | 2021-07-15 | Paper |
| Optimal matroid partitioning problems | 2021-06-11 | Paper |
| Additive approximation algorithms for modularity maximization | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136271 | 2020-11-25 | Paper |
| A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption | 2020-10-07 | Paper |
| Optimal Stopping Rules for Sequential Hypothesis Testing | 2020-05-27 | Paper |
| Finding a path with two labels forbidden in group-labeled graphs | 2020-04-22 | Paper |
| Submodular maximization with uncertain knapsack capacity | 2020-02-12 | Paper |
| Surrogate optimization for \(p\)-norms | 2019-11-28 | Paper |
| Unit cost buyback problem | 2019-09-05 | Paper |
| Submodular Maximization with Uncertain Knapsack Capacity | 2019-08-29 | Paper |
| Proportional cost buyback problem with weight bounds | 2019-06-25 | Paper |
| Antimatroids induced by matchings | 2019-03-11 | Paper |
| The densest subgraph problem with a convex/concave size function | 2018-10-18 | Paper |
| Optimal composition ordering problems for piecewise linear functions | 2018-07-25 | Paper |
| Surrogate Optimization for p-Norms | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636525 | 2018-04-19 | Paper |
| Additive Approximation Algorithms for Modularity Maximization | 2018-04-19 | Paper |
| The Densest Subgraph Problem with a Convex/Concave Size Function | 2018-04-19 | Paper |
| Proportional Cost Buyback Problem with Weight Bounds | 2016-02-05 | Paper |
| The Secretary Problem with a Choice Function | 2016-01-11 | Paper |
| Finding a path with two labels forbidden in group-labeled graphs | 2015-10-27 | Paper |
| Online unweighted knapsack problem with removal cost | 2015-01-19 | Paper |
| On packing arborescences in temporal networks | 2014-12-09 | Paper |
| Randomized algorithms for online knapsack problems | 2014-12-02 | Paper |
| Online removable knapsack problem under convex function | 2014-06-06 | Paper |
| Randomized Algorithms for Removable Online Knapsack Problems | 2014-04-03 | Paper |
| Unit Cost Buyback Problem | 2014-01-14 | Paper |
| Nash equilibria with minimum potential in undirected broadcast games | 2014-01-09 | Paper |
| Online Knapsack Problem with Removal Cost | 2012-09-25 | Paper |
| Nash Equilibria with Minimum Potential in Undirected Broadcast Games | 2012-06-08 | Paper |
