Minimizing cyclic cutwidth of graphs using a memetic algorithm. - Pallavi Jain 001; Kamal Srivastava; Gur Saran (J. Heuristics, 2016)

On minimizing vertex bisection using a memetic algorithm. - Pallavi Jain 001; Gur Saran; Kamal Srivastava (Inf. Sci., 2016)

A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem. - Pallavi Jain 001; Gur Saran; Kamal Srivastava (J. Autom. Mob. Robotics Intell. Syst., 2016)

Mixed Dominating Set: A Parameterized Perspective. - Pallavi Jain 001; Jayakrishnan Madathil; Fahad Panolan; Abhishek Sahu (WG, 2017)

Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. - Pallavi Jain 001; Gur Saran; Kamal Srivastava (Electron. Notes Discret. Math., 2017)

Hitting and Covering Partially. - Akanksha Agrawal 001; Pratibha Choudhary; Pallavi Jain 001; Lawqueen Kanesh; Vibha Sahlot; Saket Saurabh 001 (COCOON, 2018)

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. - Pallavi Jain 001; Lawqueen Kanesh; Jayakrishnan Madathil; Saket Saurabh 001 (GECCO (Companion), 2018)

Exploring the Kernelization Borders for Hitting Cycles. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra; Saket Saurabh 001 (IPEC, 2018)

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Daniel Lokshtanov; Saket Saurabh 001 (MFCS, 2018)

Committee Selection with Multimodal Preferences. - Pallavi Jain 001; Nimrod Talmon (ECAI, 2020)

On the (Parameterized) Complexity of Almost Stable Marriage. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (FSTTCS, 2020)

Participatory Budgeting with Project Interactions. - Pallavi Jain 001; Krzysztof Sornat; Nimrod Talmon (IJCAI, 2020)

Well-Structured Committees. - Sushmita Gupta; Pallavi Jain 001; Saket Saurabh 001 (IJCAI, 2020)

Gehrlein stability in committee selection: parameterized hardness and algorithms. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2020)

Parameterized Complexity of Conflict-Free Matchings and Paths. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Saket Saurabh 001 (Algorithmica, 2020)

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. - Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra (Theory Comput. Syst., 2020)

Quadratic vertex kernel for split vertex deletion. - Akanksha Agrawal 001; Sushmita Gupta; Pallavi Jain 001; R. Krithika 001 (Theor. Comput. Sci., 2020)

Vertex deletion on split graphs: Beyond 4-hitting set. - Pratibha Choudhary; Pallavi Jain 001; R. Krithika 001; Vibha Sahlot (Theor. Comput. Sci., 2020)

Partition Aggregation for Participatory Budgeting. - Pallavi Jain 001; Nimrod Talmon; Laurent Bulteau (AAMAS, 2021)

Circumventing Connectivity for Kernelization. - Pallavi Jain 001; Lawqueen Kanesh; Shivesh Kumar Roy; Saket Saurabh 001; Roohani Sharma (CIAC, 2021)

Participatory Budgeting with Project Groups. - Pallavi Jain 001; Krzysztof Sornat; Nimrod Talmon; Meirav Zehavi (IJCAI, 2021)

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. - Sushmita Gupta; Pallavi Jain 001; Fahad Panolan; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2021)

Parameterized Complexity of d-Hitting Set with Quotas. - Sushmita Gupta; Pallavi Jain 001; Aditya Petety; Sagar Singh (SOFSEM, 2021)

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. - Spoorthy Gunda; Pallavi Jain 001; Daniel Lokshtanov; Saket Saurabh 001; Prafullkumar Tale (ACM Trans. Comput. Theory, 2021)

Preserving Consistency for Liquid Knapsack Voting. - Pallavi Jain 001; Krzysztof Sornat; Nimrod Talmon (EUMAS, 2022)

Gehrlein Stable Committee with Multi-modal Preferences. - Sushmita Gupta; Pallavi Jain 001; Daniel Lokshtanov; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2022)

Scatter search for the minimum leaf spanning tree problem. - Yogita Singh Kardam; Kamal Srivastava; Pallavi Jain 001; Rafael Martí (Comput. Oper. Res., 2022)

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. - Pallavi Jain 001; Lawqueen Kanesh; Fahad Panolan; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (SODA, 2023)

More Effort Towards Multiagent Knapsack. - Sushmita Gupta; Pallavi Jain 001; Sanjay Seetharaman (SOFSEM, 2023)

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. - Sushmita Gupta; Pallavi Jain 001; Saket Saurabh 001 (CoRR, 2023)

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. - Sushmita Gupta; Pallavi Jain 001; Saket Saurabh 001; Nimrod Talmon (Algorithmica, 2023)

Maximizing Nash Social Welfare under Two-Sided Preferences. - Pallavi Jain 001; Rohit Vaish (AAAI, 2024)

Manipulation With(out) Money in Matching Market. - Sushmita Gupta; Pallavi Jain 001 (ADT, 2024)

Controlling Delegations in Liquid Democracy. - Shiri Alouf-Heffetz; Tanmay Inamdar 002; Pallavi Jain 001; Nimrod Talmon; Yash More Hiren (AAMAS, 2024)

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. - Sushmita Gupta; Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2024)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. - Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (ICALP, 2024)

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. - Pallavi Jain 001; Lawqueen Kanesh; Fahad Panolan; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (LATIN (2), 2024)

Sparsity in Covering Solutions. - Pallavi Jain 001; Manveer Singh Rathore (LATIN (2), 2024)

Conflict and Fairness in Resource Allocation. - Susobhan Bandopadhyay; Aritra Banik; Sushmita Gupta; Pallavi Jain 001; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2024)

Parameterized Complexity of Disconnected Matchings. - Sushmita Gupta; Pallavi Jain 001; Lawqueen Kanesh; Sounak Modak; Saket Saurabh 001 (CIAC (2), 2025)

Exact and Approximate Digraph Bandwidth. - Pallavi Jain 001; Lawqueen Kanesh; William Lochet; Saket Saurabh 001; Roohani Sharma (Theory Comput. Syst., 2025)

Fairness and Efficiency in Two-Sided Matching Markets. - Pallavi Jain 001; Palash Jha; Shubham Solanki (CoRR, 2025)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. - Sushmita Gupta; Pallavi Jain 001; Souvik Saha 002; Saket Saurabh 001; Anannya Upasana (CoRR, 2025)

Efficient Algorithms for Electing Successive Committees. - Pallavi Jain 001; Andrzej Kaczmarczyk 003 (CoRR, 2025)

Budget-feasible egalitarian allocation of conflicting jobs. - Sushmita Gupta; Pallavi Jain 001; A. Mohanapriya; Vikash Tripathi (Auton. Agents Multi Agent Syst., 2025)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma. - Sushmita Gupta; Pallavi Jain 001; Sanjay Seetharaman; Meirav Zehavi (CoRR, 2025)