activity
20182024
most citedApproximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?

7 citations · 10 across the 6 of their papers we have counts for

collaborators

7 papers

cs.GT2024

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations

Umang Bhaskar, Gunjan Kumar, Yeshwant Pandit +1

In the fair division of items among interested agents, envy-freeness is possibly the most favoured and widely studied formalisation of fairness. For indivisible items, envy-free al…

cs.CC2023★ 7 cited

Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?

Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar +1

Given a Boolean formula over variables, the problem of model counting is to compute the number of solutions of . Model counting is a fundamental problem in computer scie…

cs.FL2023

Regular Methods for Operator Precedence Languages

Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi +1

The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This inc…

cs.DS2021

Skeletons and Minimum Energy Scheduling

Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar

Consider the problem where jobs, each with a release time, a deadline and a required processing time are to be feasibly scheduled in a single- or multi-processor setting so as…

cs.DS2019

Parallel Machine Scheduling to Minimize Energy Consumption

Antonios Antoniadis, Naveen Garg, Gunjan Kumar +1

Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed. Machi…

cs.DS2019★ 3 cited

The Complexity of Partial Function Extension for Coverage Functions

Umang Bhaskar, Gunjan Kumar

Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the co…