8 citations · 8 across the 2 of their papers we have counts for
4 papers
Improved linearly ordered colorings of hypergraphs via SDP rounding
Anand Louis, Alantha Newman, Arka Ray
We consider the problem of linearly ordered (LO) coloring of hypergraphs. A hypergraph has an LO coloring if there is a vertex coloring, using a set of ordered colors, so that (i)…
Improved Hardness of Approximation for Geometric Bin Packing
Arka Ray, Sai Sandeep
The Geometric Bin Packing (GBP) problem is a generalization of Bin Packing where the input is a set of -dimensional rectangles, and the goal is to pack them into unit -dimens…
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Anand Louis, Rameesh Paul, Arka Ray
There are a lot of recent works on generalizing the spectral theory of graphs and graph partitioning to hypergraphs. There have been two broad directions toward this goal. One gene…
There is no APTAS for 2-dimensional vector bin packing: Revisited
Arka Ray
We study the Vector Bin Packing and the Vector Bin Covering problems, multidimensional generalizations of the Bin Packing and the Bin Covering problems, respectively. In the Vector…