Pallavi Jain

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 58

Top Topics

Parameterized Complexity

Global Constraints

Top Venues

Publications

Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren
Controlling Delegations in Liquid Democracy. AAMAS (2024)
Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, Nimrod Talmon
Controlling Delegations in Liquid Democracy. CoRR (2024)
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR (2024)
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR (2024)
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
Budget-feasible Egalitarian Allocation of Conflicting Jobs. CoRR (2024)
Pallavi Jain, Manveer Singh Rathore
Sparsity in Covering Solutions. LATIN (2) (2024)
Pallavi Jain, Rohit Vaish
Maximizing Nash Social Welfare under Two-Sided Preferences. AAAI (2024)
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Conflict and Fairness in Resource Allocation. CoRR (2024)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) (2024)
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
Budget-feasible Egalitarian Allocation of Conflicting Jobs. AAMAS (2024)
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP (2024)
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
More Effort Towards Multiagent Knapsack. SOFSEM (2023)
Pallavi Jain, Rohit Vaish
Maximizing Nash Social Welfare under Two-Sided Preferences. CoRR (2023)
Sushmita Gupta, Pallavi Jain, Saket Saurabh
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR (2023)
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85 (12) (2023)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
-Weight SAT and Max Coverage. SODA (2023)
Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
Gehrlein Stable Committee with Multi-modal Preferences. SAGT (2022)
Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí
Scatter search for the minimum leaf spanning tree problem. Comput. Oper. Res. 145 (2022)
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon
Preserving Consistency for Liquid Knapsack Voting. EUMAS (2022)
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
More Effort Towards Multiagent Knapsack. CoRR (2022)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR (2021)
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
Participatory Budgeting with Project Groups. IJCAI (2021)
Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma
Circumventing Connectivity for Kernelization. CIAC (2021)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT (2021)
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI (2021)
Pallavi Jain, Nimrod Talmon, Laurent Bulteau
Partition Aggregation for Participatory Budgeting. AAMAS (2021)
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon
Preserving Consistency for Liquid Knapsack Voting. AAMAS (2021)
Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh
Parameterized Complexity of d-Hitting Set with Quotas. SOFSEM (2021)
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Trans. Comput. Theory 13 (4) (2021)
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon
Participatory Budgeting with Project Interactions. IJCAI (2020)
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. CoRR (2020)
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833 (2020)
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica 82 (7) (2020)
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
Vertex deletion on split graphs: Beyond 4-hitting set. Theor. Comput. Sci. 845 (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS (2020)
Pallavi Jain, Nimrod Talmon
Committee Selection with Multimodal Preferences. ECAI (2020)
Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
Participatory Budgeting with Project Groups. CoRR (2020)
Sushmita Gupta, Pallavi Jain, Saket Saurabh
Well-Structured Committees. IJCAI (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34 (1) (2020)
Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst. 64 (6) (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR (2020)
Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. APPROX-RANDOM (2020)
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
Parameterized Complexity of Conflict-Free Matchings and Paths. MFCS (2019)
Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. CIAC (2019)
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC (2019)
Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
Exact and Approximate Digraph Bandwidth. FSTTCS (2019)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS (2019)
Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. CSR (2018)
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
Exploring the Kernelization Borders for Hitting Cycles. IPEC (2018)
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS (2018)
Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
-uncut. GECCO (Companion) (2018)
Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh
Hitting and Covering Partially. COCOON (2018)
Pallavi Jain, M. Jayakrishnan, Fahad Panolan, Abhishek Sahu
Mixed Dominating Set: A Parameterized Perspective. WG (2017)
Pallavi Jain, Gur Saran, Kamal Srivastava
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. CoRR (2017)
Pallavi Jain, Gur Saran, Kamal Srivastava
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. Electron. Notes Discret. Math. 63 (2017)
Pallavi Jain, Gur Saran, Kamal Srivastava
On minimizing vertex bisection using a memetic algorithm. Inf. Sci. 369 (2016)
Pallavi Jain, Gur Saran, Kamal Srivastava
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem. J. Autom. Mob. Robotics Intell. Syst. 10 (1) (2016)
Pallavi Jain, Kamal Srivastava, Gur Saran
Minimizing cyclic cutwidth of graphs using a memetic algorithm. J. Heuristics 22 (6) (2016)