| Publication | Date of Publication | Type |
|---|
Euclidean bottleneck Steiner tree is fixed-parameter tractable
| 2024-11-28 | Paper |
Minimum-membership geometric set cover, revisited
| 2024-10-16 | Paper |
Coresets for clustering in geometric intersection graphs
| 2024-10-16 | Paper |
FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii
| 2024-10-16 | Paper |
Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants
Algorithmica | 2024-08-13 | Paper |
Subexponential parameterized algorithms for cut and cycle hitting problems on \(H\)-minor-free graphs
| 2024-07-19 | Paper |
True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
| 2024-05-14 | Paper |
Proportionally Fair Matching with Multiple Groups
| 2024-05-03 | Paper |
On coresets for fair clustering in metric and Euclidean spaces and their applications
Journal of Computer and System Sciences | 2024-03-11 | Paper |
Socially fair matching: exact and approximation algorithms
Lecture Notes in Computer Science | 2024-01-16 | Paper |
A parameterized approximation scheme for generalized partial vertex cover
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788617 (Why is no real title available?)
| 2024-01-15 | Paper |
On colorful vertex and edge cover problems
Algorithmica | 2023-12-13 | Paper |
scientific article; zbMATH DE number 7758333 (Why is no real title available?)
| 2023-10-31 | Paper |
How to find a good explanation for clustering?
Artificial Intelligence | 2023-08-28 | Paper |
Lossy kernelization of same-size clustering
Theory of Computing Systems | 2023-08-17 | Paper |
Parameterized Complexity of Feature Selection for Categorical Data Clustering.
| 2023-08-08 | Paper |
Improved bounds for metric capacitated covering problems
Algorithmica | 2023-06-28 | Paper |
scientific article; zbMATH DE number 7651148 (Why is no real title available?)
| 2023-02-07 | Paper |
Lossy kernelization of same-size clustering
| 2022-11-11 | Paper |
On fair covering and hitting problems
| 2022-06-08 | Paper |
A constant approximation for colorful \(k\)-center
| 2022-05-11 | Paper |
On perturbation resilience of non-uniform \(k\)-center
Algorithmica | 2022-02-01 | Paper |
Near-optimal clustering in the \(k\)-machine model
Theoretical Computer Science | 2021-12-22 | Paper |
Geometric planar networks on bichromatic collinear points
Theoretical Computer Science | 2021-11-18 | Paper |
Improved approximation bounds for the minimum constraint removal problem
| 2021-08-04 | Paper |
Approximating dominating set on intersection graphs of rectangles and L-frames
| 2021-08-04 | Paper |
Improved approximation bounds for the minimum constraint removal problem
Computational Geometry | 2020-10-23 | Paper |
Capacitated covering problems in geometric spaces
| 2020-08-18 | Paper |
Geometric planar networks on bichromatic points
| 2020-07-21 | Paper |
Capacitated covering problems in geometric spaces
Discrete & Computational Geometry | 2020-06-16 | Paper |
Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
Computational Geometry | 2019-10-25 | Paper |
Approximate clustering via metric partitioning
| 2018-04-19 | Paper |
On variants of \(k\)-means clustering
| 2018-01-30 | Paper |
Approximation schemes for partitioning: convex decomposition and surface approximation
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Effectiveness of local search for art gallery problems
| 2017-09-22 | Paper |
Polynomial time algorithms for bichromatic problems
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
On the approximability of orthogonal order preserving layout adjustment
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Voronoi game on graphs
Theoretical Computer Science | 2014-12-02 | Paper |
Voronoi game on graphs
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
