| Publication | Date of Publication | Type |
|---|
| Optimal in-place suffix sorting | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874506 | 2023-02-07 | Paper |
| Approximation algorithms for clustering with dynamic points | 2022-08-26 | Paper |
| Optimal in-place suffix sorting | 2022-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002731 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116489 | 2020-08-25 | Paper |
| Odd Yao-Yao Graphs are Not Spanners | 2020-08-18 | Paper |
| Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems | 2020-03-12 | Paper |
| Approximation algorithms for the connected sensor cover problem | 2020-01-29 | Paper |
| Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference | 2019-08-23 | Paper |
| A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median | 2019-06-20 | Paper |
| Coordination of supply chain with a dominant retailer under demand disruptions | 2019-02-08 | Paper |
| A two-stage mechanism for ordinal peer assessment | 2018-11-08 | Paper |
| A Constant Factor Approximation Algorithm for Fault-Tolerant k -Median | 2018-11-05 | Paper |
| A fully polynomial-time approximation scheme for approximating a sum of random variables | 2018-09-28 | Paper |
| Balanced splitting on weighted intervals | 2018-09-28 | Paper |
| Electronic markets selection in supply chain with uncertain demand and uncertain price | 2018-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174902 | 2018-07-18 | Paper |
| Stochastic k-Center and j-Flat-Center Problems | 2018-07-16 | Paper |
| Near-linear time approximation schemes for geometric maximum coverage | 2018-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606321 | 2018-03-02 | Paper |
| Almost All Even Yao-Yao Graphs Are Spanners | 2018-03-02 | Paper |
| Coordination of supply chain with a dominant retailer under government price regulation by revenue sharing contracts | 2018-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132195 | 2018-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365023 | 2017-09-29 | Paper |
| Capacitated center problems with two-sided bounds and outliers | 2017-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963926 | 2017-02-21 | Paper |
| Matroid and knapsack center problems | 2016-06-28 | Paper |
| Approximation algorithms for stochastic combinatorial optimization problems | 2016-06-01 | Paper |
| Range queries on uncertain data | 2015-12-08 | Paper |
| Approximation algorithms for the connected sensor cover problem | 2015-10-29 | Paper |
| Linear Time Approximation Schemes for Geometric Maximum Coverage | 2015-10-29 | Paper |
| A PTAS for the Weighted Unit Disk Cover Problem | 2015-10-27 | Paper |
| Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points | 2015-10-27 | Paper |
| Efficient algorithms for the one-dimensional \(k\)-center problem | 2015-10-08 | Paper |
| Range queries on uncertain data | 2015-09-11 | Paper |
| Learning Arbitrary Statistical Mixtures of Discrete Distributions | 2015-08-21 | Paper |
| Optimal Allocation for Chunked-Reward Advertising | 2015-01-12 | Paper |
| Forecasting time series with genetic programming based on least square method | 2014-09-15 | Paper |
| Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417714 | 2014-05-22 | Paper |
| Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain | 2013-09-23 | Paper |
| Matroid and knapsack center problems | 2013-03-19 | Paper |
| When LP is the cure for your matching woes: improved bounds for stochastic matchings | 2012-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2916967 | 2012-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2916983 | 2012-10-05 | Paper |
| Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain | 2012-08-14 | Paper |
| The load-distance balancing problem | 2012-06-18 | Paper |
| Risk management of supply and cash flows in supply chains | 2011-07-08 | Paper |
| Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm | 2011-02-25 | Paper |
| New Models and Algorithms for Throughput Maximization in Broadcast Scheduling | 2011-02-15 | Paper |
| Densest k-Subgraph Approximation on Intersection Graphs | 2011-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3054081 | 2010-11-05 | Paper |
| Clustering with Diversity | 2010-09-07 | Paper |
| When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings | 2010-09-06 | Paper |
| An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games | 2010-08-20 | Paper |
| Algorithms for core stability, core largeness, exactness, and extendability of flow games | 2010-02-26 | Paper |
| An Efficient Approximation Algorithm for Maximum Simple Sharing Problem | 2010-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656299 | 2010-01-13 | Paper |
| Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games | 2009-03-06 | Paper |
| More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding | 2009-02-24 | Paper |
| Approximating the Maximum Sharing Problem | 2009-02-17 | Paper |
| More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding | 2008-05-27 | Paper |
| On Approximating the Maximum Simple Sharing Problem | 2008-04-24 | Paper |
| Traversing the Machining Graph | 2008-03-11 | Paper |
| Non-metric Multicommodity and Multilevel Facility Location | 2008-01-04 | Paper |
| Efficient Algorithms for k-Disjoint Paths Problems on DAGs | 2008-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5423451 | 2007-10-23 | Paper |
