| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7799586 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
Scheduling split intervals with non-uniform demands
Discrete Optimization | 2021-01-15 | Paper |
Set cover problems with small neighborhood covers
Theory of Computing Systems | 2019-09-05 | Paper |
Improved algorithms for resource allocation under varying capacity
Journal of Scheduling | 2018-11-07 | Paper |
Facility location with red-blue demands
Operations Research Letters | 2018-09-28 | Paper |
| The matroid median problem | 2017-09-29 | Paper |
Replica placement on bounded treewidth graphs
(available as arXiv preprint) | 2017-09-22 | Paper |
| Replica placement on directed acyclic graphs | 2017-04-25 | Paper |
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
(available as arXiv preprint) | 2017-02-21 | Paper |
| Replica Placement via Capacitated Vertex Cover | 2017-02-21 | Paper |
Density functions subject to a co-matroid constraint
(available as arXiv preprint) | 2017-01-26 | Paper |
Scheduling resources for executing a partial set of jobs
(available as arXiv preprint) | 2017-01-26 | Paper |
The update complexity of selection and related problems
Theory of Computing Systems | 2016-09-21 | Paper |
The update complexity of selection and related problems
Theory of Computing Systems | 2016-09-21 | Paper |
Facility Location with Matroid or Knapsack Constraints
Mathematics of Operations Research | 2015-05-29 | Paper |
Distributed algorithms for scheduling on line and tree networks
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Improved algorithms for resource allocation under varying capacity
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Approximation algorithms for the weight-reducible knapsack problem
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Efficient decentralized algorithms for the distributed trigger counting problem
Theory of Computing Systems | 2012-12-07 | Paper |
| The update complexity of selection and related problems | 2012-08-31 | Paper |
| A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints | 2012-08-29 | Paper |
| Finding independent sets in unions of perfect graphs | 2012-08-29 | Paper |
Resource allocation for covering time varying demands
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Scheduling Resources for Throughput Maximization
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Clustering with internal connectedness
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM | 2010-07-14 | Paper |
Approximating Decision Trees with Multiway Branches
Automata, Languages and Programming | 2009-07-14 | Paper |
The Priority k-Median Problem
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
Journal of Computer and System Sciences | 2006-10-05 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
A linear time algorithm for approximate 2-means clustering
Computational Geometry | 2005-11-07 | Paper |
| scientific article; zbMATH DE number 1954394 (Why is no real title available?) | 2003-07-28 | Paper |
