| Publication | Date of Publication | Type |
|---|
| Facility location with dynamic distance functions | 2022-12-09 | Paper |
| Correlation clustering in data streams | 2021-06-30 | Paper |
| Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743413 | 2019-05-10 | Paper |
| Approximation algorithms for restless bandit problems | 2019-05-06 | Paper |
| Throughput maximization of real-time scheduling with batching | 2018-11-05 | Paper |
| Approximation algorithms for connected dominating sets | 2017-12-05 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract) | 2016-09-29 | Paper |
| Efficient recovery from power outage (extended abstract) | 2016-09-29 | Paper |
| Approximating the throughput of multiple machines under real-time scheduling | 2016-09-29 | Paper |
| Behavioral Intervention and Non-Uniform Bootstrap Percolation | 2015-12-02 | Paper |
| A constant factor approximation for the single sink edge installation problems | 2015-02-27 | Paper |
| Data-streams and histograms | 2015-02-27 | Paper |
| Model-driven optimization using adaptive probes | 2014-12-18 | Paper |
| Sublinear estimation of entropy and information distances | 2014-11-18 | Paper |
| Improved approximations of crossings in graph drawings | 2014-09-26 | Paper |
| How to probe for an extreme value | 2014-09-09 | Paper |
| Adaptive uncertainty resolution in Bayesian combinatorial optimization problems | 2014-09-09 | Paper |
| Spectral sparsification in dynamic graph streams | 2013-10-04 | Paper |
| Approximate indexability and bandit problems with concave rewards and delayed feedback | 2013-10-04 | Paper |
| Linear programming in the semi-streaming model with application to the maximum matching problem | 2013-06-06 | Paper |
| Linear programming in the semi-streaming model with application to the maximum matching problem | 2011-07-07 | Paper |
| Approximation algorithms for restless bandit problems | 2011-05-16 | Paper |
| Streaming and sublinear approximation of entropy and information distances | 2010-08-16 | Paper |
| Approximation algorithms for wavelet transform coding of data streams | 2010-08-16 | Paper |
| Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate | 2010-08-15 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| A constant factor approximation for the single sink edge installation problem | 2010-01-06 | Paper |
| Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams | 2009-11-06 | Paper |
| Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams | 2009-07-14 | Paper |
| Multi-armed Bandits with Metric Switching Costs | 2009-07-14 | Paper |
| Graph Sparsification in the Semi-streaming Model | 2009-07-14 | Paper |
| Sketching information divergences | 2009-03-31 | Paper |
| Approximation Algorithms for Wavelet Transform Coding of Data Streams | 2009-02-24 | Paper |
| Approximation algorithms for budgeted learning problems | 2009-01-05 | Paper |
| Asymmetric k -center is log * n -hard to approximate | 2008-12-21 | Paper |
| Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination | 2008-08-28 | Paper |
| Sketching Information Divergences | 2008-01-03 | Paper |
| Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming | 2007-11-28 | Paper |
| The Steiner k-Cut Problem | 2006-06-01 | Paper |
| Improved Combinatorial Algorithms for Facility Location Problems | 2005-09-16 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828921 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829023 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829010 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828972 | 2004-11-29 | Paper |
| Capacitated vertex covering | 2004-03-14 | Paper |
| A constant factor approximation algorithm for the fault-tolerant facility location problem | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449175 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542528 | 2004-01-27 | Paper |
| Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas | 2003-06-19 | Paper |
| A constant-factor approximation algorithm for the \(k\)-median problem | 2003-05-04 | Paper |
| Cure: An efficient clustering algorithm for large databases | 2003-02-20 | Paper |
| Improved methods for approximating node weighted Steiner trees and connected dominating sets. | 2003-01-14 | Paper |
| Approximating the throughput of multiple machines in real-time scheduling | 2002-04-23 | Paper |
| Improved algorithms for fault tolerant facility location | 2002-01-30 | Paper |
| Message Multicasting in Heterogeneous Networks | 2000-10-18 | Paper |
| Approximation Algorithms for Directed Steiner Problems | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250234 | 2000-05-25 | Paper |
| Greedy Strikes Back: Improved Facility Location Algorithms | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247267 | 1999-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250182 | 1999-06-17 | Paper |
| Facility location with dynamic distance functions | 1999-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395328 | 1998-10-01 | Paper |
| Approximation algorithms for connected dominating sets | 1998-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542563 | 1998-01-01 | Paper |
