This paper studies k-claw-free graphs, exploring the connection between ...
We consider the well-studied Robust (k, z)-Clustering problem, which
gen...
This paper considers the well-studied algorithmic regime of designing a
...
A mixed graph has a set of vertices, a set of undirected egdes, and a se...
We propose a new representation of k-partite, k-uniform hypergraphs (i.e...
The fundamental sparsest cut problem takes as input a graph G together w...
The Polyline Bundle Simplification (PBS) problem is a generalization of ...
We consider minimum-cardinality Manhattan connected sets with arbitrary
...
We study the Steiner tree problem on map graphs, which substantially
gen...
We propose and study generalizations to the well-known problem of polyli...
We propose a very simple and natural approximation algorithm for the pro...
We initiate the study of the following natural geometric optimization
pr...
Motivated by applications in machine learning, such as subset selection ...
We study the problem of finding a minimum weight connected subgraph span...
We study the Ordered k-Median problem, in which the solution is evaluate...