We study two classic variants of block-structured integer programming. Two-stage stochastic
programs are integer programs of the form {A ix+ D iyi= bi for all i= 1,…, n}, where Ai and Di …

We consider fundamental algorithmic number theoretic problems and their relation to a class
of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage …

Social distance games have been extensively studied as a coalition formation model where
the utilities of agents in each coalition were captured using a utility function $ u $ that took …

We analyze the complexity of several NP-hard election-related problems under the
assumptions that the voters have group-separable preferences. We show that under this …

The web ranking is an essential information to measure the quality of service of a web page.
The dynamic changes in the web information need an efficient framework to rank the web …

In our paper, we consider the following general problems: check feasibility, count the
number of feasible solutions, find an optimal solution, and count the number of optimal …

Let a polytope $ P $ be defined by a system $ A x\leq b $. We consider the problem of
counting the number of integer points inside $ P $, assuming that $ P $ is $\Delta $-modular …

This paper deals with the complexity of some natural graph problems parameterized by
some measures that are restrictions of clique-width, such as modular-width and …

A branch vertex in a tree is a vertex of degree at least three. We study the NP-hard problem
of constructing spanning trees with as few branch vertices as possible. This problem …

We study the computational complexity of fairly allocating indivisible, mixed-manna items.
For basic measures of fairness, this problem is hard in general. Thus, research has …