| Publication | Date of Publication | Type |
|---|
| The last success problem with samples | 2026-05-26 | Paper |
| Minimizing symmetric convex functions over hybrid of continuous and discrete convex sets | 2026-01-14 | Paper |
Towards optimal subsidy bounds for envy-freeable allocations
Artificial Intelligence | 2025-10-14 | Paper |
Efficient and strategy-proof mechanism under general constraints
Theoretical Economics | 2025-07-23 | Paper |
| Online contention resolution schemes for size-stochastic knapsacks | 2025-04-15 | Paper |
Fair division with two-sided preferences
Games and Economic Behavior | 2024-11-06 | Paper |
Efficient matching under general constraints
Games and Economic Behavior | 2024-07-01 | Paper |
A fair and truthful mechanism with limited subsidy
Games and Economic Behavior | 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
Algorithmica | 2024-01-25 | Paper |
| The Last Success Problem with a Single Sample | 2023-08-18 | Paper |
Stochastic input models for online computing
(available as arXiv preprint) | 2023-07-28 | Paper |
Online max-min fair allocation
Algorithmic Game Theory | 2023-07-28 | Paper |
Fair ride allocation on a line
Algorithmic Game Theory | 2023-07-28 | Paper |
scientific article; zbMATH DE number 7650261 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Tight approximation for unconstrained XOS maximization
Mathematics of Operations Research | 2022-02-08 | Paper |
Subgame perfect equilibria under the deferred acceptance algorithm
International Journal of Game Theory | 2021-07-15 | Paper |
Optimal matroid partitioning problems
Algorithmica | 2021-06-11 | Paper |
Additive approximation algorithms for modularity maximization
Journal of Computer and System Sciences | 2021-02-02 | Paper |
Optimal matroid partitioning problems
(available as arXiv preprint) | 2020-11-25 | Paper |
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
Information Processing Letters | 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
Journal of Combinatorial Theory. Series B | 2020-04-22 | Paper |
Submodular maximization with uncertain knapsack capacity
(available as arXiv preprint) | 2020-02-12 | Paper |
Surrogate optimization for \(p\)-norms
Discrete Optimization | 2019-11-28 | Paper |
Unit cost buyback problem
Theory of Computing Systems | 2019-09-05 | Paper |
Submodular maximization with uncertain knapsack capacity
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Proportional cost buyback problem with weight bounds
Theoretical Computer Science | 2019-06-25 | Paper |
Antimatroids induced by matchings
Discrete Applied Mathematics | 2019-03-11 | Paper |
The densest subgraph problem with a convex/concave size function
Algorithmica | 2018-10-18 | Paper |
The densest subgraph problem with a convex/concave size function
Algorithmica | 2018-10-18 | Paper |
Optimal composition ordering problems for piecewise linear functions
Algorithmica | 2018-07-25 | Paper |
| The densest subgraph problem with a convex/concave size function | 2018-04-19 | Paper |
Additive approximation algorithms for modularity maximization
(available as arXiv preprint) | 2018-04-19 | Paper |
scientific article; zbMATH DE number 6861975 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
| Surrogate optimization for p-norms | 2018-04-19 | Paper |
Proportional Cost Buyback Problem with Weight Bounds
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
The Secretary Problem with a Choice Function
Algorithms and Computation | 2016-01-11 | Paper |
Finding a path in group-labeled graphs with two labels forbidden
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Online unweighted knapsack problem with removal cost
Algorithmica | 2015-01-19 | Paper |
On packing arborescences in temporal networks
Information Processing Letters | 2014-12-09 | Paper |
Randomized algorithms for online knapsack problems
Theoretical Computer Science | 2014-12-02 | Paper |
Online removable knapsack problem under convex function
Theoretical Computer Science | 2014-06-06 | Paper |
Randomized algorithms for removable online knapsack problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Unit cost buyback problem
Algorithms and Computation | 2014-01-14 | Paper |
Nash equilibria with minimum potential in undirected broadcast games
Theoretical Computer Science | 2014-01-09 | Paper |
Online knapsack problem with removal cost
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Nash equilibria with minimum potential in undirected broadcast games
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Micromechanical analysis of the off-axis rate-dependent inelastic behavior of unidirectional \(AS4/PEEK\) at high temperature
International Journal of Mechanical Sciences | 2002-02-12 | Paper |
