| Publication | Date of Publication | Type |
|---|
Approximation schemes for Min-Sum \(k\)-Clustering
Discrete Optimization | 2025-01-23 | Paper |
| Approximation schemes for min-sum \(k\)-clustering | 2025-01-06 | Paper |
| Approximation schemes for capacitated vehicle routing on graphs of bounded treewidth, bounded doubling, or highway dimension | 2024-07-19 | Paper |
Approximations for Throughput Maximization
Algorithmica | 2024-04-24 | Paper |
scientific article; zbMATH DE number 7765369 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-14 | Paper |
| Approximation Algorithms for Generalized Path Scheduling | 2023-11-14 | Paper |
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
ACM Transactions on Algorithms | 2023-10-23 | Paper |
| Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment | 2023-02-07 | Paper |
Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment
Algorithmica | 2022-08-18 | Paper |
Improved approximations for capacitated vehicle routing with unsplittable client demands
(available as arXiv preprint) | 2022-08-16 | Paper |
| Scheduling problems over network of machines | 2021-07-28 | Paper |
Scheduling problems over a network of machines
Journal of Scheduling | 2020-01-03 | Paper |
Approximation schemes for clustering with outliers
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Local search yields a PTAS for \(k\)-means in doubling metrics
SIAM Journal on Computing | 2019-05-07 | Paper |
| scientific article; zbMATH DE number 7051239 (Why is no real title available?) | 2019-05-06 | Paper |
Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
Algorithmica | 2019-03-11 | Paper |
LP-based approximation algorithms for facility location in buy-at-bulk network design
Algorithmica | 2019-03-11 | Paper |
Approximation algorithms for minimum-load \(k\)-facility location
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Packing element-disjoint steiner trees
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Minimizing latency of capacitated \(k\)-tours
Algorithmica | 2018-07-25 | Paper |
| Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. | 2018-04-19 | Paper |
| Approximation schemes for clustering with outliers | 2018-03-15 | Paper |
| Approximating connected facility location with lower and upper bounds via LP rounding | 2017-10-17 | Paper |
Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
Algorithmica | 2017-03-27 | Paper |
| Approximation algorithms for minimum-load \(k\)-facility location | 2017-03-22 | Paper |
New approximation algorithms for the unsplittable capacitated facility location problem
Algorithmica | 2016-06-28 | Paper |
How to walk your dog in the mountains with no magic leash
Discrete & Computational Geometry | 2016-02-29 | Paper |
Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
LP-based approximation algorithms for facility location in buy-at-bulk network design
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
Automata, Languages, and Programming | 2015-10-27 | Paper |
On minimum sum of radii and diameters clustering
Algorithmica | 2015-09-03 | Paper |
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms | 2015-08-14 | Paper |
| Approximation algorithms for node-weighted buy-at-bulk network design | 2014-12-18 | Paper |
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms | 2014-09-09 | Paper |
How to walk your dog in the mountains with no magic leash
1293.6829 | 2014-08-07 | Paper |
| Asymmetric traveling salesman path and directed latency problems | 2014-05-22 | Paper |
Asymmetric traveling salesman path and directed latency problems
SIAM Journal on Computing | 2013-11-14 | Paper |
Two-stage robust network design with exponential scenarios
Algorithmica | 2013-03-05 | Paper |
On minimum sum of radii and diameters clustering
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
New approximation algorithms for the unsplittable capacitated facility location problem
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
A weakly robust PTAS for minimum clique partition in unit disk graphs
Algorithmica | 2012-04-26 | Paper |
A constant factor approximation for minimum \(\lambda \)-edge-connected \(k\)-subgraph with metric costs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
Algorithms and Computation | 2011-12-16 | Paper |
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Approximability of packing disjoint cycles
Algorithmica | 2011-05-10 | Paper |
Approximation algorithms for nonuniform buy-at-bulk network design
SIAM Journal on Computing | 2010-11-04 | Paper |
Combination can be hard
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Survivable network design with degree or order constraints
SIAM Journal on Computing | 2010-07-07 | Paper |
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Combination Can Be Hard: Approximability of the Unique Coverage Problem
SIAM Journal on Computing | 2009-08-20 | Paper |
Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
Algorithmica | 2009-05-13 | Paper |
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Two-Stage Robust Network Design with Exponential Scenarios
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Approximability of Packing Disjoint Cycles
Algorithms and Computation | 2008-05-27 | Paper |
Disjoint Cycles: Integrality Gap, Hardness, and Approximation
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Hardness and approximation results for packing Steiner trees
Algorithmica | 2007-06-21 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Large induced forests in triangle-free planar graphs
Graphs and Combinatorics | 2006-06-16 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
Discrete Applied Mathematics | 2004-11-23 | Paper |
[https://portal.mardi4nfdi.de/wiki/Publication:4810508 A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma]
Random Structures & Algorithms | 2004-08-16 | Paper |
| scientific article; zbMATH DE number 2079358 (Why is no real title available?) | 2004-07-28 | Paper |
On sum coloring of graphs
Discrete Applied Mathematics | 2003-06-10 | Paper |
On a conjecture of Keedwell and the cycle double cover conjecture
Discrete Mathematics | 2001-11-28 | Paper |
