| Publication | Date of Publication | Type |
|---|
| Parameterized approximation for robust clustering in discrete geometric spaces | 2026-01-14 | Paper |
| Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations | 2024-07-19 | Paper |
Simplification of Polyline Bundles
(available as arXiv preprint) | 2023-11-02 | Paper |
Mind the gap: edge facility location problems in theory and practice
Algorithms and Discrete Applied Mathematics | 2023-08-17 | Paper |
Coloring mixed and directional interval graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Consistent simplification of polyline tree bundles
(available as arXiv preprint) | 2023-03-30 | Paper |
PTAS for Steiner tree on map graphs
(available as arXiv preprint) | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7561415 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
(available as arXiv preprint) | 2022-07-21 | Paper |
Hypergraph representation via axis-aligned point-subspace cover
(available as arXiv preprint) | 2022-07-13 | Paper |
On minimum generalized Manhattan connections
(available as arXiv preprint) | 2022-03-25 | Paper |
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
(available as arXiv preprint) | 2021-11-26 | Paper |
scientific article; zbMATH DE number 7378687 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| scientific article; zbMATH DE number 7376034 (Why is no real title available?) | 2021-07-28 | Paper |
A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
(available as arXiv preprint) | 2021-04-21 | Paper |
Approximating node-weighted \(k\)-MST on planar graphs
Theory of Computing Systems | 2020-06-02 | Paper |
Constant-factor approximation for ordered \(k\)-median
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Approximating node-weighted \(k\)-MST on planar graphs
Approximation and Online Algorithms | 2019-01-15 | Paper |
New algorithms for maximum disjoint paths based on tree-likeness
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
New algorithms for maximum disjoint paths based on tree-likeness
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithmica | 2018-05-23 | Paper |
An improved approximation algorithm for knapsack median using sparsification
Algorithmica | 2018-05-23 | Paper |
| New algorithms for maximum disjoint paths based on tree-likeness | 2018-03-02 | Paper |
Bi-factor approximation algorithms for hard capacitated \(k\)-median problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
Network design problems with bounded distances via shallow-light Steiner trees
(available as arXiv preprint) | 2017-01-24 | Paper |
Colored Non-crossing Euclidean Steiner Forest
Algorithms and Computation | 2016-01-11 | Paper |
An improved approximation algorithm for knapsack median using sparsification
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Better approximation algorithms for the maximum internal spanning tree problem
Algorithmica | 2015-06-25 | Paper |
Approximating spanning trees with few branches
Theory of Computing Systems | 2015-05-12 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Algorithmica | 2015-03-02 | Paper |
On monotone drawings of trees
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Improved approximation algorithms for box contact representations
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithms and Computation | 2014-01-14 | Paper |
Approximating spanning trees with few branches
Approximation and Online Algorithms | 2013-09-13 | Paper |
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
Approximation and Online Algorithms | 2012-07-16 | Paper |
Drawing graphs with vertices at specified positions and crossings at large angles
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
Graph Drawing | 2012-03-09 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Maximum betweenness centrality: approximability and tractable cases
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
An optimal algorithm for single maximum coverage location on trees and related problems
Algorithms and Computation | 2010-12-09 | Paper |
An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
Information Processing Letters | 2010-06-16 | Paper |
Relaxed voting and competitive location under monotonous gain functions on trees
Discrete Applied Mathematics | 2010-05-05 | Paper |
\((r,p)\)-centroid problems on paths and trees
Theoretical Computer Science | 2009-11-06 | Paper |
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Multiple voting location and single voting location on trees
European Journal of Operational Research | 2007-04-19 | Paper |
