| Publication | Date of Publication | Type |
|---|
| Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem | 2024-03-12 | Paper |
| The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications | 2024-03-12 | Paper |
| Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps | 2023-09-04 | Paper |
| Approximation algorithms for the generalized incremental knapsack problem | 2023-03-01 | Paper |
| Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model | 2022-12-01 | Paper |
| A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems | 2022-05-31 | Paper |
| Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice | 2022-02-16 | Paper |
| The Approximability of Assortment Optimization Under Ranking Preferences | 2020-11-08 | Paper |
| Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences | 2020-10-12 | Paper |
| The approximability of multiple facility location on directed networks with random arc failures | 2020-09-03 | Paper |
| Online Algorithms for Maximum Cardinality Matching with Edge Arrivals | 2020-05-27 | Paper |
| Approximation Algorithms for Dynamic Assortment Optimization Models | 2020-03-12 | Paper |
| A polynomial-time approximation scheme for the airplane refueling problem | 2019-10-08 | Paper |
| The ordered \(k\)-median problem: surrogate models and approximation algorithms | 2019-08-06 | Paper |
| Online algorithms for maximum cardinality matching with edge arrivals | 2019-05-07 | Paper |
| Maintenance scheduling for modular systems: Modeling and algorithms | 2019-05-02 | Paper |
| Approximation algorithms for sequential batch‐testing of series systems | 2019-05-02 | Paper |
| Assortment planning with nested preferences: dynamic programming with distributions as states? | 2019-01-11 | Paper |
| Optimal codon randomization via mathematical programming | 2018-10-04 | Paper |
| Improved bounds for randomized preemptive online matching | 2018-03-21 | Paper |
| A Sublogarithmic Approximation for Tollbooth Pricing on Trees | 2017-06-02 | Paper |
| The Approximability of Partial Vertex Covers in Trees | 2017-04-04 | Paper |
| Improved Bounds for Online Preemptive Matching | 2017-01-30 | Paper |
| Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand | 2016-05-13 | Paper |
| Robust subgraphs for trees and paths | 2015-09-02 | Paper |
| Approximating \(k\)-generalized connectivity via collapsing HSTs | 2015-08-24 | Paper |
| Set connectivity problems in undirected graphs and the directed steiner network problem | 2014-09-09 | Paper |
| Mobile facility location: combinatorial filtering via weighted occupancy | 2014-07-11 | Paper |
| An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem | 2014-07-11 | Paper |
| Approximation algorithms for orienting mixed graphs | 2014-01-09 | Paper |
| On the Approximability of Reachability-Preserving Network Orientations | 2012-08-29 | Paper |
| Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations | 2012-08-14 | Paper |
| A polylogarithmic approximation for computing non-metric terminal Steiner trees | 2012-03-27 | Paper |
| Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model | 2012-03-15 | Paper |
| IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * | 2012-01-23 | Paper |
| Approximation Algorithms for Orienting Mixed Graphs | 2011-06-29 | Paper |
| A unified approach to approximating partial covering problems | 2011-03-30 | Paper |
| Improved Orientations of Physical Networks | 2010-10-05 | Paper |
| The complexity of bottleneck labeled graph problems | 2010-09-16 | Paper |
| A Sublogarithmic Approximation for Highway and Tollbooth Pricing | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579405 | 2010-08-06 | Paper |
| Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing | 2010-02-23 | Paper |
| Scheduling with Outliers | 2009-10-28 | Paper |
| Path hitting in acyclic graphs | 2009-05-13 | Paper |
| Bi-criteria linear-time approximations for generalized k-mean/median/center | 2009-02-12 | Paper |
| Rounding to an integral program | 2008-09-10 | Paper |
| The Complexity of Bottleneck Labeled Graph Problems | 2008-07-01 | Paper |
| Approximation algorithms and hardness results for labeled connectivity problems | 2008-04-23 | Paper |
| A Unified Approach to Approximating Partial Covering Problems | 2008-03-11 | Paper |
| Path Hitting in Acyclic Graphs | 2008-03-11 | Paper |
| Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing | 2008-03-11 | Paper |
| Approximation Algorithms and Hardness Results for Labeled Connectivity Problems | 2007-09-05 | Paper |
| Improved Online Algorithms for the Sorting Buffer Problem | 2007-09-03 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Partial multicuts in trees | 2007-01-09 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
