Pallavi Jain

According to our database, Pallavi Jain authored at least 39 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Controlling Delegations in Liquid Democracy.

Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon

CoRR, 2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana

CoRR, 2024

Conflict and Fairness in Resource Allocation.

Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

CoRR, 2024

Budget-feasible Egalitarian Allocation of Conflicting Jobs.

Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi

CoRR, 2024

Sparsity in Covering Solutions.

Pallavi Jain, Manveer Singh Rathore

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Maximizing Nash Social Welfare under Two-Sided Preferences.

Pallavi Jain, Rohit Vaish

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.

Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon

Algorithmica, December, 2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.

Sushmita Gupta, Pallavi Jain, Saket Saurabh

CoRR, 2023

More Effort Towards Multiagent Knapsack.

Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Scatter search for the minimum leaf spanning tree problem.

Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí

Comput. Oper. Res., 2022

Gehrlein Stable Committee with Multi-modal Preferences.

Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Preserving Consistency for Liquid Knapsack Voting.

Pallavi Jain, Krzysztof Sornat, Nimrod Talmon

Proceedings of the Multi-Agent Systems - 19th European Conference, 2022

2021

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.

Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale

ACM Trans. Comput. Theory, 2021

Parameterized Complexity of d-Hitting Set with Quotas.

Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.

Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Participatory Budgeting with Project Groups.

Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Circumventing Connectivity for Kernelization.

Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Partition Aggregation for Participatory Budgeting.

Pallavi Jain, Nimrod Talmon, Laurent Bulteau

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Vertex deletion on split graphs: Beyond 4-hitting set.

Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot

Theor. Comput. Sci., 2020

Quadratic vertex kernel for split vertex deletion.

Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika

Theor. Comput. Sci., 2020

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.

Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra

Theory Comput. Syst., 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh

Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.

Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Auton. Agents Multi Agent Syst., 2020

Well-Structured Committees.

Sushmita Gupta, Pallavi Jain, Saket Saurabh

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Participatory Budgeting with Project Interactions.

Pallavi Jain, Krzysztof Sornat, Nimrod Talmon

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.

Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Committee Selection with Multimodal Preferences.

Pallavi Jain, Nimrod Talmon

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

Exact and Approximate Digraph Bandwidth.

Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Exploring the Kernelization Borders for Hitting Cycles.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max <i>l</i>-uncut.

Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Hitting and Covering Partially.

Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem.

Pallavi Jain, Gur Saran, Kamal Srivastava

Electron. Notes Discret. Math., 2017

Mixed Dominating Set: A Parameterized Perspective.

Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem.

Pallavi Jain, Gur Saran, Kamal Srivastava

J. Autom. Mob. Robotics Intell. Syst., 2016

On minimizing vertex bisection using a memetic algorithm.

Pallavi Jain, Gur Saran, Kamal Srivastava

Inf. Sci., 2016

Minimizing cyclic cutwidth of graphs using a memetic algorithm.

Pallavi Jain, Kamal Srivastava, Gur Saran

J. Heuristics, 2016