research
∙
08/30/2023
Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations
This paper studies k-claw-free graphs, exploring the connection between ...
share
research
∙
05/12/2023
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
We consider the well-studied Robust (k, z)-Clustering problem, which gen...
research
∙
04/06/2023
Parameterized Approximation Schemes for Clustering with General Norm Objectives
This paper considers the well-studied algorithmic regime of designing a ...
research
∙
08/30/2022
Coloring Mixed and Directional Interval Graphs
A mixed graph has a set of vertices, a set of undirected egdes, and a se...
research
∙
11/26/2021
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
We propose a new representation of k-partite, k-uniform hypergraphs (i.e...
research
∙
11/11/2021
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
The fundamental sparsest cut problem takes as input a graph G together w...
research
∙
08/24/2021
Consistent Simplification of Polyline Tree Bundles
The Polyline Bundle Simplification (PBS) problem is a generalization of ...
research
∙
10/27/2020
On Minimum Generalized Manhattan Connections
We consider minimum-cardinality Manhattan connected sets with arbitrary ...
research
∙
12/02/2019
PTAS for Steiner Tree on Map Graphs
We study the Steiner tree problem on map graphs, which substantially gen...
research
∙
07/11/2019
Simplification of Polyline Bundles
We propose and study generalizations to the well-known problem of polyli...
research
∙
08/14/2018
A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
We propose a very simple and natural approximation algorithm for the pro...
research
∙
06/07/2018
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity
We initiate the study of the following natural geometric optimization pr...
research
∙
04/29/2018
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
Motivated by applications in machine learning, such as subset selection ...
research
∙
12/31/2017
Approximating Node-Weighted k-MST on Planar Graphs
We study the problem of finding a minimum weight connected subgraph span...
research
∙
11/06/2017
