6 papers
Geometric Graph Representations via Compact SAT Encodings
L. Sunil Chandran, Rishikesh Gajjala, Suraj Kumar Sahoo +1
We present compact SAT encodings and certifying exact solvers for boxicity and cubicity. The boxicity of a graph is the minimum dimension in which it is the intersection graph of a…
Parameterized algorithms for representing graphs as intersections of threshold graphs
L. Sunil Chandran, Suraj Kumar Sahoo
A graph is called a threshold graph if there is an assignment of real valued weights to its vertices such that two vertices have an edge between them if and only if the sum of the…
Sharp quadratic -binding functions for powers of bipartite graphs
Arpan Sadhukhan, Suraj Kumar Sahoo
For every natural number , we construct powers of bipartite graphs whose chromatic number is quadratic in their clique number, showing that the straightforward qu…
The boxicity of the compressed zero divisor graph of the ring of integers modulo N
L. Sunil Chandran, Suraj Kumar Sahoo
The boxicity of a graph , denoted by , is the minimum integer such that is the intersection graph of axis-parallel boxes in . The class of ze…
Learning Regularizers: Learning Optimizers that can Regularize
Suraj Kumar Sahoo, Narayanan C Krishnan
Learned Optimizers (LOs), a type of Meta-learning, have gained traction due to their ability to be parameterized and trained for efficient optimization. Traditional gradient-based…
Boxicity of Zero Divisor Graphs
L. Sunil Chandran, Suraj Kumar Sahoo
A -dimensional box is the cartesian product where each is a closed interval on the real line. The boxicity of a graph, denoted as , is…