Pallavi Jain
Title
Cited by
Cited by
Year
Participatory Budgeting with Project Interactions.
P Jain, K Sornat, N Talmon
IJCAI, 386-392, 2020
172020
On minimizing vertex bisection using a memetic algorithm
P Jain, G Saran, K Srivastava
Information Sciences 369, 765-787, 2016
102016
Branch and bound algorithm for vertex bisection minimization problem
P Jain, G Saran, K Srivastava
Advanced Computing and Communication Technologies, 17-23, 2016
102016
Mixed Dominating Set: A Parameterized Perspective
P Jain, M Jayakrishnan, F Panolan, A Sahu
International Workshop on Graph-Theoretic Concepts in Computer Science, 330-343, 2017
82017
A new integer linear programming and quadratically constrained quadratic programming formulation for vertex bisection minimization problem
P Jain, G Saran, K Srivastava
Journal of Automation, Mobile Robotics and Intelligent Systems, 69-73, 2016
82016
Conflict free version of covering problems on graphs: Classical and parameterized
P Jain, L Kanesh, P Misra
Theory of Computing Systems 64 (6), 1067-1093, 2020
72020
Minimizing cyclic cutwidth of graphs using a memetic algorithm
P Jain, K Srivastava, G Saran
Journal of Heuristics 22 (6), 815-848, 2016
72016
Parameterized complexity of conflict-free matchings and paths
A Agrawal, P Jain, L Kanesh, S Saurabh
Algorithmica, 1-27, 2020
52020
Vertex deletion on split graphs: Beyond 4-hitting set
P Choudhary, P Jain, R Krithika, V Sahlot
Theoretical Computer Science 845, 21-37, 2020
42020
On the (Parameterized) Complexity of Almost Stable Marriage
S Gupta, P Jain, S Roy, S Saurabh, M Zehavi
arXiv preprint arXiv:2005.08150, 2020
42020
Exploring the kernelization borders for hitting cycles
A Agrawal, P Jain, L Kanesh, P Misra, S Saurabh
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
42018
Gerrymandering on graphs: computational complexity and parameterized algorithms
S Gupta, P Jain, F Panolan, S Roy, S Saurabh
International Symposium on Algorithmic Game Theory, 140-155, 2021
22021
Participatory Budgeting with Project Groups
P Jain, K Sornat, N Talmon, M Zehavi
arXiv preprint arXiv:2012.05213, 2020
22020
On the parameterized approximability of contraction to classes of chordal graphs
S Gunda, P Jain, D Lokshtanov, S Saurabh, P Tale
arXiv preprint arXiv:2006.10364, 2020
22020
Gehrlein stability in committee selection: parameterized hardness and algorithms
S Gupta, P Jain, S Roy, S Saurabh, M Zehavi
Autonomous Agents and Multi-Agent Systems 34 (1), 1-21, 2020
22020
Partition Aggregation for Budgeting
L Bulteau, P Jain, N Talmon
12th Multidisciplinary Workshop on Advances in Preference Handling, at ECAI’20, 2020
22020
Conflict free feedback vertex set: a parameterized dichotomy
A Agrawal, P Jain, L Kanesh, D Lokshtanov, S Saurabh
Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018
22018
On the parameterized approximability of contraction to classes of chordal graphs
S Gunda, P Jain, D Lokshtanov, S Saurabh, P Tale
ACM Transactions on Computation Theory (TOCT) 13 (4), 1-40, 2021
12021
Partition Aggregation for Participatory Budgeting
P Jain, N Talmon, L Bulteau
Proceedings of the 20th International Conference on Autonomous Agents and …, 2021
12021
Well-structured committees
S Gupta, P Jain, S Saurabh
Proceedings of the Twenty-Ninth International Conference on International …, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20