Manjish Pal

activity

20092021

collaborators

5 papers

cs.LG2021

Learning from Satisfying Assignments Using Risk Minimization

Manjish Pal. Subham Pokhriyal

In this paper we consider the problem of Learning from Satisfying Assignments introduced by \cite{1} of finding a distribution that is a close approximation to the uniform distribu…

cs.SI2018

EvoCut : A new Generalization of Albert-Barabási Model for Evolution of Complex Networks

Shailesh Kumar Jaiswal, Nabajyoti Medhi, Manjish Pal +3

With the evolution of social networks, the network structure shows dynamic nature in which nodes and edges appear as well as disappear for various reasons. The role of a node in th…

cs.CG2018

Rederiving the Upper Bound for Halving Edges using Cardano's Formula

Pintu Chauhan, Manjish Pal, Napendra Solanki

In this paper we rederive an old upper bound on the number of halving edges present in the halving graph of an arbitrary set of $n$ points in 2-dimensions which are placed in gener…

cs.DS2010

Combinatorial Geometry of Graph Partitioning - I

Manjish Pal

The {\sc $c$ -Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$ , one aims to find a cut of minimum size such that both the sides of the cut have…

cs.DS2009

Towards an $O (3 lo g n)$ -Approximation Algorithm for {\sc Balanced Separator}

Manjish Pal

The {\sc $c$ -Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$ , one aims to find a cut of minimum size such that both the sides of the cut have…

Learning from Satisfying Assignments Using Risk Minimization

EvoCut : A new Generalization of Albert-Barabási Model for Evolution of Complex Networks

Rederiving the Upper Bound for Halving Edges using Cardano's Formula

Combinatorial Geometry of Graph Partitioning - I

Towards an O(3logn​)-Approximation Algorithm for {\sc Balanced Separator}

Towards an $O (3 lo g n)$ -Approximation Algorithm for {\sc Balanced Separator}